- English
- Français
Article contents
Geometry for robot path planning
Published online by Cambridge University Press: 01 November 2007
- Lyle Noakes*
- Affiliation:School of Mathematics and Statistics, University of Western Australia, Nedlands, WA 6009 Perth, Australia.
- Tomasz Popiel
- Affiliation:School of Mathematics and Statistics, University of Western Australia, Nedlands, WA 6009 Perth, Australia.
- *
- *Corresponding author. E-mail:lyle@maths.uwa.edu.au
Summary
There have been many interesting recent results in the area of geometrical methods for path planning in robotics. So it seems very timely to attempt a description of mathematical developments surrounding very elementary engineering tasks. Even with such limited scope, there is too much to cover in detail. Inevitably, our knowledge and personal preferences have a lot to do with what is emphasised, included, or left out.
Part I is introductory, elementary in tone, and important for understanding the need for geometrical methods in path planning. Part II describes the results on geometrical constructions that imitate well-known constructions from classical approximation theory. Part III reviews a class of methods where classicalcriteria are extended to curves in Riemannian manifolds, including several recent mathematical results that have not yet found their way into the literature.
- Type
- Article
- Information
- Copyright
- Copyright © Cambridge University Press 2007
Access options
Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)References
- 11
- Cited by