Multi-robot task allocation for exploration
- 105 Downloads
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.
Key wordsmulti-robot systems task allocation average path cost multi-round single-item auction target tree
Unable to display preview. Download preview PDF.
- Thrun S, Burgard W, Fox D. A real-time algorithm for mobile robot mapping with applications to multi-robot and 3D mapping[C]// Proceedings of IEEE International Conference on Robotics and Automation (ICRA). San Francisco, 2000: 321–328.Google Scholar
- Hougen D. A miniature robotic system for reconnaissance and surveillance[C]// Proceedings of IEEE International Conference on Robotics and Automation (ICRA). San Francisco, 2000: 501–507.Google Scholar
- Kalra N, Ferguson D, Stentz A. Hoplites: a marketbased framework for planned tight coordination in multirobot teams[C]// Proceedings of the International Conference on Robotics and Automation. Barcelona, 2005: 1182–1189.Google Scholar
- Mataric M, Sukhatme G. Task-allocation and coordination of multiple robots for planetary exploration[C] // Proceedings of the International Conference on Advanced Robotics. Buda, 2001: 61–70.Google Scholar
- Zlot R, Stentz A, Dias M, et al. Multi-robot exploration controlled by a market economy[C]// Proceedings of the IEEE International Conference on Robotics and Automation (ICRA). Washington, 2002: 3016–3023.Google Scholar
- ZHANG Fei, CHEN Wei-dong, XI Yu-geng. Improved market-based approach to collaborative multirobot exploration[J]. Control and Decision, 2005, 20(5): 516–524. (in Chinese)Google Scholar
- Lagoudakis M, Berhault M, Koenig S, et al. Simple auction with performance guarantees for multi-robot task allocation[C]// Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). Sendai, 2004: 698–705.Google Scholar
- Dias M B, Zlot N, Kalra R, et al. Market-based multirobot coordination: a survey and analysis[R]. CMU - RI - TR - 05 - 13, Robotics Institute, Carnegie Mellon University, 2005.Google Scholar