Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
SoCS
/
Paper
Multi-Agent Path Finding with Continuous Time and Geometric Agents Viewed through Satisfiability Modulo Theories (SMT).
Pavel Surynek
Venue
B
SoCS
Year
2019
Proceedings
SOCS
DBLP record
conf/socs/Surynek19 ↗
Browse the full
SoCS paper archive
.