Constrained Motion Planning in Discrete State Spaces

Mikhail Pivtoraiko and Alonzo Kelly
Field and Service Robotics, July, 2006, pp. 269-280.


Download
  • Adobe portable document format (pdf) (862Byte)
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

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.

Keywords
nonholonomic motion planning lattice control set

Notes
Number of pages: 12

Text Reference
Mikhail Pivtoraiko and Alonzo Kelly, "Constrained Motion Planning in Discrete State Spaces," Field and Service Robotics, July, 2006, pp. 269-280.

BibTeX Reference
@inproceedings{Pivtoraiko_2006_6104,
   author = "Mikhail Pivtoraiko and Alonzo Kelly",
   title = "Constrained Motion Planning in Discrete State Spaces",
   booktitle = "Field and Service Robotics",
   pages = "269-280",
   publisher = "Springer",
   address = "Berlin / Heidelberg",
   month = "July",
   year = "2006",
   volume = "25",
}