MODEN: Obstacle-driven Elastic Network for Line-of-Sight Communication

In this paper, we address the problem of connecting two distant communication nodes by deploying a number of mobile robots that act as gateways between the towers. To address this problem, we propose ODEN, a path-planning algorithm that relies on an elastic network to produce an obstacle-free path between the two towers. This algorithm builds over a previous elastic-network-based path-planning algorithm and overcomes some of the major limitations of this algorithm. We also propose an extension of ODEN to address the more complex situation in which multiple pairs of towers must be connected in a common environment. We illustrate the results obtained with both ODEN and its multi-path counterpart, MODEN, in several test-scenarios.

[1]  Vishal Misra,et al.  Spreadable Connected Autonomic Networks (SCAN) , 2008 .

[2]  Mark H. Overmars,et al.  Coordinated path planning for multiple robots , 1998, Robotics Auton. Syst..

[3]  Maria Gini,et al.  Robotic Swarm Dispersion Using Wireless Intensity Signals , 2006, DARS.

[4]  Gaurav S. Sukhatme,et al.  Constrained coverage for mobile sensor networks , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[5]  Guobin Shen,et al.  A BeepBeep ranging system on mobile phones , 2007, SenSys '07.

[6]  Stephen M. Rock,et al.  Dynamic Networks for Motion Planning in Multi-Robot Space Systems , 2003 .

[7]  Wolfram Burgard,et al.  Optimizing schedules for prioritized path planning of multi-robot systems , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[8]  Bernhard Nebel,et al.  RFID-Based Exploration for Large Robot Teams , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[9]  Hari Balakrishnan,et al.  6th ACM/IEEE International Conference on on Mobile Computing and Networking (ACM MOBICOM ’00) The Cricket Location-Support System , 2022 .

[10]  Miguel Castro,et al.  Heuristic Algorithm for Robot Path Planning Based on a Growing Elastic Net , 2005, EPIA.

[11]  Gaurav S. Sukhatme,et al.  An Experimental Study of Localization Using Wireless Ethernet , 2003, FSR.

[12]  Jean-Claude Latombe,et al.  Numerical potential field techniques for robot path planning , 1991, Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.

[13]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .