Conflict-based search for optimal multi-agent pathfinding

DOI10.1016/j.artint.2014.11.006zbMath1328.68235OpenAlexW1989407213MaRDI QIDQ2343829

Guni Sharon, Ariel Felner, Nathan R. Sturtevant, Roni Stern

Publication date: 6 May 2015

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

Full work available at URL: https://doi.org/10.1016/j.artint.2014.11.006

zbMATH Keywords

heuristic searchmulti-agentpathfinding

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 (24)

Multi-agent pathfinding with continuous time ⋮ Branch-and-cut-and-price for multi-agent path finding ⋮ 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 ⋮ Diagnosis of intermittent faults in multi-agent systems: an SFL approach ⋮ Complexity of planning for connected agents in a partially known environment ⋮ Solving simultaneous target assignment and path planning efficiently with time-independent execution ⋮ Conflict-tolerant and conflict-free multi-agent meeting ⋮ Continuous optimisation problem and game theory for multi-agent pathfinding ⋮ Shadoks Approach to Low-Makespan Coordinated Motion Planning ⋮ Coordinated Motion Planning Through Randomized k -Opt ⋮ An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization ⋮ Unnamed Item ⋮ Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming ⋮ Efficient generation of performance bounds for a class of traffic scheduling problems ⋮ Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch ⋮ Multi-AGVs pathfinding based on improved jump point search in logistic center ⋮ Scheduling for multi-robot routing with blocking and enabling constraints ⋮ Pairwise symmetry reasoning for multi-agent path finding search ⋮ Multi-agent path finding with mutex propagation ⋮ Efficient Large-Scale Multi-Drone Delivery using Transit Networks ⋮ Safe Multi-Agent Pathfinding with Time Uncertainty ⋮ Conflict-based search for optimal multi-agent pathfinding

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The increasing cost tree search for optimal multi-agent pathfinding
• Depth-first iterative-deepening: An optimal admissible tree search
• On multiple moving objects
• Conflict-based search for optimal multi-agent pathfinding
• Understanding planning tasks. Domain complexity and heuristic decomposition
• Asynchronous Distributed Motion Planning with Safety Guarantees under Second-Order Dynamics
• Generalized best-first search strategies and the optimality of A*
• Enhanced Partial Expansion A*
• Planning as heuristic search

This page was built for publication: Conflict-based search for optimal multi-agent pathfinding