Skip to main content
SpringerLink
Log in

Planning Robot Navigation among Movable Obstacles (NAMO) through a Recursive Approach

  • Published:
Journal of Intelligent & Robotic Systems Aims and scope Submit manuscript

Abstract

This paper addresses the NP-complete problem of Navigation Among Movable Obstacles (NAMO) in which a robot is required to find a collision-free path toward a goal through manipulating and transferring some movable objects on its way. The robot’s main goal is to optimize a performance criterion such as runtime, length of transit or transfer paths, number of manipulated obstacles, total number of displacements of all objects, etc. We have designed a recursive algorithm capable of solving various NAMO problems, ranging from linear monotone to nonlinear non-monotone, and with convex or concave polygonal obstacles. Through the adopted approach, the original problem is decomposed into recursively-solved subproblems, in each of which only one movable object is manipulated. In each call of the algorithm, first a Visibility Graph determines a path from the robot’s current configuration to an intermediate goal configuration, and then a tentative final configuration for the last object intercepting the path is calculated using the Penetration Depth concept. It is assumed that the objects can be pulled or pushed, but not rotated, in a continuous space, and under such assumptions the method is complete and locally optimal for convex objects, with a worst-case time complexity of O(n 43m) in which m is the number of movable objects and n is the number of all vertices on them. Several computational experiments showed that compared to the existing methods in the literature, the proposed recursive method achieved equal or smaller number of transferred obstacles or the total number of displacements of all objects in majority of the test problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ben-Shahar, O., Rivlin, E.: Practical Pushing Planning for Rearrangement Tasks. IEEE Trans. Robot. Autom. 14, 549–565 (1998)

    Article  Google Scholar 

  2. Berg, J.V.D., Stilman, M., Kuffner, J., Lin, M., Manocha, D.: Path Planning among Movable Obstacles: a Probabilistically Complete Approach, vol. VIII. Workshop on Algorithmic Foundation of Robotics (WAFR) (2008)

  3. Chen, P.C., Hwang, Y.K.: Practical Path Planning among movable obstacles. Proceedings of the IEEE Intemational Conference on Robotics and Automation (1991)

  4. Demaine, E.D., Demaine, M.L., O’rourke‡, J.: Pushpush and push1 are hard in 2d. In: Proceedings of the 12th Canadian Conference on Computational Geometry, 11-219 (2000)

  5. Dobkin, D., Hershberger, J., Kirkpatrick, D., Suri, S.: Computing the intersection-depth of polyhedra. Algorithmica 9, 518–533 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ghandi, S., Masehian, E.: Review and taxonomies of assembly and disassembly path planning problems and approaches. Comput. Aided Des. 58-86, 67–68 (2015)

    Google Scholar 

  7. Goldwasser, M.H., Motwani, R.: Complexity Measures for Assembly Sequences. Int. J. Comput. Geom. Appl. 9, 371–417 (1999)

    Article  MathSciNet  Google Scholar 

  8. Guibas, L., Ramshaw, L., Stolfi, J.A.: Kinematic framework for computational geometry. Proc, 24th foundations of computer Science (1983)

  9. Havur, G., Ozbilgin, G., Erdem, E., Patoglu, V.: Geometric rearrangement of multiple movable objects on cluttered surfaces: A hybrid reasoning approach. Robotics and Automation (ICRA), vol. 7. 2014 IEEE International Conference on, May 31 2014-June (2014)

  10. Junghanus, A., Schaeffer, J.: Sokoban: A challenging single-agent search problem, 27–36 (1997). IJCAI Workshop on Using Games as an Experimental Testbed for AI Reasearch

  11. Kakiuchi, Y., Ueda, R., Kobayashi, K., Okada, K., Inaba, M.: Working with Movable Obstacles Using On-line Environment Perception Reconstruction Using Active Sensing and Color Range Sensor. International Conference on Intelligent Robots and Systems (IROS) (2010)

  12. Kuffner, J.J., Lavalle, S.M.: RRT-Connect: An Efficient Approach to Single-Query Path Planning. IEEE International Conference on Robotics and Automation, 995–1001 (2000)

  13. Latombe, J.C.: Movable obstacles Robot motion planning. Kluwer Academic Publisher, New York (1991)

    Book  Google Scholar 

  14. Levihn, M.: Navigation Among Movable Obstacles In unknown Environments. Master of Science in the School of Computer Science, Georgia Institute of Technology (2011)

  15. Lindzey, L., Knepper, R., Choset, H., Srinivasa, S.: The Feasible Transition Graph: Encoding Topology and Manipulation Constraints for Multirobot Push-Planning. In: Algorithmic Foundations of Robotics XI. Springer International Publishing (2015)

  16. Mueggler, E., Faessler, M., Fontana, F., Scaramuzza, D.: Aerial-guided navigation of a ground robot among movable obstacles. Safety, Security, and Rescue Robotics (SSRR), vol. 2014. IEEE International Symposium on, 27-30 Oct (2014)

  17. Nieuwenhuisen, D., Vanderstappen, A.F., Overmars, H.M.: An Effective Framework for Path Planning amidst Movable Obstacles. Algorithmic Foundation of Robotics VII, 87–102 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  18. Nillsson, N.J.: A Mobile Automaton: An Application of Artificial Intelligence Techniques. In: Proceedings of the 1st International Joint Conference on Artificial Intelligence, pp 509–520 (1969)

  19. Okada, K., Haneda, A., Nakai, H., Inaba, M., Inoue, H.: Environment manipulation planner for humanoid robots using task graph that generates action sequence Proceedings of 2004 1EEE lRS.J International Conference on Intelligent Robots and Systems, 1174-1179 (2004)

  20. Ota, J.: Rearrangement of Multiple Movable Objects, Integration of Global and Local Planning Methodology. In. IEEE Int. Conf. Robotics and Automation (ICRA) 2, 1961–1967 (2004)

    Google Scholar 

  21. Rodríguez, C., Montaño, A., Suárez, R.: Planning manipulation movements of a dual-arm system considering obstacle removing. Robot. Auton. Syst. 62, 1816–1826 (2014)

    Article  Google Scholar 

  22. Stilman, M.: Navigation among Movable Obstacles. Carnegie Mellon University, Doctoral Dissertation (2007)

    Google Scholar 

  23. Stilman, M., Kuffner, J.J.: Navigation among Movable Obstacles: Real-Time Reasoning In Complex Environments. Int. J. Humanoid Rob. 2, 479–504 (2005)

    Article  Google Scholar 

  24. Stilman, M., Kuffner, J.J.: Planning among Movable Obstacles with Artificial Constraints. Int. J. Robot. Res. 27, 1295–1307 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  25. Wilfong, G.: Motion Planning In The Presence Of Movable Obstacles. Ann. Math. Artif. Intell. 3, 131–150 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  26. Wu, H.N., Levihn, M., Mike, S.: Navigation Among Movable Obstacles in Unknown Environments. Int. Conf. on Intelligent Robots and Systems (IROS) 2010, 1433–1438 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tarbiat Modares University, Jalalé-Alé-Ahmad Highway, Tehran, 14115-143, Iran

    Shokraneh K. Moghaddam & Ellips Masehian

Authors
  1. Shokraneh K. Moghaddam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ellips Masehian
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ellips Masehian.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Moghaddam, S.K., Masehian, E. Planning Robot Navigation among Movable Obstacles (NAMO) through a Recursive Approach. J Intell Robot Syst 83, 603–634 (2016). https://doi.org/10.1007/s10846-016-0344-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10846-016-0344-1

Keywords

Search

Navigation