Date of Award
Department or Program
Department of Computer Science
This paper proposes sampling techniques to approximate the configuration space for optimal motion planning. We sample valid configurations in the workspace and construct path subconvex cells in the free configuration space. The radius of each cell is calculated using lower bounds on the robot’s minimum time to collision. Using theorems about path convexity, the shortest paths found between any two points in the decomposed space are guaranteed to be safe. Experimental results are provided for a planar arm.
Kannan, Ajay, "Cell Representations of the Configuration Space for Planning Optimal Paths" (2015). Dartmouth College Undergraduate Theses. 97.