Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-19T02:09:22.985Z Has data issue: false hasContentIssue false

A real-time trajectory modification algorithm

Published online by Cambridge University Press:  05 July 2001

Vadim Rogozin
Affiliation:
Dept. of Applied Mathematics and Computer Science, Weizmann Institute of Science, Rehovot 76100 (Israel). tamar@weizmann
Yael Edan
Affiliation:
Dept. of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer Sheva 841054 (Israel). [email protected]
Tamar Flash
Affiliation:
Dept. of Applied Mathematics and Computer Science, Weizmann Institute of Science, Rehovot 76100 (Israel). tamar@weizmann

Abstract

This paper presents a real-time algorithm for modifying the trajectory of a manipulator approaching a moving target. The algorithm is based on the superposition scheme; a model developed based on human motion behavior. The algorithm generates a smooth trajectory toward the new target by calculating the vectorial sum between the first trajectory (initial position and first target) and second trajectory (between first and second target location). The algorithm searches for the switch hme that will result in a minimum time trajectory. The idea of the algorithm is to define some domain where the optimal switching time can be found, reduce this domain as much as possible to decrease the number of the points that must be checked and try every remaining candidate in this domain to find numerically the best (optimal) switch time. The algorithm was implemented on an Adept-one robotic system taking into account velocity constraints. The actual velocity profile was found to be less smooth than specified by the mathematical model. When the switch occurs at the middle of the trajectory when the speed is close to its maximum, the change in the movement direction is performed more gently.

Type
Research Article
Copyright
© 2001 Cambridge University Press

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