Conflict-tolerant and conflict-free multi-agent meeting

DOI10.1016/J.ARTINT.2023.103950MaRDI QIDQ6136090FDO

Authors Dor Atzmon, Ariel Felner, Jiaoyang Li, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig

Publication date 28 August 2023

Published in Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

conflict-based searchmulti-agent path findingconflict-freenetwork-flowconflict-tolerantMM*multi-agent meetingmulti-directional heuristic search

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites work

• A note on two problems in connexion with graphs
• An optimal method for solving the (generalized) multi-Weber problem
• Conflict-based search for optimal multi-agent pathfinding
• Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
• Finding Minimum-Cost Circulations by Successive Approximation
• Generalized best-first search strategies and the optimality of A*
• Location problems with costs being sums of powers of Euclidean distances
• Robust multi-agent path finding and executing
• Subdimensional expansion for multirobot path planning
• The Euclidean Multifacility Location Problem
• The Weighted Euclidean 1-Center Problem
• The centrality index of a graph
• The increasing cost tree search for optimal multi-agent pathfinding

This page was built for publication: Conflict-tolerant and conflict-free multi-agent meeting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136090)