Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T06:07:28.551Z Has data issue: false hasContentIssue false

A numerical approach for time-optimal path-planning of kinematically redundant manipulators*

Published online by Cambridge University Press:  09 March 2009

Chia-Ju Wu
Affiliation:
Department of Electrical Engineering, National Yunlin Institute of Technology, Touliu, Yunlin 640(Taiwan, R.O.C.)

Summary

In this paper, a numerical approach is proposed to solve the time-optimal path-planning (TOPP) problem of kinematically redundant manipulators between two end-points. The first step is to transform the TOPP problem into a nonlinear programming problem by an iterative procedure. Then an approach to find the initial feasible solutions of the problem is proposed. Since initial feasible solutions can be found easily, the optimization process of the nonlinear programming problem can be started from different points to find the global minimum. A planar three-link robotic manipulator is used to illustrate the validity of the proposed approach.

Information

Type
Article
Copyright
Copyright © Cambridge University Press 1994

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