Constrained Motion Planning in Discrete State Spaces

Mihail Pivtoraiko and Alonzo Kelly. Constrained Motion Planning in Discrete State Spaces. In Field and Service Robotics, pp. 269–280, 2005.

Download

[779.0kB pdf] 

Abstract

We propose a principled method to create a search space for constrained motion planning, which efficiently 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 efficient structure for motion planning at the chosen resolution.

BibTeX

@INPROCEEDINGS{pivtoraiko_kelly_fsr05,
  author = {Mihail Pivtoraiko and Alonzo Kelly},
  title = {Constrained Motion Planning in Discrete State Spaces},
  booktitle = {Field and Service Robotics},
  year = {2005},
  pages = {269-280},
  abstract = {We propose a principled method to create a search space
                  for constrained motion planning, which efficiently
                  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
                  efficient structure for motion planning at the
                  chosen resolution.},
  bib2html_pubtype = {Refereed Conference Papers},
  bib2html_rescat = {Kinodynamic Planning}
}