Fully Persistent Spatial Data Structures for Efficient Queries in Path-Dependent Motion Planning Applications
Fully Persistent Spatial Data Structures for Efficient Queries in Path-Dependent Motion Planning Applications
Motion planning is a ubiquitous problem that is often a bottleneck in robotic applications. We demonstrate that motion planning problems such as minimum constraint removal, belief-space planning, and visibility-aware motion planning (VAMP) benefit from a path-dependent formulation, in which the state at a search node is represented implicitly by the …