The increasing cost tree search for optimal multi-agent pathfinding

DOI10.1016/J.ARTINT.2012.11.006zbMATH Open1270.68337OpenAlexW1973396716MaRDI QIDQ360145FDOQ360145

Authors: Guni Sharon, Roni Stern, Meir Goldenberg, Ariel Felner 

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

Recommendations

• Branch-and-cut-and-price for multi-agent path finding
• Conflict-based search for optimal multi-agent pathfinding
• Multi-agent Path Finding Modulo Theory with Continuous Movements and the Sum of Costs Objective
• Optimal Multi-Agent Coordination Under Tree Formation Constraints
• Multi-agent pathfinding with continuous time
• Exploration costs as a means for improving performance in multiagent systems
• Using multiple searchers in constrained-path, moving-target search problems
• Multi-agent pathfinding with \(n\) agents on graphs with \(n\) vertices: combinatorial classification and tight algorithmic bounds
• Path optimization for the resource-constrained searcher
• Multi-Agent Path Finding: A New Boolean Encoding

Mathematics Subject Classification ID

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

Cited In (13)

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

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

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