Difference between revisions of "Nonholonomic Motion Planning"
From MLSwiki
Jump to navigationJump to searchLine 1: | Line 1: | ||
{{chapter header|Nonholonomic Behavior|Nonholonomic Motion Planning|Future Directions}} | {{chapter header|Nonholonomic Behavior|Nonholonomic Motion Planning|Future Directions}} | ||
+ | |||
+ | This chapter provides a survey of some of the techniques which have | ||
+ | been used in planning paths for nonholonomic systems. | ||
+ | Conventional (holonomic) path planners implicitly assume that arbitrary motion in | ||
+ | the configuration space is allowed as long as obstacles are avoided. | ||
+ | If a system contains nonholonomic constraints, many of these path | ||
+ | planners cannot be directly applied since they generate paths which | ||
+ | violate the constraints. | ||
+ | For this reason, it is important to understand how to efficiently | ||
+ | compute paths for nonholonomic systems. | ||
+ | |||
+ | == Chapter Summary == | ||
+ | |||
+ | == Additional Information == |
Revision as of 02:56, 25 July 2009
Prev: Nonholonomic Behavior | Chapter 8 - Nonholonomic Motion Planning | Next: Future Directions |
This chapter provides a survey of some of the techniques which have been used in planning paths for nonholonomic systems. Conventional (holonomic) path planners implicitly assume that arbitrary motion in the configuration space is allowed as long as obstacles are avoided. If a system contains nonholonomic constraints, many of these path planners cannot be directly applied since they generate paths which violate the constraints. For this reason, it is important to understand how to efficiently compute paths for nonholonomic systems.