Obstacle representation by Bump-surfaces for optimal motion-planning

Robotics and Autonomous Systems

Volumn 51, Issue 2-3, 2005, Pages 129-150

  Azariadis, Philip N ^a,b   Aspragathos, Nikos A ^c  

^a UNIVERSITY OF THE AEGEAN   (Greece)

^b ELKEDE Technology and Design Centre SA   (Greece)

^c UNIVERSITY OF PATRAS   (Greece)

Author keywords

Articulated robots; Conjugate gradient; Genetic algorithms; Manipulators; Mobile robots; Motion planning; Obstacles; Path planning

Indexed keywords

COLLISION AVOIDANCE; DEGREES OF FREEDOM (MECHANICS); GENETIC ALGORITHMS; GRAPH THEORY; MANIPULATORS; MATHEMATICAL MODELS; MOBILE ROBOTS; PROBLEM SOLVING;

ARTICULATED ROBOTS; BUMP-SURFACES; CONJUGATED GRADIENT; OBSTACLES;

MOTION PLANNING;

EID: 16644365470     PISSN: 09218890     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.robot.2004.11.001     Document Type: Article

References (46)

1. Y.K. Hwang, and N. Ahuja Gross motion planning-a survey ACM Comput. Surv. 24 3 1992 219 290
2. J.-C. Latombe Robot Motion Planning 1991 Kluwer Academic Publishers Boston
3. T. Lozano-Perez Spatial planning: a configuration space approach IEEE Trans. Comput. C-32 2 1983 108 120
4. B. Curto, V. Moreno, and F. Blanco A general method for C-space evaluation and its application to articulated robots IEEE Trans. Robot. Auto. RA-18 1 2002 24 33
5. R.A. Brooks Solving the find-path problem by good representation of free space IEEE Trans. Syst., Man, Cybern. SMC-13 2 March/April 1983 190 197
6. T. Asano, L. Guibas, J. Hershenberger, and H. Imai Visibility-polygon and euclidean shortest paths IEEE Int. Conf. Robot. Auto. 1985 155 164
7. S. Rajasekaran, and S. Ramaswami Optimal mesh algorithms for the voronoi diagram of line segments and motion planning in the plane J. Parall. Distrib. Comput. 26 1995 99 115
8. L. Kavraki, J.C. Latombe, R. Motwani, and P. Raghavan Randomized query processing in robot path planning Comput. Syst. Sci. 57 1998 50 60
9. S.S. Keerthi, C.J. Ong, E. Huang, and E.G. Gilbert Equidistance diagram-a new roadmap method for path planning Proceedings of the IEEE International Conference on Robotics and Automation 1999 682 687
10. L. Kavraki, M. Konzoulakis, and J.C. Latombe Analysis of probabilistic roadmaps for path planning Proceedings of the IEEE International Conference on Robotics and Automation 1996 3020 3025
11. M.H. Overmars Recent Developments in Motion Planning, ICCS 2002 2002 Springer-Verlag
12. S.K. Kambhampari, and L.S. Davis Multi-resolution path planning for mobile robots IEEE J. Robot. Auto. RA-2 3 1986 135 145
13. Jung K.K. Gupta Octree-based hierarchical distance maps for collision detection Proceedings of the IEEE International Conference on Robotics and Automation, vol. A22-28 1996 454 459
14. Z. Chen, R.J. Szezebra, and J.J. Uhran A Framed-quadtree approach for determinning euclidean shortest paths in a 2D environment IEEE Trans. Robot Auto. 13 5 1997 668 681
15. P. Nagabhushan, and M.M. Manohara Pai Cognition of free space for planning the shortest path: a framed free space approach Pattern Recognit. Lett. 22 2001 971 982
16. R.A. Brooks, and T. Lozano-Perez A subdivision algorithm in configuration space for findpath with rotation IEEE Trans. Syst., Man, Cybern. SMC-15 2 March/April 1985 225 233
17. J.A. Storer, and J.H. Reif Shortest paths in the plane with polygonal obstacles J. Asso. Comput. Mach. 41 5 1994 982 1012
18. A. Autere Hierarchical A* based path planning -a case study Knowledge-Based Systems 15 2002 53 66
19. O. Khatib Real-time obstacle avoidance for manipulators and mobile robots Int. J. Robot. Res. 5 1 1986 90 98
20. D. Keymeulen, and J. Decuyper Self-organizing system for the motion planning of mobile robots Proceedings of the IEEE International Conference on Robotics and Automation 1996 3369 3374
21. A.A. Kassim, and B.V. Kummar Path planners based on the wave expansion neural network Robot. Autonom. Syst. 26 1999 1 22
22. H. Chang A new technique to handle local minimum for imperfect potential field based motion planning Proceedings of the IEEE International Conference on Robotics and Automation 1996 108 112
23. C.-H. Tsai, J.-S. Lee, and J.-H. Chuang Path planning of 3D objects using a new workspace model IEEE Trans. Syst., Man, Cybern. Part-C 31 3 2001 405 410
24. Y. Saab, and M. VanPutte Shortest path planning on topographical maps IEEE Trans. Syst., Man, Cybern. SMC-29 1 1999 139 150
25. R. Murphy, K. Hughes, and E. Noll An explicit path planner to facilitate reactive control and terrain preferences Proceedings of the IEEE International Conference on Robotics and Automation 1996 2067 2072
26. S. Al-Hasan, and G. Vachtsevanos Intelligent route planning for fast autonomous vehicles operating in a large natural terrain Robot. Autonom. Syst. 40 2002 1 24
27. K. Gupta Motion planning for flexible shapes (systems with many degrees of freedom): a survey Visual Comput. 14 1998 288 302
28. A. Nearhou, and N. Aspragathos A Collision-detection Scheme Based on Convex-hulls Concept for Generating Kinematically Feasible Robot Trajectories. Advances in Robot Kinematics and Computational Geometry 1994 Kluwer Academic Publ pp. 477-484
29. S. Cameron A comparison of two fast algorithms for computing the distance between convex polyhedra IEEE Trans. Robot. Auto. 13 1997 915 920
30. M. Anthimopoulou, and A.N. Aspragathos Kinematic control of planar manipulators moving between obstacles Proceedings of the 2nd International Workshop on Advances in Robot Kinematics Linz September 1990 380 391
31. T. Liang, and J. Lin An Improved trajectory planner for redundant manipulators in constrained workspace Proceedings of the IEEE International Conference on Robotics and Automation 1999 3153 3158
32. N. Kubota, T. Fukuda, and K. Shimojima Trajectory planning of cellular manipulator system using virus-evolutionary genetic algorithm Robot. Autonom. Syst. 19 1996 85 94
33. A.C. Nearchou, and N.A. Aspragathos A genetic path planning algorithm for redundant articulated robots Robotica 15 1997 213 224
34. K. Gupta, and X. Zhu Practical global motion planning for many degrees of freedom: a novel approach within sequential framework J. Robot. Syst. 12 1995 105 118
35. A. Hourtash, and M. Tarokh Manipulator path planning by decomposition: algorithm and analysis IEEE Trans. Robot. Auto. RA-17 6 2002 842 856
36. L. Piegl, and W. Tiller The NURBS Book 1997 Springer-Verlag Berlin, Heidelberg
37. I. Zeid CAD/CAM Theory and practice 1991 McGraw-Hill
38. M.M. Lipschutz Differential Geometry 1969 McGraw-Hill USA
39. D.E. Goldberg Genetic Algorithms in Search, Optimization, and Machine Learning 1989 Addison Wesley Publishing Company
40. Z. Michalewicz Genetic Algorithms + Data Structures = Evolution Programs 1992 Springer-Verlag Publications
41. K. Hormann, and A. Agathos The point in polygon problem for arbitrary polygons Comput. Geomet. 20 2001 131 144
42. De Jong K.A., An analysis of the behavior of a class of genetic adaptive systems, Doctoral Dissertation, University of Michigan, Dissertation Abstract International, 1975. 36(10), 5140B, (University Microfilms No 76-9381).
43. J.J. Grefenstette Optimization of control parameters for genetic algorithms IEEE Trans. Syst., Man, Cybern. 16 1 1986 122 128
44. E.A Nix, and M.D. Vose Modeling genetic algorithms with Markov chains Ann. Math. Artif. Intell. 5 1992 77 88
45. H. Aytug, S. Bhattacharrya, and G.J. Koehler A Markov Chain analysis of genetic algorithms with power of 2 cardinality alphabets Eur. J. Operat. Res. 96 1 1997 195 201
46. D. Greenhalgh, and S. Marshall Convergence criteria for genetic algorithms SIAM J. Comput. 30 1 2000 269 282