Most nonholonomic path planning algorithms in the presence of obstacles use a local planner, that is, a method returning feasible paths between pairs of configurations without taking obstacles into account. To ensure convergence of the global method, however, the local planner has to account for small-time controllability: the length of the path joining two configurations has to tend toward zero with the distance between these configurations. We present such a local method for a robot towing n trailers, based on differential flatness and significantly more efficienct than former methods.
No takes yet. Share an insight, caveat, or question.
Lamiraux et al. (2000) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: