Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-23T19:32:31.436Z Has data issue: false hasContentIssue false
  • English
  • Français

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
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]

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.

Keywords

Minimal neighborhoodTrajectory planningPrescribed pathsRobots
Type
Articles
Information
Robotica , Volume 13 , Issue 3 , May 1995 , pp. 297 - 304
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.)

References

1.Shin, K. G. and McKay, N. D., “Minimum-Time Control of Robotic Manipulators with Geometric Path Constraints” IEEE Transactions, AC-30 No. 6, 531–541 (1985).Google Scholar
2.Kim, B. K. and Shin, K. G., “Minimum-Time Path Planning for Robot Arms and Their Dynamics” IEEE Transactions SMC 15, No. 2, 213–223 (1985).Google Scholar
3.Ozaki, H. and Mohri, A., “Synthesis of a minimum-time manipulator trajectories with path constraints using time scaling” Robitca 6, Part 1, 41–46 (1988).Google Scholar
4.Slotine, J. E. and Yang, H. S., “Improving the Efficiency of Time-Optimal Path-Following Algorithms” IEEE Trans. on Robotics and Automation RA-5(1), 118–124 (1989).CrossRefGoogle Scholar
5.Chen, Y. and Chien, S. Y. P. and Desrochers, A. A., “General structure of time-optimal control of robotic manipulators moving along prescribed paths” Int. J. Control 56(4), 767–782 (1992).CrossRefGoogle Scholar
6.Shin, K. G. and McKay, N. D., “A Dynamic Programming Approach to Trajectory Planning of Robotic Manipulators” IEEE Transactions AC 31, No. 6, 491–500 (1986).Google Scholar
7.Shin, K. G. and McKay, N. D., “Minimum cost trajectory planning for industrial robots” In: Advances in Robotic Control Systems (ed. by Leondes, M. C.) (Academic Press, New York, 1991) pp. 357–403.Google Scholar
8.Jacak, W., Dulȩba, I. and Rogaliński, P., “A graph-searching approach to trajectory planing of robotic manipulators” Robotica 10, Part 6, 431–537 (1992).CrossRefGoogle Scholar
9.Vukobratovic, M. and Kircansky, M., “A Method of Optimal Synthesis of Manipulator Robot Trajectories” Transactions ASME 104, 188–193 (1982).Google Scholar
10.Moiseev, N. N., Elements of Optimal Systems Theory (Moscow, Nauka, 1975) (in Russian).Google Scholar
11.Paul, R. P., Robot Manipulators: Mathematics, Programming and Control (MIT Press, Cambridge, MASS., 1981).Google Scholar
12.Gosiewski, A. et al. , “Dynamic peroperties of IRb-6 and IRb-60 ASEA robots” Automation Dept. Reports (Technical Univ. of Warsaw, 1989).Google Scholar
13.Dulȩba, I., “Algorithms for a cost optimal trajectory planning in robot manipulators. A discrete phase approach” Ph. D. Thesis (Rept. of the Technical Univ. of Wroclaw, 1992) (in Polish).Google Scholar