Abstract
This paper mainly discusses the pursuit-evasion games, in which a team of autonomous mobile robots act as pursuers to pursue multiple moving targets cooperatively. In order to reduce the communication load during the task negotiation process, the auction mechanism in Economics was introduced, and an improved task negotiation process based on Task Bundle Auction was proposed. It allocated task dynamically through Dynamic coalition formation of multiple robots. In this paper, we propose the three possible coalition objectives and three different matrics of a multi-robot exploration and pursuit-evader. Based on these extensions, a kind of multi-robot cooperative pursuit algorithm that allows fault injection dynamic alliance is proposed. Simulation results show the feasibility and validity of the given algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Grinton, C.: A tested for Investigation Agent Effectiveness in a Multi-agent Pursuit Game. The University of Melboume, Victoria (1996)
Vidal, R., Shakemia, O., Kim, H.J., et al.: Probabilistic pursuit-evasion games theory, implementation, and experimental evaluation. IEEE Transactions on Robotics and Automation 5, 662–669 (2002)
Yamauchi, B.: A Frontier based approach for autonomous exploration. In: Proceedings of IEEE International Symposium on computational Intelligence in Robotics and Automation, Monterey, CA, July 10–11 (1997)
Berhault, M., Huang, H., Keskinocak, P., Koening, S., Elmaghraby, W., Griffin, P., Kleywegt, A.: Robot Exploration with Combinatorial auctions. In: Proceedings of the IEEE International Conference on intelligent Robots and Systems (IROS), pp. 1957–1962 (2003)
Zavlanos, M.M., Pappas, G.J.: Distributed Hybrid Control for Multiple-Pursuer Multiple-Evader Games. In: Bemporad, A., Bicchi, A., Buttazzo, G. (eds.) HSCC 2007. LNCS, vol. 4416, pp. 787–789. Springer, Heidelberg (2007)
Zlot, R., Stentz, A., Dias, M., Thayer, S.: Multi-robot exploration controlled by a market economy. In: Proceedings of the IEEE international conference on Robotics and automation, Washington, USA, pp. 3016–3023 (2002)
Simmons, R., Apfelbaum, D., Burgard, W., Fox, D., Moors, M., Thrun, S., Younes, H.: Coordination for multi-robot exploration and mapping. In: Proceedings of the National Conference on Artificial intelliance, Austin, TX, pp. 852–858 (2000)
Vig, L., Adams, J.A.: Issues in multi-robot coalition formation. Proceedings of Multi-robot Systems. From Swarms to Intelligent Automata 3, 15–26 (2005)
Zlot, R., Stentz, A.: Market-based multirobot coordination for complex tasks. International Journal of Robotics research 25, 73–101 (2006)
Taohaijun, Wangyadong, Guomaozu, Wanghanlun: A Multi-Agent Negotiation Model Based on Acquaintance Coalition and Extended Contract Net Protocol. Journal of Computer Research and Development (in Chinese) 7, 1155–1160 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cai, ZS., Sun, LN., Gao, HB., Zhou, PC., Piao, SH., Huang, QC. (2008). Multi-robot Cooperative Pursuit Based on Task Bundle Auctions. In: Xiong, C., Huang, Y., Xiong, Y., Liu, H. (eds) Intelligent Robotics and Applications. ICIRA 2008. Lecture Notes in Computer Science(), vol 5314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88513-9_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-88513-9_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88512-2
Online ISBN: 978-3-540-88513-9
eBook Packages: Computer ScienceComputer Science (R0)