Hostname: page-component-7b7567c8c-kwt9d Total loading time: 0 Render date: 2026-11-14T12:03:52.403Z Has data issue: false hasContentIssue false

Time-suboptimal quasi-continuous path generation for industrial robots*

Published online by Cambridge University Press:  09 March 2009

I. Troch
Affiliation:
University of Technology, Karlsplatz 13, A-1040 Wien (Austria)

Summary

The problem of constructing a smooth path with respect to time through N given points in configuration space is considered. Two variants of an algorithm suggested by Paul are presented and evaluated. It is shown that the algorithms suggested in this paper yield in general considerable improvements in two respects: Firstly, the deviation of the resulting path from the given points is reduced markedly and secondly, the overall time needed for the movement is reduced significantly and consequently, is closer to the true minimum-time. The price to be paid for these improvements is a moderate increase of computation time allowing still online use of the algorithm.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 1989

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.)

Article purchase

Temporarily unavailable