Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Arithmetic Over the Reals

View at publisher
Authors: Tomáš Kolárik, Stefan Ratschan, Pavel Surynek
Cited by: 0
References: 30

Fields of Study & Subjects

Robotic Path Planning Algorithms Constraint Satisfaction and Optimization Formal Methods in Verification

Publication details

Journal / source
SN Computer Science
Volume
7
Issue
2
Publication date
9 February 2026
Language
EN