Optimizing Non-Markovian Information Gain Under Physics-Based Communication Constraints

In many exploration scenarios, it is important for robots to efficiently explore new areas and constantly communicate results. Mobile robots inherently couple motion and network topology due to the effects of position on wireless propagation—e.g. distance or obstacles between network nodes. Information gain is a useful measure of exploration. However, finding paths that maximize information gain while preserving communication is challenging due to the non-Markovian nature of information gain, discontinuities in network topology, and zero-reward local optima. We address these challenges through an optimization and sampling-based algorithm. Our algorithm scales to 50% more robots and obtains 2–5 times more information relative to path cost compared to baseline planning approaches.

[1]  Jonathan Fink,et al.  Communication for teams of networked robots , 2011 .

[2]  Lorenzo Sabattini,et al.  On decentralized connectivity maintenance for mobile robotic systems , 2011, IEEE Conference on Decision and Control and European Control Conference.

[3]  PROPAGATION DATA AND PREDICTION METHODS FOR THE PLANNING OF INDOOR RADIOCOMMUNICATION SYSTEMS AND RADIO LOCAL AREA NETWORKS IN THE FREQUENCY RANGE 900 MHz TO 100 GHz , 1997 .

[4]  Petter Ögren,et al.  Kalman Filter Based Spatial Prediction of Wireless Connectivity for Autonomous Robots and Connected Vehicles , 2018, 2018 IEEE 88th Vehicular Technology Conference (VTC-Fall).

[5]  Vijay Kumar,et al.  Concurrent Control of Mobility and Communication in Multirobot Systems , 2017, IEEE Transactions on Robotics.

[6]  George J. Pappas,et al.  Decentralized active information acquisition: Theory and application to multi-robot SLAM , 2015, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[7]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[8]  Antonio Franchi,et al.  Multi-robot path planning with maintenance of generalized connectivity , 2017, 2017 International Symposium on Multi-Robot and Multi-Agent Systems (MRS).

[9]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..

[10]  Kazuya Yoshida,et al.  Emergency response to the nuclear accident at the Fukushima Daiichi Nuclear Power Plants using mobile rescue robots , 2013, J. Field Robotics.

[11]  Robert J. Wood,et al.  Two foraging algorithms for robot swarms using only local communication , 2010, 2010 IEEE International Conference on Robotics and Biomimetics.

[12]  Steven M. LaValle,et al.  RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[13]  Luis Montano,et al.  Enforcing Network Connectivity in Robot Team Missions , 2010, Int. J. Robotics Res..

[14]  Nathan Michael,et al.  Communication-Efficient Planning and Mapping for Multi-Robot Exploration in Large Environments , 2019, IEEE Robotics and Automation Letters.

[15]  Dieter Kraft,et al.  Algorithm 733: TOMP–Fortran modules for optimal control calculations , 1994, TOMS.

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

[17]  Carlo Pinciroli,et al.  Decentralized Connectivity-Preserving Deployment of Large-Scale Robot Swarms , 2018, 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[18]  Maxim Likhachev,et al.  Anytime Truncated D* : Anytime Replanning with Truncation , 2013, SOCS.

[19]  Mehrzad Malmirchegini,et al.  On the Spatial Predictability of Communication Channels , 2012, IEEE Transactions on Wireless Communications.

[20]  Yushan Chen,et al.  Synthesis of distributed control and communication schemes from global LTL specifications , 2011, IEEE Conference on Decision and Control and European Control Conference.

[21]  John G. Rogers,et al.  Autonomous Exploration Using an Information Gain Metric , 2016 .

[22]  S. LaValle Rapidly-exploring random trees : a new tool for path planning , 1998 .

[23]  P. Sen,et al.  Compressed mapping of communication signal strength , 2008, MILCOM 2008 - 2008 IEEE Military Communications Conference.

[24]  Gaurav S. Sukhatme,et al.  LOST: localization-space trails for robot teams , 2002, IEEE Trans. Robotics Autom..

[25]  George J. Pappas,et al.  Asymptotically Optimal Planning for Non-Myopic Multi-Robot Information Gathering , 2019, Robotics: Science and Systems.

[26]  Anthony Stentz,et al.  Multi-robot exploration controlled by a market economy , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[27]  Vijay Kumar,et al.  Visibility-based deployment of robot formations for communication maintenance , 2011, 2011 IEEE International Conference on Robotics and Automation.

[28]  Giuseppe Notarstefano,et al.  Maintaining limited-range connectivity among second-order agents , 2006, 2006 American Control Conference.

[29]  Lydia E. Kavraki,et al.  The Open Motion Planning Library , 2012, IEEE Robotics & Automation Magazine.

[30]  Luiz Chaimowicz,et al.  The next frontier: combining information gain and distance cost for decentralized multi-robot exploration , 2016, SAC.

[31]  Pieter Abbeel,et al.  Motion planning with sequential convex optimization and convex collision checking , 2014, Int. J. Robotics Res..

[32]  Maja J. Mataric,et al.  On foraging strategies for large-scale multi-robot systems , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[33]  Sebastian Thrun,et al.  ARA*: Anytime A* with Provable Bounds on Sub-Optimality , 2003, NIPS.

[34]  Vijay Kumar,et al.  Online methods for radio signal mapping with mobile robots , 2010, 2010 IEEE International Conference on Robotics and Automation.

[35]  Vijay Kumar,et al.  Information-Theoretic Planning with Trajectory Optimization for Dense 3D Mapping , 2015, Robotics: Science and Systems.

[36]  Magnus Egerstedt,et al.  Graph-theoretic connectivity control of mobile robot networks , 2011, Proceedings of the IEEE.

[37]  Siddhartha S. Srinivasa,et al.  Decentralized estimation and control of graph connectivity in mobile sensor networks , 2008, 2008 American Control Conference.

[38]  Roland Siegwart,et al.  An Efficient Sampling-Based Method for Online Informative Path Planning in Unknown Environments , 2020, IEEE Robotics and Automation Letters.

[39]  Dinesh Manocha,et al.  FCL: A general purpose library for collision and proximity queries , 2012, 2012 IEEE International Conference on Robotics and Automation.

[40]  Stefan Schaal,et al.  STOMP: Stochastic trajectory optimization for motion planning , 2011, 2011 IEEE International Conference on Robotics and Automation.

[41]  Siddhartha S. Srinivasa,et al.  CHOMP: Gradient optimization techniques for efficient motion planning , 2009, 2009 IEEE International Conference on Robotics and Automation.

[42]  Brian M. Sadler,et al.  A parsimonious model for wireless connectivity in robotic networks , 2013, 2013 IEEE Global Conference on Signal and Information Processing.