Abstract
Obstacle avoidance and subsequently collision-free path planning is a potential field of robotics research, specially in the perspective of today's industrial scenario. In this paper, the celebrated method, namely, Visibility Map is being used to generate feasible collision-free near-optimal safe path(s) for a three- dimensional congested robot workspace using heuristic algorithms. The final path is obtainable in terms of joint configurations, by considering the Configuration Space of the task-space. The developed algorithms have been verified by considering typical 2D workspaces at the onset, cluttered with different obstacles (convex and/or concave) with regular geometries and later on, with the real spatial manifold. The outcome of these algorithms has been found instrumental in programming an industrial robot in order to perform a series of task in the shop-floor. A case-study reveals the effectiveness of the heuristics involved in the developed algorithms, by virtue of the successful application in an unstructured industrial environment to carry out robotized material handling operation in real-time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Acar, Ercan U., Chosel, H., Zhang, Y. and Schervish, M.: Path planning for robotic demining: Robust sensor-based coverage of unstructured environments and probabilistic methods, Int. J. Rob. Res. 22(7-8) (July–August 2003), 441–466.
Bajaj, C. and Kim, M. S.: Generation of configuration space obstacles: Moving algebraic surfaces, Int. J. Rob. Res. 9(1) (February 1990), 92–112.
Branicky, M. S. and Newman, W. S.: Rapid computation of configuration space obstacles, in: Proceedings of the IEEE International Conference on Robotics and Automation, 1990, pp. 304–310.
Brooks, R. A.: Solving the find-path problem by good representation of free space, IEEE Trans. Syst. Man Cybern., SMC-13(3) (1983), 190–197.
Brost, R. C.: Computing metric and topological properties of configuration space obstacles, in: Proceedings: IEEE International Conference on Robotics and Automation, 1989, pp. 170–176.
Campbell, D. and Higgins, J.: Minimal visibility graphs, Inf. Process. Lett. 37(1) (10th. January 1991), 49–53.
Curto, B. and Moreno, V.: Mathematical formalism for the fast evaluation of the configuration space, in: Proceedings of the IEEE International Conference on Robotics and Automation, Cira, Monterey, CA, U.S.A., July 1997, pp 194–199.
De Pedro, M. T. and Rosa, R. G.: Robot path planning in the configuration space with automatic obstacle transformation, Cybern. Syst. 23(4) (1992), 367–378.
Erdmann, Michael: On a representation of friction in configuration space, Int. J. Rob. Res. 13(3) (June 1994), 240–271.
Fu, L.-C. and Liu, D.-Y.: An efficient algorithm for finding a collision-free path among polyhedral obstacles, J. Robot. Syst. 7(1) (1990), 129–137.
Gilbert, E. G. and Johnson, D. W.: Distance functions and their application to robot path planning in the presence of obstacles, IEEE Trans. Robot. Autom. RA-1(1) (March 1985), 21–30.
Hasegawa, T. and Terasaki, H.: Collision avoidance: Divide-and-conquer approach by space characterization and intermediate goals, IEEE Trans. Syst. Man Cybern. SMC-18(3) (May–June 1988), 337–347.
Hwang, Y. K. and Ahuja, N.: Gross motion planning - A survey, ACM Comput. Surv. 24(3) (1992), 219–291.
Jun, S. and Shin, K. G.: A probabilistic approach to collision-free robot path planning, in: Proceedings of the IEEE International Conference on Robotics and Automation, 1988, pp. 220–225.
Keerthi, S. S. and Selvaraj, J.: A fast method of collision avoidance for an articulated two link planar robot using distance functions, J. Ins. Electron. Telecommun. Eng. 35(4) (1989), 207–217.
Khouri, J. and Stelson, K. A.: Efficient algorithm for shortest path in 3-D with polyhedral obstacles, Trans. ASME - J. Dyn. Syst. Meas. Control 8(3) (September 1989) 433–436.
Kohler, M. and Spreng, M.: Fast computation of the c-space of convex 2D algebraic objects, Int. J. Rob. Res. 14(6) (December 1995), 590–608.
Lozano-Perez', T.: Spatial planning: A configuration space approach, IEEE Trans. Comput. C-32(2) (1983), 108–120.
Lozano-Perez', T. A simple motion planning algorithm for general robot manipulators, IEEE Trans. Robot. Autom. RA-3(3) (June 1987), 207–223.
Lumelsky, V. and Sun, K.: A study of the obstacle avoidance problem based on the deformation retract technique, in: Proceedings of the 29th. IEEE Conference on Decision and Control, 1990a, pp. 1099–1104.
Lumelsky, V. and Sun, K.: A unified methodology for motion planning with uncertainty for 2-D and 3-D two-link robot arm manipulators, Int. J. of Rob. Res. 9(5) (October 1990b), 89–104.
Ralli, E. and Hirzinger, G.: Global and resolution complete path planner for up to 6 dof robot manipulators, in: Proceedings of the IEEE International Conference on Robotics and Automation, Minneapolis, MN, U.S.A., April 1996, pp. 3295–3302.
Red, R. E. and Truong-Cao, H. V.: Configuration maps for robot path planning in two dimensions, Trans. ASME - J. Dyn. Syst. Meas. Control 107 (December 1985), 292–298.
Red, W. E. et al.: Robot path planning in three dimensions using the direct subspace, Trans. ASME - J. Dyn. Syst. Meas. Control 119 (September 1987), 238–244.
Roy, D.: Modeling and development of a sensor-integrated industrial robotic system for handling steel bearing races in an unstructured environment, in: Proceedings of the 17th All India Manufacturing Technology, Design and Research Conference, Warangal, India, January 1997, pp. 229–235.
Roy, D.: On the algorithmic path planning of industrial robots in a cluttered spatial manifold: A case study using visibility map paradigms, in: Proceedings of the International Conference on Knowledge Based Computer Systems (“KBCS-2000”), Mumbai, India, December 18–19, 2000, pp. 529–541.
Roy. D.: Development of a sensor-augmented industrial robotic system for handling steel bearing races in an unstructured environment, Ind. Rob. Int. J. 32(1) (February 2005), 103–111.
Sacks, E.: Practical sliced configuration spaces for curved planar pairs, Int. J. Rob. Res. 18(1) (January 1999), 59–63.
Sacks, E. and Bajaj, C.: Sliced configuration spaces for curved planar bodies, Int. J. Rob. Res. 17(6) (June 1998), 639–651.
Sachs, S., La Valle, S. M. and Rajko, S.: Visibility-based pursuit - Evasion in an unknown planar environment, Int. J. Rob. Res. 23(1) (January 2004), 3–26.
Schwartz, J. T. and Sharir, M.: A survey of motion planning and related geometric algorithms, Artif. Intelligence 37 (1988), 157–169.
Slotine, J. J. E. and Yang, H. S.: Improving the efficiency of time-optimal path following algorithm, IEEE Trans. Robot. Autom. RA-5(1) (1989), 118–124.
Verwer, B. J. H.: A multi-resolution workspace, multi-resolution configuration space approach to solve the path planning problem, in: Proceedings of the IEEE International Conference on Robotics and Automation, 1990, pp. 2107–2112.
Welzl, E.: Constructing the visibility graph for n-line segments in O (n2) time, Inf. Process. Lett. 20 (Sept. 1985), 167–171.
Wise, K. D. and Bowyer, A.: A survey of global configuration-space mapping techniques for a single robot in a static environment, Int. J. Rob. Res. 19(8) (August 2000), 762–779.
Yu, Y. and Gupta, K.: C-space entropy: A measure for view planning and exploration for general robot - Sensor systems in unknown environment, Int. J. Rob. Res. 23(12) (December 2004), 1197–1223.
Zelinsky, A.: Using path transforms to guide the search for findpath in 2D, Int. J. Rob. Res. 13(4) (August 1994), 315–325.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Roy, D. Study on the Configuration Space Based Algorithmic Path Planning of Industrial Robots in an Unstructured Congested Three-Dimensional Space: An Approach Using Visibility Map. J Intell Robot Syst 43, 111–145 (2005). https://doi.org/10.1007/s10846-005-9011-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10846-005-9011-7