1991/01/01 by Zvi Shiller, Z. Shiller, S. Dubowsky +1 · 1 citation
Computer Science · Engineering · #Robot Manipulation and Learning #Robotic Mechanisms and Dynamics #Robotic Path Planning Algorithms
paper · doi:10.1109/70.105387
openalex publication_date 1991/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
A method for computing the time-optimal motions of robotic manipulators is presented that considers the nonlinear manipulator dynamics, actuator constraints, joint limits, and obstacles. The optimization problem is reduced to a search for the time-optimal path in the n-dimensional position space. A small set of near-optimal paths is first efficiently selected for a grid, using a branch and bound search and a series of lower bound estimates on the traveling time along a given path. These paths are further optimized with a local path optimization to yield the global optimal solution. Obstacles are considered by eliminating the collision points from the tessellated space and by adding a penalty function to the motion time in the local optimization. The computational efficiency of the method stems from the reduced dimensionality of the searched spaced and from combining the grid search with a local optimization. The method is demonstrated in several examples for two- and six-degree-of-freedom manipulators with obstacles.>