Multi-agent pathfinding with continuous time

DOI10.1016/J.ARTINT.2022.103662MaRDI QIDQ2124435zbMATH OpenOpenAlexFDO

Authors Anton Andreychuk, Konstantin Yakovlev, Pavel Surynek, Dor Atzmon, Roni Stern

Publication date 11 April 2022

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1901.05506

zbMATH Keywords

conflict-based searchheuristic searchmulti-agent pathfindingsafe-interval path planningSAT modulo theory

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites work

• Conflict-based search for optimal multi-agent pathfinding
• Fast and exact continuous collision detection with Bernstein sign classification
• scientific article; zbMATH DE number 177829 (Why is no real title available?)
• Improving Glucose for incremental SAT solving with assumptions: application to MUS extraction
• Multi-agent Path Finding Modulo Theory with Continuous Movements and the Sum of Costs Objective
• Planning as heuristic search
• Planning as satisfiability: parallel plans and algorithms for plan search
• Robust multi-agent path finding and executing
• Solving constraint satisfaction problems with SAT modulo theories
• Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
• Subdimensional expansion for multirobot path planning
• The increasing cost tree search for optimal multi-agent pathfinding
• Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems

Cited in

(9)

• Priority inheritance with backtracking for iterative multi-agent path finding
• Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity
• The increasing cost tree search for optimal multi-agent pathfinding
• Continuous optimisation problem and game theory for multi-agent pathfinding
• Railway scheduling using Boolean satisfiability modulo simulations
• Multi-agent Path Finding Modulo Theory with Continuous Movements and the Sum of Costs Objective
• Decomposition strategies and multi-shot ASP solving for job-shop scheduling
• Multi-agent pathfinding under team-connected communication constraint via adaptive path expansion and dynamic leading
• Homotopy-aware multi-agent path planning on plane

Describes a project that uses

Uses Software

• OMPL
• OBBTree
• Glucose
• Walksat

This page was built for publication: Multi-agent pathfinding with continuous time

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