Motion planning for flexible shapes (systems with many degrees of freedom): A survey

Visual Computer

Volumn 14, Issue 5-6, 1998, Pages 288-302

  Gupta, Kamal ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Animation flexible shapes; Degrees of freedom; Manipulation planning; Motion planning; Robotics

Indexed keywords

ANIMATION; DEGREES OF FREEDOM (MECHANICS); MOBILE ROBOTS; MOTION PLANNING;

FLEXIBLE SHAPES;

COMPUTER VISION;

EID: 0032320231     PISSN: 01782789     EISSN: None     Source Type: Journal    
DOI: 10.1007/s003710050141     Document Type: Article

References (54)

1. Ahuactzin JM (1994) Le fil d'Ariane, Un méthode de planfication générale. Application à la planification automatique des trajectoires (in French). PhD Thesis, Institut National Polytechniques de Grenoble, France
2. Ahuactzin JM, Gupta K (1995) On manipulation planning. Proceedings of the IEEE. International Symposium on Assembly and Task Planning, Philadelphia, pp 67-72
3. Ahuactzin JM, Gupta K, Mazer E (1998) Manipulation planning for redundant robots: a practical approach. Int J Robotics Res 17:731-747
4. Alami R, Laumond JP, Siméon T (1995) Two manipulation planning algorithms. In: Goldberg K, Halperin D, Latombe JC, Wilson R (eds) Algorithmic foundations of robotics. AK Peters, Massachussets, USA, pp 109-125
5. Alami R, Siméon T, Laumond JP (1990) A geometrical approach to planning manipulation tasks: the case of discrete placements and grasps. The 5th International Symposium on Robotics Research, Tokyo, MIT Press, Cambridge, USA, pp 453-463
6. Badler N, O'Rourke J, Tolzis H (1979) A spherical representation of a human body for visualizing movements. Proceedings of the IEEE 67:1297-1403
7. Barraquand J, Latombe JC (1991) Robot motion planning: a distributed representation approach. Int J Robotics Res 10:628-649
8. Bellman R (1957) Dynamic programming. Princeton University Press, Princeton, USA
9. Bessiere P, Ahuactzin J, Talbi E, Mazer E (1995) The Ariadne's clew algorithm: global planning with local methods. In: Goldberg K, Halperin D, Latombe JC, Wilson R (eds) Algorithmic foundation of robotics, AK Peters, Massachussets, USA, pp 39-47
10. Cameron S (1997) A comparison of two fast algorithms for computing the distance between convex polyhedra. IEEE Trans Robotics Automation 13:915-920
11. Canny J (1988) The complexity of robot motion planning. MIT Press, Cambridge, USA
12. Chert PC, Hwang YK (1992) Sandros: a motion planner with performance proportional to task difficulty. IEEE International Conference on Robotics and Automation. Nice, France, pp 2346-2353
13. Ching W, Badler N (1992) Fast motion planning for anthropomorphic figures with many degrees of freedom. IEEE Conference on Robotics and Automation, Nice, France, pp 2340-2345
14. Cohen J et al. (1995) I-collide: an interactive and exact collision detection system for large-scale environments. The 1995 Symposium on Interactive 3D Graphics, Monterrey, California, ACM SIGGRAPH, Massachussets, USA, pp 189-195
15. del Pobil AP, Serna MA (1995) Spatial representation and motion planning. Lecture Notes in Computer Science, Springer vol 1014, Berlin Heidelberg New York
16. Donald BR (1988) Motion planning with six degrees of freedom. Technical Report TR-791, Massachusetts Institute of Technology (MIT) Artificial Intelligence Lab, Cambridge, USA
17. Farin G (1988) Curves and surfaces for computer-aided geometric design. Academic Press, San Diego, Calif
18. Faverjon B (1984) Obstacle avoidance using an octree in the configuration space of a manipulator. IEEE Conference on Robotics and Automation, Atlanta, USA, pp 504-512
19. Faverjon B, Tournassoud P (1987) A local based approach for path planning of manipulators with a high number of degrees of freedom. IEEE Conference on Robotics and Automation, Raleigh, USA, pp 1152-1159
20. Gilbert EG, Johnson DW, Keerthi S (1988) A fast procedure for computing the distance between complex objects in three-dimensional space. IEEE Trans Robotics Automation 4:193-203
21. Gouzenes L (1984) Strategies for solving collision-free trajectories problems for mobile and manipulator robots. Int J Robotics Res 3:51-65
22. Greenspan M, Burtnyck N (1996) Obstacle count independent real-time collision avoidance. IEEE International Conference on Robotics and Automation, Minneapolis, USA, pp 1073-1078
23. Gupta K (1990) Fast collision avoidance for manipulator arms: a sequential search strategy. IEEE Trans Robotics Automation 6:522-532
24. Gupta K (1992) Motion planning for many degrees of freedom: backtracking with sequential search. IEEE Conference on Robotics and Automation, Nice, France, pp 2328-2333
25. Gupta K, Guo Z (1995) Motion planning for many degrees of freedom: sequential search with backtracking. IEEE Transact Robotics Automation 11:897-906
26. Gupta K, Pobil AP del (1998) Practical motion planning in robotics: current approaches and future directions. In Press, John Wiley and Sons, Chichester, England
27. Gupta K, Zhu X (1995) Practical global motion planning for many degrees of freedom: a novel approach within sequential framework. J Robotic Syst 12:105-118
28. Hirai K, Hirose M, Haikawa Y, Takenaka T (1998) The development of honda humanoid robot. IEEE International Conference on Robotics and Automation, Leuven, Belgium, pp 1321-1326
29. Holleman C, Kavraki L, Warren J (1998) Planning paths for a flexible surface patch. Proceedings of the IEEE International Conference on Robotics and Automation, Leuven, Belgium, pp 21-26
30. Morsch T, Schwanz F, Tolle H (1994) Motion planning for many degrees of freedom - random reflections at C-space obstacles. Proceedings of the IEEE International Conference on Robotics and Automation, San Diego, California, USA, pp 3318-3323
31. Hwang YK, Ahuja N (1992) Gross motion planning: a survey. ACM Computing Surveys 24:219-291
32. Jung D, Gupta K (1997) Octree-based hierarchical distance maps for collision detection. J Robotic Syst 14:789-806
33. Kass M, Witkin A, Terzopoulos D (1987) Snakes: active contour models. Im J Comput Vision 1:321-332
34. Kavraki LE, Lamiraux F, Holleman R (1998) Towards planning for elastic objects. In: Agarwal PK, Kavraki L, Mason M (eds) Robotics: the algorithmic perspective. AK Peters Massachussets, USA, In press
35. Kavraki L, Svestka P, Latombe JC, Overmars M (1996) Probabilistic roadmaps for fast path planning in high dimensional configuration spaces. IEEE Transact Robotics Automation 12:566-580
36. Khatib O (1986) Real-time obstacle avoidance for manipulators and mobile robots. Int J Robotics Res 5:90-98
37. Koditschek DE (1987) Robot planning and control vial potential functions. In: Khatib O, Craig JJ, Lozano-Perez T (eds) The robotics review 1. MIT Press, Cambridge, USA
38. Koga Y (1994) On computing multi-arm manipulation trajectories. PhD Thesis, Stanford University, Stanford, California
39. Koga Y, Latombe JC (1992) Experiments in dual-arm manipulation planning. Proceedings of the IEEE International Conference on Robotics and Automation, Nice, France, pp 2238-2245
40. Koga Y, Kondo K, Kuffner J, Latombe JC (1994) Planning motions with intentions, SIGGRAPH'94, Proceedings of New Orleans, USA, pp 395-408
41. Kondo K (1991) Motion planning with six degrees of freedom by multistrategic bidirectional heuristic free-space enumeration. IEEE Trans Robotics Automation 7:267-277
42. Latombe JC (1991) Robot motion planning. Kluwer Academic, Boston, USA
43. Lin MC, Canny IF (1991) Fast algorithm for incremental distance calculation. Proceedings of the 1991 IEEE International Conference on Robotics and Automation Sacramento, California, pp 1008-1014
44. Lozano-Pérez T (1987) A simple motion planning algorithm for general robot manipulators. IEEE Trans Robotics Automatron 3:224-238
45. Lozano-Pérez T, Wesley MA (1979) An algorithm for planning collision free-paths among polyhedral obstacles. Commun ACM 22:560-570
46. Lozano-Pérez T, Jones JL, Mazer E, O'Donnell PA (1991) HANDEY: a robot task planner. MIT Press, Cambridge, Mass
47. Lumelsky VJ, Skewis T (1992) Incorporating range sensing in the robot navigation function. IEEE Trans SMC, 20: 1058-1069
48. McLean AW, Cameron SA (1996) The virtual springs method: path planning and collision avoidance for redundant manipulators. Int J Robotics Res 15:300-319
49. Quinlan S (1979) Real-time modification of collision-free paths. PhD Thesis, Computer Science Department, Stanford University, Stanford, Calif
50. Reif JH (1979) Complexity of the mover's problem and generalizations. The 20th Annual IEEE Symposium on Foundations of Computer Science, pp 421-427
51. Reznik D, Lumelsky VJ (1991) Motion planning with uncertainty for highly redundant kinematic structures: Part 1. "Free snake" motion. Technical Report TR-RL91001, University of Wisconsin, Madison, Wis
52. Reznik D, Lumelsky VJ (1993) Sensor-based motion planning for highly redundant kinematic structures: Part 2. The case of a snake arm manipulator. Technical Report TRRL93002, University of Wisconsin, Madison, Wis
53. Schwartz JT, Sharir M (1983) On the 'piano movers' problem part 2. General techniques for computing topological properties of real algebraic manifolds. Advances Appl Math, 4:298-351
54. Tournassoud P, Lozano-Pérez T, Mazer E (1987) Regrasping. IEEE International Conference on Robotics and Automation Raleigh, USA, pp 1924-1928