Abstract
Multi-agent path finding problem (MAPF) is a problem to find collision-free paths on a graph for multiple agents from their initial locations to their destinations. MAPF has mainly two types of variants regarding the usage of agent destination; each agent has a unique destination or all agents share common destinations. We propose the MAPF with destination choice problem (MAPF-DC) as a new variant of MAPF. Agents in MAPF-DC could implicitly select the best destinations out of assigned destination candidates partially shared with other agents. Experimental results indicate that the total travel time declines with an increase in the number of destination candidates assigned to each agent.
Keywords
- Multi-agent path finding problem
- Evacuation route planning problem
- Network flow problem
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
We use the term “network" when the graph is a directed one considering time flow.
References
Dresner, K., Stone, P.: A multiagent approach to autonomous intersection management. J. Art. Intell. Res. 31, 591–656 (2008)
Gurobi Optimization, LLC: Gurobi optimizer reference manual (2018). http://www.gurobi.com
Lim, G.J., Zangeneh, S., Baharnemati, M.R., Assavapokee, T.: A capacitated network flow optimization approach for short notice evacuation planning. Eur. J. Oper. Res. 223(1), 234–245 (2012)
Ma, H., Koenig, S.: Optimal target assignment and path finding for teams of agents. In: Proceedings of AAMAS. International Foundation for Autonomous Agents and Multiagent Systems, pp. 1144–1152 (2016)
Ma, H., et al.: Overview: generalizations of multi-agent path finding to real-world scenarios. arXiv preprint arXiv:1702.05515 (2017)
Ma, H., Li, J., Kumar, T., Koenig, S.: Lifelong multi-agent path finding for online pickup and delivery tasks. In: Proceedings of AAMAS. International Foundation for Autonomous Agents and Multiagent Systems, pp. 837–845 (2017)
Okoso, A., Otaki, K., Nishi, T.: Multi-agent path finding with priority for cooperative automated valet parking. In: ITSC, pp. 2135–2140. IEEE (2019)
Rodriguez, S., Amato, N.M.: Behavior-based evacuation planning. In: IEEE International Conference on Robotics and Automation, pp. 350–355. IEEE (2010)
Sharon, G., Stern, R., Felner, A., Sturtevant, N.R.: Conflict-based search for optimal multi-agent pathfinding. Artif. Intell. 219, 40–66 (2015)
Silver, D.: Cooperative pathfinding. In: AIIDE, vol. 1, pp. 117–122 (2005)
Stern, R., Sturtevant, N.R., Felner, A., et al.: Multi-agent pathfinding : definitions, variants, and benchmarks. In: SoCS, pp. 151–158 (2019)
Wurman, P.R., D’Andrea, R., Mountz, M.: Coordinating hundreds of cooperative, autonomous vehicles in warehouses. AI Mag. 29(1), 9 (2008)
Yu, J., LaValle, S.M.: Multi-agent path planning and network flow. In: Frazzoli, E., Lozano-Perez, T., Roy, N., Rus, D. (eds.) Algorithmic Foundations of Robotics X. STAR, vol. 86, pp. 157–173. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-36279-8_10
Yu, J., LaValle, S.M.: Planning optimal paths for multiple robots on graphs. In: ICRA, pp. 3612–3617. IEEE (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Okoso, A., Otaki, K., Nishi, T. (2021). Multi-Agent Path Finding with Destination Choice. In: Uchiya, T., Bai, Q., Marsá Maestre, I. (eds) PRIMA 2020: Principles and Practice of Multi-Agent Systems. PRIMA 2020. Lecture Notes in Computer Science(), vol 12568. Springer, Cham. https://doi.org/10.1007/978-3-030-69322-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-030-69322-0_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-69321-3
Online ISBN: 978-3-030-69322-0
eBook Packages: Computer ScienceComputer Science (R0)