Path Planning in Complex Environments for Industrial Robots with Additional Degrees of Freedom
In this paper a path planning among obstacles is presented as applied to a robot of PUMA 560 type with mobile base. From two given configurations — the initial and goal ones — a configuration space is calculated. The robot configurations are expressed in terms of fully Cartesian co-ordinates and are obtained by solving non-linear optimisation problems between adjacent configurations, a variety of constrains is considered in order to take into account different real operation problems. The path is selected from a weighted graph associated to the map of feasible robot configurations. A search algorithm has been used to minimise an objective function in order to obtain a sequence of robot configurations between the initial and goal ones.
KeywordsPath Planning Configuration Space Obstacle Avoidance Industrial Robot Significant Point
Unable to display preview. Download preview PDF.
- Faverjon, B. (1984). Obstacle Avoidance Using an Octree in the Configuration Space of a Manipulator. Proceedings of the IEEE International Conference on Robotics and Automation. Atlanta, 504–512.Google Scholar
- Joseph, D.A., and Plantiga, W.H. (1985). On the Complexity of Reachability and Motion Planning Questions. Proceedings of the First ACM Symposium on Computational Geometry. Baltimore, 62–66.Google Scholar
- Tournassoud, P. (1988). Géometrie et intelligence artificielle pour les robots. Paris: Ed. Hermes.Google Scholar
- Zhu, X. Y Gupta, K. (1993). On local minima and random search in robot motion planning. Available as Technical Report, Simon Fraser University, Burnaby, Columbia Britannica, Canada.Google Scholar