Constrained Motion Planning in Discrete State Spaces

Abstract

We propose a principled method to create a search space for constrained motion planning, which e ciently encodes only feasible motion plans. The space of possible paths is encoded implicitly in the connections between states, but only feasible and only local connections are allowed. Furthermore, we propose a systematic method to generate a near-minimal set of spatially distinct motion alternatives. This set of motion primitives preserves the connectivity of the representation while eliminating redundancy leading to a very e cient structure for motion planning at the chosen resolution.