Abstract
In many real-life industrial applications such as welding and painting, the hand tip of a robot manipulator must follow a desired Cartesian curve while its body avoids collisions with obstacles in its environment. Collision detection is an absolutely essential task for any robotic manipulators in order to operate safely and effectively in cluttered environments. A significant factor that influences the complexity of the collision detection problem is the obstacles' density, i.e., the total number of obstacles in the robot's environment.
In this paper, a heuristic algorithm for approximating the collision detection problem into a simpler one is presented. The algorithm reduces the number of obstacles that must be examined during the robot's motion by applying efficient techniques from computational geometry. The algorithm runs in time O(max(n 2 log m, n m)) , and uses O(n 2 + m n) space; with n being the number of obstacles in the robot's workspace, and m the total number of obstacles' vertices. Both costs are worst-case bounds.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aho, A., Hopcroft, J. and Ullman, J.: Data Structures and Algorithms, Addison-Wesley, Reading, MA, 1983.
Brooks, R. A.: Solving the find-path problem by good representation of free space, IEEE Trans. Systems Man Cybernet. 13(3) (1983), 190–197.
Chin, F. and Wang, C.: Optimal algorithms for the intersection and the minimum distance problems between planar polygons, IEEE Trans. Comput. 32(12) (1983), 1203–1207.
Driscoll, J., Gabow, H., Shrairman, R. and Tarjan, R.: Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation, Comm. ACM 31(11) (1988), 1343–1354.
Fredman, M. and Tarjan, R.: Fibonacci heaps and their uses in improved network optimization algorithms, J. ACM 34(3) (1984), 538–544.
Gilbert, E. G. and Jonson, D.W.: Distance functions and their application to robot path planning in the presence of obstacles, IEEE J. Robot. Automat. 1 (1985), 21–30.
Hiller, M., Kecskemethy, A., Schmitz, T. and Schneider, M.: Modeling and simulation of mobile robots and large manipulators, in: 3rd Internat. Workshop on Advances in Robot Kinematics, Ferrara, Italy, September 7–9, 1992.
Hopcroft, J. E. and Krafft, D. B.: The challenge of robotics for computer science, in: J. T. Schwartz and C. K. Yap (eds), Advances in Robotics, Vol. 1: Algorithmic and Geometric Aspects of Robotics, Lawrence Erlbaum, Hillsdate, New Jersey, 1987, pp. 7–42.
Hurteau, G. and Stewart, N. F.: Distance calculation for imminent collision indication in a robot system simulation, Robotica 6 (1988), 47–51.
Khatib, O.: Real-time obstacle avoidance for manipulators and mobile robots, Internat. J. Robot. Res. 5(1) (1986), 90–98.
Latombe, J.-C.: Robot Motion Planning, Kluwer Academic Publishers, Dordrecht, 1991.
Lozano Perez, T. and Wesley, M. A.: An algorithm for planning collision-free paths among polyhedral obstacles, Comm. ACM 22(10) (1979), 560–570.
Lozano Perez, T.: Spatial planning: A configuration space approach, IEEE Trans. Comput. 32(2) (1983), 108–120.
Mehlhorn, K.: Data Structures and Algorithms 1: Sorting and Searching, EATCS Monographs on Theoretical Computer Science, Springer, Berlin, 1984.
Nakamura, Y., Hanafusa, H. and Yoshikawa, T.: Task-priority based redunndancy control of robot manipulators, Internat. J. Robot. Res. 6 (1987), 3–17.
Nearchou, A. C. and Aspragathos, N. A.: Collision-free continuous path control of manipulators using genetic algorithms, J. Systems Engrg. 6 (1996), 20–32.
Nearchou, A. C. and Aspragathos, N. A.: A collision-detection scheme based on convex-hulls concept for generating kinematically feasible robot trajectories, in: 4th Internat. Workshop on Advances in Robot Kinematics, Slovenia, July 1994.
Tarjan, R.: Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.
Yao, F.: Computational geometry, in: J. van Leeuwen (ed.), The Handbook of Theoretical Computer Science, Elsevier Science Publishers, 1990.
Yap, C. K.: Algorithmic motion planning, in: J. T. Schwartz and C. K. Yap (eds), Algorithmic and Geometric Aspects of Robotics, Lawrence Erlbaum Associates, Hillsdate, New Jersey, 1987, pp. 95–143.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Nearchou, A.C., Aspragathos, N.A. & Sofotassios, D.P. Reducing the Complexity of Robot's Scene for Faster Collision Detection. Journal of Intelligent and Robotic Systems 26, 79–89 (1999). https://doi.org/10.1023/A:1008190406456
Issue Date:
DOI: https://doi.org/10.1023/A:1008190406456