Abstract
When robots perform teamwork in a shared workspace, they might be confronted with the risk of blocking each other’s ways, which will result in conflicts or interference among the robots. How to plan collision-free paths for all the robots is the major challenge issue in the multi-robot cooperative pathfinding problem, in which each robot has to navigate from its starting location to the destination while keeping avoiding stationary obstacles as well as its teammates. In this paper, we present a novel fully decentralized approach to this problem. Our approach allows the robots to make real-time responses to the dynamic environment and can resolve a set of benchmark deadlock situations subject to complex spatial constraints in the robots’ workspace. When confronted with conflicting situations, robots can employ waiting, dodging, retreating and turning-head strategies to make local adjustments. In addition, experimental results show that our proposed approach provides an efficient and competitive solution to this problem.
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
Kaminka, G.A.: Autonomous agents research in robotics: A report from the trenches. In: 2012 AAAI Spring Symposium Series (2012)
Standley, T., Korf, R.: Complete algorithms for cooperative pathfinding problems. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, pp. 668–673 (2011)
Surynek, P.: An optimization variant of multi-robot path planning is intractable. In: AAAI (2010)
Desaraju, V.R., How, J.P.: Decentralized path planning for multi-agent teams with complex constraints. Autonomous Robots 32, 385–403 (2012)
Van Den Berg, J.P., Overmars, M.H.: Prioritized motion planning for multiple robots. In: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 430–435 (2005)
Luna, R., Bekris, K.E.: Efficient and complete centralized multi-robot path planning. In: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 3268–3275. IEEE (2011)
de Wilde, B., ter Mors, A.W., Witteveen, C.: Push and rotate: cooperative multi-agent path planning. In: Proceedings of the Twelfth International Conference on Autonomous Agents and Multiagent Systems, pp. 87–94 (2013)
Parker, L.E.: Decision making as optimization in multi-robot teams. In: Ramanujam, R., Ramaswamy, S. (eds.) ICDCIT 2012. LNCS, vol. 7154, pp. 35–49. Springer, Heidelberg (2012)
Parker, L.E.: Current state of the art in distributed autonomous mobile robotics. In: Distributed Autonomous Robotic Systems 4, pp. 3–12. Springer (2000)
Silver, D.: Cooperative pathfinding. In: The First Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE), pp. 117–122 (2005)
Wang, K.H.C., Botea, A.: Mapp: a scalable multi-agent path planning algorithm with tractability and completeness guarantees. Journal of Artificial Intelligence Research 42, 55–90 (2011)
Ryan, M.R.: Exploiting subgraph structure in multi-robot path planning. Journal of Artificial Intelligence Research 31, 497–542 (2008)
Burgard, W., Moors, M., Stachniss, C., Schneider, F.E.: Coordinated multi-robot exploration. IEEE Transactions on Robotics 21, 376–386 (2005)
Bennewitz, M., Burgard, W., Thrun, S.: Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots. Robotics and Autonomous Systems 41, 89–99 (2002)
Zuluaga, M., Vaughan, R.: Reducing spatial interference in robot teams by local-investment aggression. In: IEEE/RSJ International Conference on Intelligent Robots and Systems(IROS), pp. 2798–2805 (2005)
Dresner, K., Stone, P.: Multiagent traffic management: a reservation-based intersection control mechanism. In: Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 530–537 (2004)
Wang, K.H.C., Botea, A.: Fast and memory-efficient multi-agent pathfinding. In: International Conference on Automated Planning and Scheduling (ICAPS), pp. 380–387 (2008)
Johnson, M., Jonker, C., van Riemsdijk, B., Feltovich, P.J., Bradshaw, J.M.: Joint activity testbed: Blocks world for teams (BW4T). In: Aldewereld, H., Dignum, V., Picard, G. (eds.) ESAW 2009. LNCS, vol. 5881, pp. 254–256. Springer, Heidelberg (2009)
Hindriks, K.: The goal agent programming language (2013), http://ii.tudelft.nl/trac/goal
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Wei, C., Hindriks, K.V., Jonker, C.M. (2014). Multi-robot Cooperative Pathfinding: A Decentralized Approach. In: Ali, M., Pan, JS., Chen, SM., Horng, MF. (eds) Modern Advances in Applied Intelligence. IEA/AIE 2014. Lecture Notes in Computer Science(), vol 8481. Springer, Cham. https://doi.org/10.1007/978-3-319-07455-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-07455-9_3
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07454-2
Online ISBN: 978-3-319-07455-9
eBook Packages: Computer ScienceComputer Science (R0)