Multi-robot task allocation for exploration

The problem of allocating a number of exploration tasks to a team of mobile robots in dynamic environments was studied. The team mission is to visit several distributed targets. The path cost of target is proportional to the distance that a robot has to move to visit the target. The team objective is to minimize the average path cost of target over all targets. Finding an optimal allocation is strongly NP-hard. The proposed algorithm can produce a near-optimal solution to it. The allocation can be cast in terms of a multi-round single-item auction by which robots bid on targets. In each auction round, one target is assigned to a robot that produces the lowest path cost of the target. The allocated targets form a forest where each tree corresponds a robot’s exploring targets set. Each robot constructs an exploring path through depth-first search in its target tree. The time complexity of the proposed algorithm is polynomial. Simulation experiments show that the allocating method is valid.

[1]  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).

[2]  Gaurav S. Sukhatme,et al.  Task-Allocation and Coordination of Multiple Robots for Planetary Exploration , 2001 .

[3]  Michail G. Lagoudakis,et al.  Simple auctions with performance guarantees for multi-robot task allocation , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

[4]  Lynne E. Parker,et al.  Lifelong Adaptation in Heterogeneous Multi-Robot Teams: Response to Continual Variation in Individual Robot Performance , 2000, Auton. Robots.

[5]  Nidhi Kalra,et al.  Hoplites: A Market-Based Framework for Planned Tight Coordination in Multirobot Teams , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[6]  Michail G. Lagoudakis,et al.  The Generation of Bidding Rules for Auction-Based Robot Coordination , 2005 .

[7]  René Sitters,et al.  The Minimum Latency Problem Is NP-Hard for Weighted Trees , 2002, IPCO.

[8]  T.T. Nguyen,et al.  Experiences with operations and autonomy of the Mars Pathfinder Microrover , 1998, 1998 IEEE Aerospace Conference Proceedings (Cat. No.98TH8339).

[9]  Wolfram Burgard,et al.  A real-time algorithm for mobile robot mapping with applications to multi-robot and 3D mapping , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[10]  Nidhi Kalra,et al.  Market-Based Multirobot Coordination: A Survey and Analysis , 2006, Proceedings of the IEEE.

[11]  Manuela M. Veloso,et al.  Task Decomposition, Dynamic Role Assignment, and Low-Bandwidth Communication for Real-Time Strategic Teamwork , 1999, Artif. Intell..

[12]  Robin R. Murphy,et al.  Rescue robotics for homeland security , 2004, CACM.

[13]  Wolfram Burgard,et al.  Coordinated multi-robot exploration , 2005, IEEE Transactions on Robotics.

[14]  Saifallah Benjaafar,et al.  A miniature robotic system for reconnaissance and surveillance , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).