Reducing the complexity of robot's scene for faster collision detection

Journal of Intelligent and Robotic Systems: Theory and Applications

Volumn 26, Issue 1, 1999, Pages 79-89

  Nearchou, A C ^a   Aspragathos, N A ^a   Sofotassios, D P ^a,b  

^a UNIVERSITY OF PATRAS   (Greece)

^b University of Patras and Computer Technology Institute   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COLLISION AVOIDANCE; HEURISTIC METHODS; INDUSTRIAL ROBOTS; MACHINE VIBRATIONS; MOTION PLANNING; ROBOTICS;

CARTESIAN CURVES; COLLISION-DETECTION PROCESS; HEURISTIC ALGORITHMS;

MANIPULATORS;

EID: 0032595779     PISSN: 09210296     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008190406456     Document Type: Article

References (20)

1. Aho, A., Hopcroft, J. and Ullman, J.: Data Structures and Algorithms, Addison-Wesley, Reading, MA, 1983.
2. Brooks, R. A.: Solving the find-path problem by good representation of free space, IEEE Trans. Systems Man Cybernet. 13(3) (1983), 190-197.
3. 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.
4. 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.
5. Fredman, M. and Tarjan, R.: Fibonacci heaps and their uses in improved network optimization algorithms, J. ACM 34(3) (1984), 538-544.
6. 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.
7. 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.
8. 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.
9. Hurteau, G. and Stewart, N. F.: Distance calculation for imminent collision indication in a robot system simulation, Robotica 6 (1988), 47-51.
10. Khatib, O.: Real-time obstacle avoidance for manipulators and mobile robots, Internat. J. Robot. Res. 5(1) (1986), 90-98.
11. Latombe, J.-C.: Robot Motion Planning, Kluwer Academic Publishers, Dordrecht, 1991.
12. Lozano Perez, T. and Wesley, M. A.: An algorithm for planning collision-free paths among polyhedral obstacles, Comm. ACM 22(10) (1979), 560-570.
13. Lozano Perez, T.: Spatial planning: A configuration space approach, IEEE Trans. Comput. 32(2) (1983), 108-120.
14. Mehlhorn, K.: Data Structures and Algorithms 1: Sorting and Searching, EATCS Monographs on Theoretical Computer Science, Springer, Berlin, 1984.
15. Nakamura, Y., Hanafusa, H. and Yoshikawa, T: Task-priority based redunndancy control of robot manipulators, Internat. J. Robot. Res. 6 (1987), 3-17.
16. Nearchou, A. C. and Aspragathos, N. A.: Collision-free continuous path control of manipulators using genetic algorithms, J. Systems Engrg. 6 (1996), 20-32.
17. 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.
18. Tarjan, R.: Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.
19. Yao, F.: Computational geometry, in: J. van Leeuwen (ed.), The Handbook of Theoretical Computer Science, Elsevier Science Publishers, 1990.
20. 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.