Rearrangement planning of multiple movable objects by a mobile robot

Advanced Robotics

Volumn 23, Issue 1-2, 2009, Pages 1-18

  Ota, Jun ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

Manipulation planning; Motion planning; Rearrangement

Indexed keywords

HEURISTIC ALGORITHMS; MOBILE ROBOTS; MOTION PLANNING; NAVIGATION; ROBOTICS; ROBOTS;

CALCULATION COSTS; GLOBAL MOTIONS; HEURISTIC FUNCTIONS; INITIAL CONFIGURATIONS; INTERMEDIATE CONFIGURATIONS; LOCAL MOTIONS; MANIPULATION PLANNING; PLANNING ALGORITHMS; PLANNING METHODOLOGIES; PRECEDENCE GRAPHS; REARRANGEMENT; ROBOT HANDLINGS; SIMULATION RESULTS; TASK COMPLETION TIME;

PLANNING;

EID: 60049097411     PISSN: 01691864     EISSN: 15685535     Source Type: Journal    
DOI: 10.1163/156855308X392654     Document Type: Article

References (25)

1. R. Fikes and N. J. Nilsson, STRIPS: a new approach to application of theorem proving to problem solving, Artif. Intell. 2, 189-208 (1971).
2. S. Russel and P. Norvig, Artificial Intelligence: A Modern Approach. Prentice-Hall, Englewood Cliffs, NJ (1995).
3. L. S. Homem de Mello and A. C. Sanderson, Representation of mechanical assembly sequences, IEEE Trans. Robotics Automat. 7, 211-227 (1991).
4. L. S. Homem de Mello and A. C. Sanderson, Two criteria for the selection of assembly plans: maximizing the flexibility of sequencing the assembly tasks and minimizing the assembly time through parallel execution of assembly, IEEE Trans. Robotics Automat. 7, 626-633 (1991).
5. D. Halperin, A general framework for assembly planning: the motion space approach, Algorithmica 26, 577-601 (2000).
6. A. Junghanns and J. Schaeffer, Sokoban: enhancing general single-agent search methods using domain knowledge, Artif. Intell. 129, 219-251 (2001).
7. A. Junghanns and J. Schaeffer, Sokoban: improving the search with relevance cuts, J. Theor. Comput. Sci. 2452, 151-175 (2001).
8. F. Hüffner, Finding optimal solutions to atomix, Lecture Notes Artif. Intell. 2174, 229-243 (2003).
9. O. Ben-Shahar and E. Rivlin, Practical pushing planning for rearrangement tasks, IEEE Trans. Robotics Automat. 14, 549-565 (1998).
10. P. C. Chen and Y. K. Hwang, Practical path planning among movable obstacles, in: Proc. 1991 IEEE Int. Conf. on Robotics and Automation, Sacramento, CA, pp. 444-449 (1991).
11. B. Faltings and P. Pu, Applying means-ends analysis to spatial planning, in: Proc. IEEE/RSJ Int. Workshop on Intelligent Robots and Systems, Osaka, pp. 80-85 (1991).
12. M. Cherif and M. Vidal, Planning handling operations in changing industrial plants, in: Proc. 1998 IEEE Int. Conf. on Robotics and Automat., Leuven, Belgium, pp. 881-886 (1998).
13. M. Stilman and J. J. Kuffner, Navigation among movable obstacles: real-time reasoning in complex environments, Int. J. Human. Robotics 2, 479-504 (2005).
14. M. Stilman, K. Nishiwaki, S. Kagami and J. J. Kuffner, Planning and executing navigation among movable obstacles, Adv. Robotics 21, 1617-1634 (2007).
15. F. Gravot, S. Cambon and R. Alami, aSyMov: a planner that deals with intricate symbolic and geometric problems, Trends Adv. Robotics 15, 100-109 (2005).
16. J. Ota, Rearrangement planning of multiple movable objects by using realtime search methodology, in: Proc. IEEE Int. Conf. on Robotics and Automation, Washingoton, DC, pp. 947-953 (2002).
17. R.E. Korf, Real-time heuristic search, Artif. Intell. 42, 189-211 (1990).
18. T. Ishida, Realtime Search for Learning Autonomous Agents. Kluwer, Dordrecht (1997).
19. G. Wilfong, Motion planning in the presence of movable obstacles, in: Proc. ACM Symp. on Computational Geometry, Urbana-Champaign, IL, pp. 279-288 (1988).
20. E. Guéré and R. Alami, Let's reduce the gap between task planning and motion planning, in: Proc. Int. Conf. on Robotics and Automation, Seoul, pp. 15-20 (2001).
21. R. Alami, J. P. Laumond and T. Simeon, Two manipulation planning algorithms, in: Algorithmic Foundations of Robotics, K. Goldberg, D. Halperin, J.-C. Latombe and R. Watson (Eds), pp. 109-125. A. K. Peters, Wellesley, MA (1995).
22. J. Barraquand and J. C. Latombe, Robot motion planning: a distributed representation approach, Int. J. Robotics Res. 10, 628-649 (1991).
23. J. Lengyel, M. Reichert, B. R. Donald and D. P. Greenberg, Real-time robot motion planning using rasterizing computer graphics hardware, Comp. Graphics 24, 327-335 (1990).
24. M. Iri, K. Murota and S. Matsui, Linear-time approximation algorithms for finding the minimum-weight perfect matching on a plane, Inform. Process. Lett. 12, 206-209 (1981).
25. J. Ota, Rearrangement of multiple movable objects - integration of global and local planning methodology, in: Proc. IEEE Int. Conf. on Robotics and Automation, New Orleans, LA, pp. 1962-1967 (2004).