Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-18T15:13:37.589Z Has data issue: false hasContentIssue false

The method of minimal neighborhood: a new and most effective iterative method for minimum cost trajectory planning in robot manipulators

Published online by Cambridge University Press:  09 March 2009

Ignacy Duleba
Affiliation:
Institute of Engineering Cybernetics, Technical University of Wroclaw, Janiszewskiego 11/17, 50–372 Wroclaw, (Poland)

Summary

In this paper a method of minimal neighborhood for cost optimal trajectory planning along prescribed paths is introduced. The method exploits the phase-plane approach. In the phase-plane, in an iterative procedure, subareas of search are built, called neighborings, which surround the current-best trajectory. In each iteration, in order to find the next-best trajectory, the dynamic programming (pruned to the subarea) is used. The method of minimal neighborhood makes the neighborings as small as possible and therefore speeds up computations maximally. The tests carried out on a model of the IRb-6 ASEA robot have shown that the method of minimal neighborhood is much faster than dynamic programming applied to the whole phase-plane, while preserving the quality of the resulting trajectory.

Information

Type
Articles
Copyright
Copyright © Cambridge University Press 1995

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