Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-09T14:49:00.026Z Has data issue: false hasContentIssue false

Algorithms of trajectory planning with constrained deviation from a given end-effector path

Published online by Cambridge University Press:  15 November 2004

Ignacy Dulȩba
Affiliation:
Institute of Engineering Cybernetics, Wrocław University of Technology, Janiszewski St. 11/17, 50-372 Wroclaw (Poland) E-mail: iwd@ict.pwr.wroc.pl kdiwona@ict.pwr.wroc.pl
Iwona Karcz–Dulȩba
Affiliation:
Institute of Engineering Cybernetics, Wrocław University of Technology, Janiszewski St. 11/17, 50-372 Wroclaw (Poland) E-mail: iwd@ict.pwr.wroc.pl kdiwona@ict.pwr.wroc.pl
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper two well known and two new methods, and corresponding algorithms, of trajectory planning with a constrained end-effector path tracking error are presented and compared. They are: an exact path following method, the Taylor's algorithm of following a straight line with prescribed accuracy, a local optimization method, and a method of local trajectory shortening. It appears that the last two methods provide path following with a prescribed accuracy while keeping a planned trajectory as short as possible. Presented algorithms can extend robot programming languages with a tool of trajectory planning.

Information

Type
Research Article
Copyright
© 2004 Cambridge University Press