Simplified Algorithms and Improved Bounds for Motion Planning
cs.CG
Submitted: 2026-03-17
Updated: 2026-10-28
Comments: 10 pages, 5 figures
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Ten Problems in Geobotics
- Exact solutions to the Weighted Region Problem
- Characterizing minimum-length coordinated motions for two discs
- Minimum-Length Coordinated Motions For Two Convex Centrally-Symmetric Robots
- Complexity of Planning
Related papers
- The Rhythm of the Tiles: Narrow and Low Temperature Computation and Simulation in Synchronous Tile Self-Assembly
- k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs
- Covering Points with Rectangular Boundaries
- Tiling 3D Space by (Translates of) a Single Polycube is Undecidable
- Quadratic Complexity of Voronoi Diagrams in R cubed for Lines in a Single Ruling of a Regulus
- Minimum central circles: chain order, seam obstructions, and exact finite certification