Conflict-tolerant and conflict-free multi-agent meeting
From MaRDI portal
Publication:6136090
DOI10.1016/j.artint.2023.103950MaRDI QIDQ6136090
Shahaf S. Shperberg, Dor Atzmon, Nathan R. Sturtevant, Ariel Felner, Jiaoyang Li, Sven Koenig
Publication date: 28 August 2023
Published in: Artificial Intelligence (Search for Journal in Brave)
conflict-based searchmulti-agent path findingconflict-freenetwork-flowconflict-tolerantMM*multi-agent meetingmulti-directional heuristic search
Cites Work
- A note on two problems in connexion with graphs
- The increasing cost tree search for optimal multi-agent pathfinding
- Location problems with costs being sums of powers of Euclidean distances
- An optimal method for solving the (generalized) multi-Weber problem
- Subdimensional expansion for multirobot path planning
- Conflict-based search for optimal multi-agent pathfinding
- The centrality index of a graph
- The Weighted Euclidean 1-Center Problem
- Finding Minimum-Cost Circulations by Successive Approximation
- Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
- Generalized best-first search strategies and the optimality of A*
- The Euclidean Multifacility Location Problem
- Robust Multi-Agent Path Finding and Executing
This page was built for publication: Conflict-tolerant and conflict-free multi-agent meeting