Hostname: page-component-7dd5485656-7jgsp Total loading time: 0 Render date: 2025-10-29T08:16:28.800Z Has data issue: false hasContentIssue false
  • English
  • Français

Minimum cost, fixed time trajectory planning in robot manipulators. A suboptimal solution

Published online by Cambridge University Press:  01 September 1997

Ignacy Duleba
Ignacy Duleba
Affiliation:
Institute of Engineering Cybernetics, Technical University of Wroclaw, Janiszewskiego 11/17, 50-372 Wroclaw, Poland
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper the minimum cost trajectory planning problem with fixed time in robot manipulators is considered. The task is solved by transforming the problem to a set of free right-end time optimal problems, leading to a suboptimal solution. Each problem of the optimal cost trajectory planning with a free time is effectively solved by the method of minimal neighbourhood. An algorithm for the task of suboptimal cost trajectory planning with fixed time is presented and applied to the model of a PUMA-like robot. Results of the paper seem to be of particular relevance to the optimization of multi-robot systems.

Keywords

Robot manipulatorTrajectory planningOptimizationMulti-robot systems

Information

Type
Research Article
Information
Robotica , Volume 15 , Issue 5 , September 1997 , pp. 555 - 562
Copyright
© 1997 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.)

Article purchase

Temporarily unavailable