Steiner traveler: Relay deployment for remote sensing in heterogeneous multi-robot exploration

In the multi-robot exploration task of an unknown environment, human operators often need to control the robots remotely and obtain the sensed information by real-time bandwidth-consuming multimedia streams. The task has military and civilian applications, such as reconnaissance, search and rescue missions in earthquake, radioactive, and other dangerous or hostile regions. Due to the nature of such applications, infrastructure networks or pre-deployed relays are often not available to support the stream transmission. To address this issue, we present a novel exploration scheme called Bandwidth-aware Exploration with a Steiner Traveler (BEST). BEST has a heterogeneous robot team with a fixed number of frontier nodes (FNs) to sense the area iteratively. In addition, a relay-deployment node (RDN) tracks the FNs movement and places relays when necessary to support the video/audio streams aggregation to the base station. Therefore, the main problem is to find a minimum path for the relay-deployment robot to travel and the positions to deploy necessary relays to support the stream aggregation in each movement iteration. This problem inherits characteristics of both the Steiner minimum tree and traveling salesman problems. We model the novel problem as the minimum velocity Flow constrained Steiner Traveler problem (FST). Extensive simulations show BEST improves exploration efficiency by 62% on average compared to the state-of-the-art homogeneous robot exploration strategies. BEST also saves cost by using only half the number of robots compared to the counterpart, while still achieving a 24% exploration time reduction.

[1]  Hai Liu,et al.  Localized Mobility Control Routing in Robotic Sensor Wireless Networks , 2007, MSN.

[2]  K. Madhava Krishna,et al.  A two phase recursive tree propagation based multi-robotic exploration framework with fixed base station constraint , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[3]  Kim D. Listmann,et al.  DisCoverage: A new paradigm for multi-robot exploration , 2010, 2010 IEEE International Conference on Robotics and Automation.

[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]  Vishal Misra,et al.  Connectivity maintenance in mobile wireless networks via constrained mobility , 2011, 2011 Proceedings IEEE INFOCOM.

[6]  Prasanna Velagapudi,et al.  Using humans as sensors in robotic search , 2009, 2009 12th International Conference on Information Fusion.

[7]  Hanif D. Sherali,et al.  New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints , 2005, Oper. Res. Lett..

[8]  Raghupathy Sivakumar,et al.  Glia: a practical solution for effective high datarate wifi-arrays , 2009, MobiCom '09.

[9]  Ning Xi,et al.  Connectivity and bandwidth-aware real-time exploration in mobile robot networks , 2013, Wirel. Commun. Mob. Comput..

[10]  Matt W. Mutka,et al.  STARS: Static relays for multi-robot real-time search and monitoring , 2011, 2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS).

[11]  Ding-Zhu Du,et al.  Bottleneck Steiner Tree Problem , 2008 .

[12]  Ivan Stojmenovic,et al.  Back-Tracking Based Sensor Deployment by a Robot Team , 2010, 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON).

[13]  Ding-Zhu Du,et al.  Steiner tree problems in computer communication networks , 2008 .

[14]  G. Oriolo,et al.  The Sensor-based Random Graph Method for Cooperative Robot Exploration , 2009, IEEE/ASME Transactions on Mechatronics.

[15]  Andreas Birk,et al.  Multi-robot exploration under the constraints of wireless networking , 2007 .

[16]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .

[17]  Michael Jünger,et al.  A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints , 2000, Comput. Optim. Appl..

[18]  Lusheng Wang,et al.  Relay sensor placement in wireless sensor networks , 2008, Wirel. Networks.

[19]  Matt W. Mutka,et al.  Joint Bandwidth-Aware Relay Placement and Routing in Heterogeneous Wireless Networks , 2011, 2011 IEEE 17th International Conference on Parallel and Distributed Systems.

[20]  Andrea Gasparri,et al.  Multirobot Tree and Graph Exploration , 2011, IEEE Transactions on Robotics.