Parallel RRT-based path planning for selective disassembly planning

International Journal of Advanced Manufacturing Technology

Volumn 36, Issue 11-12, 2008, Pages 1221-1233

  Aguinaga, Iker ^a   Borro, Diego ^a   Matey, Luis ^a  

^a CEIT   (Spain)

Author keywords

Disassembly path planning; Disassembly planning; Rapid growing random trees; Selective disassembly

Indexed keywords

ALGORITHMS; PROBABILITY; PROBLEM SOLVING; TREES (MATHEMATICS);

DISASSEMBLY PATH PLANNING; DISASSEMBLY PLANNING; RAPID-GROWING RANDOM TREES; SELECTIVE DISASSEMBLY;

MOTION PLANNING;

EID: 43449083231     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-007-0930-2     Document Type: Article

References (30)

1. Aguinaga I, Amundarain A, Mansa I, Borro D, Matey L (2005) Hardware-accelerated validation of extraction directions in an automatic selective disassembly planner. In: Proceedings of the Virtual Concept '05, Biarritz, France, 8-10 November, 2005
2. Ahuactzin JM, Talbi EG, Bessiere P, Mazer E (1992) Using genetic algorithms for robot motion planning. In: Proceedings of the 10th European Conference on Artificial Intelligence. Wiley, New York
3. Bruce J, Veloso M (2002) Real-time randomized path planning for robot navigation. In: Proceedings of IROS 2002, Switzerland, Oct 2002
4. Carpin S, Pagello E (2002) On parallel RRTs for multi-robot systems. In: 8th Conference of the Italian Association for Artificial Intelligence, pp 834-841
5. Dijkstra E (1959) A note on two problems in connection with graphs. Numer Math 1:269-271
6. Foskey M, Garber M, Lin MC, Manocha D (2002) A Voronoi-based hybrid motion planner. In: Manocha D (ed) SIGGRAPH'02 Tutorial Course number 31
7. Garg D, Kumar M (2002) Optimization techniques applied to multiple manipulators for path planning and torque minimization. Eng Appl Artif Intell 15:241-252
8. Gayle R, Lin MC, Manocha D (2005) Constraint-based motion planning of deformable robots. In: International Conference of Robotics and Automation, Barcelona, Spain, April 2005
9. Hart PE, Nilsson N, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 2:100-107
10. Hoff III K, Culver T, Keyser J, Lin MC, Manocha D (2002) Interactive motion planning using hardware-accelerated computation of generalized Voronoi diagrams. In: Manocha D (ed) Proceedings of the IEEE International Conference on Robotics and Automation 2000
11. Hsu D (2000) Randomized single-query motion planning in expansive spaces. PhD Thesis, Stanford University
12. Huang WH, Fajen BR, Fink JR, Warren WH (2006) Visual navigation and obstacle avoidance using a steering potential function. Robot Auton Syst 54:288-299
13. Hwang YK, Ahuja N (1992) Gross motion planning-a survey. ACM Comput Surv (CSUR) 24(3):219-291
14. Iñiguez P, Rosell J (2002) Efficient path planning using harmonic functions computed on a non-regular grid. In: Escrig Monferrer M, Toledo Lobo F (eds) Lecture notes in computer science. Lecture notes in artificial intelligence, LNAI, vol 2504. Springer, Berlin Heidelberg New York, pp 345-354
15. Kallman M, Aubel A, Abaci T, Thalmann D (2003) Planning collision-free reaching motions for interactive object manipulation and grasping. Eurgraphics 2003(3)
16. Kavraki LE, Latombe JC, Motwani R, Raghavan P (1995) Randomized query processing in robot motion planning. In: SIGACT Symposium on the Theory of Computing (STOC). Las Vegas, Nevada, pp 353-362
17. Kavraki LE, Svestka P, Latombe JC, Overmars MH (1996) Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans Robot Autom 12(4):566-580
18. Kuffner J, LaValle SM (2000) RRT-connect: an efficient approach to single-query path planning. In: Proceedings of the IEEE International Conference on Robotics and Automation, pp 995-1001
19. Latombe JC (1991) Robot motion planning. Kluwer Academic Publishers, Boston
20. LaValle S, Kuffner J (2001) Randomized kinodynamic planning. Int J Rob Res 20(5):378-400
21. Lozano-Pérez T, Wesley MA (1979) An algorithm for planning collision-free paths among polyhedral obstacles. Communications ACM 22(10):560-570
22. Overmars MH (2002) Recent developments in motion planning. In: Sloot P, Kenneth Tan C, Dongarra J, Hoekstra A (eds) Computational Science-ICCS 2002, Part III, Springer, Berlin Heidelberg New York, pp 3-13
23. Rejneri N (2000) Détermination et simulation des opérations d'assemblage lors de la conception de systèmes mécaniques. PhD Thesis, Institut National Polytechnique de Grenoble
24. Samet H (1982) Neighbor-finding techniques for image represented by quadtrees. Comput Graph Image Process 18:37-57
25. Siméon T, Laumond JP, Nissoux C (2000) Visibility-based probabilistic roadmaps for motion planning. J Adv Robot 14(6):477-494
26. Sundaram S, Remmler I, Amato NM (2001) Disassembly sequencing using a motion planning approach. In: IEEE International Conference on Robotics and Automation (ICRA), Seoul, Korea, 21-26 May 2001
27. Svestka P, Overmars MH (1998) Probabilistic path planning. In: Laumond JP (ed) Robot motion planning and control. Lecture notes in control and information sciences, vol 229, Springer, Berlin Heidelberg New York, pp 255-304
28. Vleugels J, Kok J, Overmars MH (1993) Motion planning using a colored Kohonen network. Tech rep, Universiteit Utrecht
29. Wilson RH (1992) On geometric assembly planning. PhD Thesis, Stanford University
30. Xiao J, Michalewicz Z, Zhang L, Trojanowski K (1997) Adaptive evolutionary planner/navigator for mobile robots. IEEE Trans Evol Comput 1(1):18-28