The increasing cost tree search for optimal multi-agent pathfinding

DOI10.1016/J.ARTINT.2012.11.006zbMath1270.68337OpenAlexW1973396716MaRDI QIDQ360145

Roni Stern, Guni Sharon, Ariel Felner, Meir Goldenberg

Publication date: 26 August 2013

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0004370212001543

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Agent technology and artificial intelligence (68T42)

Related Items (12)

Multi-agent pathfinding with continuous time ⋮ Priority inheritance with backtracking for iterative multi-agent path finding ⋮ Path planning for robotic teams based on LTL specifications and Petri net models ⋮ Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems ⋮ Conflict-tolerant and conflict-free multi-agent meeting ⋮ The multiagent planning problem ⋮ A stochastic process approach for multi-agent path finding with non-asymptotic performance guarantees ⋮ Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch ⋮ Pairwise symmetry reasoning for multi-agent path finding search ⋮ Multi-agent path finding with mutex propagation ⋮ Safe Multi-Agent Pathfinding with Time Uncertainty ⋮ Conflict-based search for optimal multi-agent pathfinding

This page was built for publication: The increasing cost tree search for optimal multi-agent pathfinding