No CrossRef data available.
Article contents
Near Time-Optimal Collision-Free Motion Planning of Robotic Manipulators Using an Evolutionary Algorithm
Published online by Cambridge University Press: 09 March 2009
Extract
A technique for open-loop minimum time planning of time-histories of control torques for robotic manipulators subject to constraints on the control torques using evolutionary algorithm is presented here. Planning is carried out in joint space of the manipulator and the path is represented as a string of via-points connected by cubic spline polynomial functions. Repeated path modification is done by using the evolutionary algorithm to search for a time-optimal path. Time taken to traverse over a particular path is calculated by reducing the dynamic equations of motion over that path in terms of a path parameter and then calculating the time optimal-control over that path.
Keywords
Information
- Type
- Research Article
- Information
- Copyright
- Copyright © Cambridge University Press 1996
References
1.Bobrow, J.E., Dubowsky, S. and Gobson, J.S., “Time-Optimal Control of Robotic Manipulators Along Spacified Paths” Int. J. Robotics Research 4(3), 3–17 (1985).CrossRefGoogle Scholar
2.Butler, J. and Tomizuka, M., “A Suboptimal Reference Generation Technique for Robotic Manipulators Following Specified Paths” Trans, of ASME: J. of Dynamic Systems, Measurement and Control, 114, 524–527 (1992).Google Scholar
3.Shiller, Z. and Dubowsky, S., “Robot Path Planning with Obstacles, Actuator, Gripper and Payload Constraints” Int. J. Robotics Research 8(6), 3–18 (1989).CrossRefGoogle Scholar
4.Kahn, M.C. and Roth, B., “The Near-Minimum Time Control of Open Loop Articulated Kinematic Chains” Trans. of ASME: J. of Dynamic Systems, Measurements and Control 93 (3), 164–172 (1971).Google Scholar
5.Bessonet, G. and Lallemand, J.P., “Planning of Optimal Free Paths of Robotic Manipulators with Bounds on Dynamic Forces” IEEE International Conference on Robitics and Automation(Atlanta, CA,1993) pp. 270–275.Google Scholar
6.Geering, H.P., Guzzella, L., Hepner, S.A.R. and Onder, C.H., “Time-Optimal Motions of Robots in Assembly Tasks” IEEE Trans. Automatic Control AC-31 (6), 512–518 (1986).CrossRefGoogle Scholar
7.Shin, K.G. and McKay, N.D., “Minimum-Time Control of Robotic Manipulator with Generalized Path Constraints” IEEE Trans. Automatic Control AC-30 (6), 531–541 (1985).CrossRefGoogle Scholar
8.Pfeiffer, F. and Johanni, R., “A Concept for Manipulator Trajectory Planning” IEEE J. Robotics and Automation RA-3 (2), 115–123 (1987).CrossRefGoogle Scholar
9.Slotine, J.J.E. and Yang, H.S., “Improving the Efficiency of Time-Optimal Path Following Algorithms” IEEE Trans. Robotics and Automation 5(1), 118–124 (1992).CrossRefGoogle Scholar
10.Shiller, Z., “On Singular Time-Optimal Control Along Specified Paths” IEEE Trans. Robotics and Automation 10(4), 561–566 (1996).CrossRefGoogle Scholar
11.Shiller, Z. and Lu, H., “Computation of Path Constrained Time Optimal Motions with Dynamic Singularities” Trans. of ASME: J. of Dynamic Systems, Measurements and Control 114, 34–39 (1992).Google Scholar
12.Czarnecki, CA., “Collision-Free Motion Planning for Two Robots Operating in a Common Workspace” CONTROL'94 Warwick, UK (1996) pp. 1006–1011.Google Scholar
13.Shin, K. and Zheng, Q., “Minimum Time Collision-Free Trajectory Planning for Dual-Robot Systems” IEEE Trans. Robotics an Automation 8(3), 641–644 (1992).CrossRefGoogle Scholar
14.Koga, Y. and Latombe, J.C., “Experiments in Dual Arm Manipulation Planning” IEEE Int. Conf. Robotics and AutomationNice, France(1992) pp. 2238–2245.Google Scholar
15.Barraquand, J., Langiois, and Latombe, J.C., “Numerical Potential Field Function Techniques for Robot Path Planning” IEEE Trans. Systems, Man and Cybernetics 22(2), 224–241 (1992).CrossRefGoogle Scholar
16.Craig, J.J., “Cubic Polynomials for a Path with Via-points” Introduction to robotics: Mechanics and Control (Addison Wesley Publishing Company, 1989) pp. 232–234.Google Scholar
17.Taha, H.A., Operations Research: An Introduction (Macmillan Publishing Company, New York, 1982).Google Scholar
18.Rana, A.S. and Zalzala, A.M.S., “An Evolutionary Algorithm for the Collision Free Motion of Multi-Arm Robots” 1st IEE/IEEE Int. Conf. on Genetic Algorithms in Engineering Systems: Innovations and ApplicationsSheffield, UK (1995) pp. 123–130.Google Scholar
19.Michalewicz, Z., Genetic Algorithms + Data Structures = Evolutionary Programs (end Ed.) (Springer-Verlag, Berlin, 1996).CrossRefGoogle Scholar
20.Faux, I.D. and Pratt, M.J., Computational Geometry for Design and Manufacture (Ellis Horwood, Chichester, England, 1979).Google Scholar
21.Goldberg, D.E., Genetic Algorithm in Search, Optimization and Machine Learning (Addison-Wesley Publishing Company, 1989).Google Scholar
22.Quinlan, S. and Khatib, O., “Elastic Bands: Connecting Path Planning and Control” Proceedings of IEEE Int. Conf. Robotics and AutomationAtlanta, CA (1993) pp. 802–807.Google Scholar
23.Dakev, N.V., Chipperfield, A.J. ad Fleming, P.J., “A General Approach for Solving Optimal Control Problems Using Optimization Techniques” IEEE Int. Conf. Systems, Man and Cybernetics,Vancouver, Canada(1995) pp. 4503–4508.Google Scholar
24.Dissanayake, M.W.M.G., Goh, C.J. and Phan-Thein, N., “Time Optimal Trajectories for Robot Manipulators” Robotica 9, Part 2, 131–138 (1991).CrossRefGoogle Scholar
25.Wang, Q. and Zalzala, A.M.S., “Near-Minimum-Time Motion Control of Robotic Manipulators using Genetic Algorithms” (submitted to IEE Proceedings-Control Theory and Applications).Google Scholar
26.Sahar, G. and Hollerbach, J.M., “Planning of Minimum Time Trajectories for Robot Arms” Int. J. Robotics Research 5(3), 90–100 (1986).CrossRefGoogle Scholar
27.Rana, A.S. and Zalzala, A.M.S., “Collision Free Minimum-Time Motion Planning for Two Planar Robotic Manipulators” 1st IEEE National Multi-Topic ConferenceRawalpindi, Pakistan(1995) pp. 156–163.Google Scholar
- 14
- Cited by