Summary
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Latombe J-C (1991) Robot motion planning. Kluwer, Boston
Branicky MS, LaValle S, Olson S, Yang L (2001) Quasi-randomized path planning. In: Proc. of the Int. Conf. on Robotics and Automation
Frazzoli E, Dahleh MA, and Feron E (2001) Real-time motion planning for agile autonomous vehicles. In: Proc. of the American Control Conference
Kelly A et al. (2004) Toward reliable off-road autonomous vehicle operating in challenging environments. In: Proc. of the Int. Symp. on Experimental Robotics
Laumond J-P, Sekhavat S and Lamiraux F (1998) Guidelines in nonholonomic motion planning. In: Laumond J-P (ed) Robot motion planning and control. Springer, New York
Pancanti S et al. (2004) Motion planning through symbols and lattices. In: Proc. of the Int. Conf. on Robotics and Automation
Scheuer A, Laugier Ch (1998) Planning sub-optimal and continuous-curvature paths for car-like robots. In: Proc. of the Int. Conf. on Robotics and Automation
Wang D, Feng Q (2001) Trajectory planning for a four-wheel-steering vehicle. In: Proc. of the Int. Conf. on Robotics and Automation
Hsu D, Kindel R, Latombe J-C and Rock S (2002) Randomized kinodynamic motion planning with moving obstacles. Int. J. of Robotics Research 21:233–255
Kelly A and Nagy B (2003) Reactive nonholonomic trajectory generation via parametric optimal control. Int. J. of Robotics Research 22:583–601
LaValle S, Branicky M and Lindemann S (2004) On the relationship between classical grid search and probabilistic roadmaps. Int. J. of Robotics Research 23:673–692
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pivtoraiko, M., Kelly, A. (2006). Constrained Motion Planning in Discrete State Spaces. In: Corke, P., Sukkariah, S. (eds) Field and Service Robotics. Springer Tracts in Advanced Robotics, vol 25. Springer, Berlin, Heidelberg . https://doi.org/10.1007/978-3-540-33453-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-33453-8_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33452-1
Online ISBN: 978-3-540-33453-8
eBook Packages: EngineeringEngineering (R0)