The increasing cost tree search for optimal multi-agent pathfinding

2012/11/20 by Guni Sharon, Roni Stern, Meir Goldenberg +1 · 9 citations
Computer Science · #AI-based Problem Solving and Planning #Robotic Path Planning Algorithms #Constraint Satisfaction and Optimization

paper · doi:10.1016/j.artint.2012.11.006

Cited by

• Conflict-based search for optimal multi-agent pathfinding
• Priority inheritance with backtracking for iterative multi-agent path finding
• CBS-Budget (CBSB): A complete and bounded suboptimal search for multi-agent path finding
• Formation Control with Lane Preference for Connected and Automated Vehicles in Multi-lane Scenarios
• EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding
• Lifelong Multi-Agent Path Finding in Large-Scale Warehouses
• Improvements in Sub-optimal Solving of the (N²-1)-Puzzle via Joint Relocation of Pebbles and its Applications to Rule-based Cooperative Path-Finding
• Non-Communication Decentralized Multi-Robot Collision Avoidance in Grid Map Workspace with Double Deep Q-Network. [europepmc]
• Multi-Robot Path Planning for High-Density Parking Environments Considering Efficiency and Fairness. [europepmc]