Re-Establishing Communication in Teams of Mobile Robots

As communication is important for cooperation, teams of mobile robots need a way to re-establish a wireless connection if they get separated. We develop a method for mobile robots to maintain a belief of each other's positions using locally available information. They can use their belief to plan paths with high probabilities of reconnection. This approach also works for subteams cooperatively searching for a robot or group of robots that they would like to reconnect with. The problem is formulated as a constrained optimization problem which is solved using a branch-and-bound approach. We present simulation results showing the effectiveness of this strategy at reconnecting teams of up to five robots and compare the results to two other strategies.

[1]  Mehrzad Malmirchegini,et al.  Estimation of communication signal strength in robotic networks , 2010, 2010 IEEE International Conference on Robotics and Automation.

[2]  Lorenzo Sabattini,et al.  Distributed Control of Multirobot Systems With Global Connectivity Maintenance , 2013, IEEE Transactions on Robotics.

[3]  Rajan Batta,et al.  Search for an immobile entity on a network , 2008, Eur. J. Oper. Res..

[4]  Ning Xi,et al.  Coordinated multi-robot real-time exploration with connectivity and bandwidth awareness , 2010, 2010 IEEE International Conference on Robotics and Automation.

[5]  Steve Alpern,et al.  Searching for an Agent Who May OR May Not Want to be Found , 2002, Oper. Res..

[6]  Ali Jadbabaie,et al.  Decentralized Control of Connectivity for Multi-Agent Systems , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[7]  Geoffrey A. Hollinger,et al.  Distributed Data Fusion for Multirobot Search , 2015, IEEE Transactions on Robotics.

[8]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[9]  Geoffrey A. Hollinger,et al.  Multirobot Coordination With Periodic Connectivity: Theory and Experiments , 2012, IEEE Transactions on Robotics.

[10]  Howie Choset,et al.  Efficient Boustrophedon Multi-Robot Coverage: an algorithmic approach , 2008, Annals of Mathematics and Artificial Intelligence.

[11]  Yasamin Mostofi,et al.  Characterization and modeling of wireless channels for networked robotic and control systems - a comprehensive overview , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[12]  Gamini Dissanayake,et al.  Optimal search for multiple targets in a built environment , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[13]  Howie Choset,et al.  Coverage for robotics – A survey of recent results , 2001, Annals of Mathematics and Artificial Intelligence.

[14]  Andrzej Pelc,et al.  Deterministic Rendezvous in Graphs , 2003, ESA.

[15]  Gamini Dissanayake,et al.  Probabilistic Search for a Moving Target in an Indoor Environment , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[16]  Vijay Kumar,et al.  Connectivity management in mobile robot teams , 2008, 2008 IEEE International Conference on Robotics and Automation.

[17]  Jérémie Chalopin,et al.  Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty , 2013 .

[18]  Michael M. Zavlanos,et al.  Distributed Intermittent Connectivity Control of Mobile Robot Networks , 2017, IEEE Transactions on Automatic Control.

[19]  Nicholas Roy.  Multi-Robot Rendezvous in Unknown Environments or What to do When You ’ re Lost at the Zoo Gregory Dudek , .

[20]  Geoffrey A. Hollinger,et al.  Efficient Multi-robot Search for a Moving Target , 2009, Int. J. Robotics Res..

[21]  Richard Weber,et al.  The rendezvous problem on discrete locations , 1990, Journal of Applied Probability.