Skip to main content

Multi-Agent Path Finding with Destination Choice

  • 563 Accesses

Part of the Lecture Notes in Computer Science book series (LNAI,volume 12568)


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.


  • 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

USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions


  1. 1.

    We use the term “network" when the graph is a directed one considering time flow.


  1. Dresner, K., Stone, P.: A multiagent approach to autonomous intersection management. J. Art. Intell. Res. 31, 591–656 (2008)

    Google Scholar 

  2. Gurobi Optimization, LLC: Gurobi optimizer reference manual (2018).

  3. 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)

    CrossRef  Google Scholar 

  4. 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)

    Google Scholar 

  5. Ma, H., et al.: Overview: generalizations of multi-agent path finding to real-world scenarios. arXiv preprint arXiv:1702.05515 (2017)

  6. 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)

    Google Scholar 

  7. Okoso, A., Otaki, K., Nishi, T.: Multi-agent path finding with priority for cooperative automated valet parking. In: ITSC, pp. 2135–2140. IEEE (2019)

    Google Scholar 

  8. Rodriguez, S., Amato, N.M.: Behavior-based evacuation planning. In: IEEE International Conference on Robotics and Automation, pp. 350–355. IEEE (2010)

    Google Scholar 

  9. Sharon, G., Stern, R., Felner, A., Sturtevant, N.R.: Conflict-based search for optimal multi-agent pathfinding. Artif. Intell. 219, 40–66 (2015)

    CrossRef  MathSciNet  Google Scholar 

  10. Silver, D.: Cooperative pathfinding. In: AIIDE, vol. 1, pp. 117–122 (2005)

    Google Scholar 

  11. Stern, R., Sturtevant, N.R., Felner, A., et al.: Multi-agent pathfinding : definitions, variants, and benchmarks. In: SoCS, pp. 151–158 (2019)

    Google Scholar 

  12. Wurman, P.R., D’Andrea, R., Mountz, M.: Coordinating hundreds of cooperative, autonomous vehicles in warehouses. AI Mag. 29(1), 9 (2008)

    Google Scholar 

  13. 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).

    CrossRef  Google Scholar 

  14. Yu, J., LaValle, S.M.: Planning optimal paths for multiple robots on graphs. In: ICRA, pp. 3612–3617. IEEE (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations


Corresponding author

Correspondence to Ayano Okoso .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

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.

Download citation

  • DOI:

  • 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)