Abstract
SUMMARYThe 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
