Introduces ST-GCS graphs and ECD for time-optimal single- and multi-robot motion planning via best-first graph search with continuous optimization and prioritized coordination.
arXiv preprint arXiv:2409.19543 , year=
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Framework encodes key-door precedence logic in a layered augmented graph of convex sets for simultaneous optimal sequence selection and continuous trajectory computation with STL specs.
Integrates CBBA task allocation with GCS trajectory optimization in time-extended space for multi-agent systems in dynamic cluttered environments.
citing papers explorer
-
Search-Based Spatiotemporal and Multi-Robot Motion Planning on Graphs of Space-Time Convex Sets
Introduces ST-GCS graphs and ECD for time-optimal single- and multi-robot motion planning via best-first graph search with continuous optimization and prioritized coordination.
-
Task Allocation and Motion Planning in Dynamic, Cluttered Environments via CBBA and Graphs of Convex Sets
Integrates CBBA task allocation with GCS trajectory optimization in time-extended space for multi-agent systems in dynamic cluttered environments.