Multi-agent pathfinding with continuous time

DOI10.1016/j.artint.2022.103662OpenAlexW4205985266MaRDI QIDQ2124435

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

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

heuristic searchconflict-based searchmulti-agent pathfindingsafe-interval path planningSAT modulo theory

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Related Items (2)

Continuous optimisation problem and game theory for multi-agent pathfinding ⋮ Railway scheduling using Boolean satisfiability modulo simulations

Uses Software

• Walksat
• Glucose
• OMPL
• OBBTree

Cites Work

• Unnamed Item
• The increasing cost tree search for optimal multi-agent pathfinding
• Solving constraint satisfaction problems with SAT modulo theories
• Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
• Subdimensional expansion for multirobot path planning
• Conflict-based search for optimal multi-agent pathfinding
• Planning as satisfiability: parallel plans and algorithms for plan search
• Solving SAT and SAT Modulo Theories
• Fast and exact continuous collision detection with Bernstein sign classification
• Robust Multi-Agent Path Finding and Executing
• Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction
• Planning as heuristic search

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