Least Action Sequence Determination in the Planning of Non-prehensile Manipulation with Multiple Mobile Robots

  • Changxiang Fan
  • Shouhei Shirafuji
  • Jun Ota
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 867)


To complete a non-prehensile manipulation task, using the lowest number of manipulation sequences with a well-determined number of robots is desirable to improve efficiency of the manipulation and to bring stability to it. Since many possible states exist in the manipulation, various manipulation sequences exist to finish the task. Furthermore, the number of robots should be determined according to the environment. In this work, a graph-based planning method was used to determine the lowest possible number of sequences in the non-prehensile manipulation of mobile robots with a determined number of robots for gravity closure. Based on all possible object-environment contacts, the required number of robots for gravity closure was determined to generate possible manipulation states in the contact configuration space. A state transition graph was created by representing the obtained states as nodes and then determining the least action sequences by searching for the shortest path in the graph.


Multiple mobile robots Non-prehensile manipulation Manipulation planning State transition graph 


  1. 1.
    Mason, M.T.: Mechanics of Robotic Manipulation. MIT press, Cambridge (2001)Google Scholar
  2. 2.
    Maeda, Y., Arai, T.: Planning of graspless manipulation by a multifingered robot hand. Adv. Robot. 19, 501–521 (2005)CrossRefGoogle Scholar
  3. 3.
    Kijimoto, H., Arai, T., Aiyama, Y., Yamamoto, T.: Performance analysis and planning in graspless manipulation. In: Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning, (ISATP 1999), pp. 238–243. IEEE (1999)Google Scholar
  4. 4.
    Lee, G., Lozano-Pérez, T., Kaelbling, L.P.: Hierarchical planning for multi-contact non-prehensile manipulation. In: 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 264–271. IEEE (2015)Google Scholar
  5. 5.
    LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006)CrossRefGoogle Scholar
  6. 6.
    Xiao, J., Ji, X.: Automatic generation of high-level contact state space. Int. J. Robot. Res. 20, 584–606 (2001)CrossRefGoogle Scholar
  7. 7.
    Ji, X., Xiao, J.: Planning motions compliant to complex contact states. Int. J. Robot. Res. 20, 446–465 (2001)CrossRefGoogle Scholar
  8. 8.
    Xiao, J., Zhang, L.: A general strategy to determine geometrically valid contact formations from possible contact primitives. In: IEEE International Conference on Robotics And Automation, vol. 1, pp. 2728–2728 (1993)Google Scholar
  9. 9.
    Maeda, Y., Aiyama, Y., Arai, T., Ozawa, T.: Analysis of object-stability and internal force in robotic contact tasks. In: Proceedings of the 1996 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 1996, vol. 2, pp. 751–756. IEEE (1996)Google Scholar
  10. 10.
    Aiyama, Y., Arai, T., Ota, J.: Dexterous assembly manipulation of a compact array of objects. CIRP Ann. 47, 13–16 (1998)CrossRefGoogle Scholar
  11. 11.
    Xiao, J.: Goal-contact relaxation graphs for contact-based fine motion planning. In: 1997 IEEE International Symposium on Assembly and Task Planning, ISATP 1997, pp. 25–30. IEEE (1997)Google Scholar
  12. 12.
    Shirafuji, S., Terada, Y., Ota, J.: Mechanism allowing a mobile robot to apply a large force to the environment. In: International Conference on Intelligent Autonomous Systems, pp. 795–808. Springer (2016)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.The University of TokyoKashiwa CityJapan

Personalised recommendations