Footstep Planning for Humanoid Robots

Humanoid robot locomotion involves trajectories that are much harder to generate and control than the ones for other robots locomotion. Therefore, motion planning problems for humanoid robots are of particular interest. We consider the footstep planning problem for humanoid robots. In particular, we consider a special case of the reachability problem in a free unbounded environment, the reachability with arbitrary steps problem. We show NP-completeness of the problem.

[1]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[2]  Brian Scassellati,et al.  Motion-based robotic self-recognition , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

[3]  V. Popov.  Computational complexity of problems related to DNA sequencing by hybridization , 2005 .

[4]  Hod Lipson,et al.  Resilient Machines Through Continuous Self-Modeling , 2006, Science.

[5]  V. Y. Popov,et al.  Multiple genome rearrangement by swaps and by element duplications , 2007, Theor. Comput. Sci..

[6]  Satoshi Kagami,et al.  An adaptive action model for legged navigation planning , 2007, 2007 7th IEEE-RAS International Conference on Humanoid Robots.

[7]  Sven Koenig,et al.  K-swaps: cooperative negotiation for solving task-allocation problems , 2009, IJCAI 2009.

[8]  Sven Koenig,et al.  Algorithms and Complexity Results for Pursuit-Evasion Problems , 2009, IJCAI.

[9]  Vladimir Yu . Popov.  Sorting by Prefix Reversals , 2010 .

[10]  V. Popov,et al.  On the complexity of recognizing a set of vectors by a neuron , 2010 .

[11]  Sonal Jain,et al.  Multirobot Forest Coverage for Weighted and Unweighted Terrain , 2010, IEEE Transactions on Robotics.

[12]  E. Castelain,et al.  A Decomposition Approach to Solve a General Delivery Problem , 2010 .

[13]  Florent Lamiraux,et al.  Small-space controllability of a walking humanoid robot , 2011, 2011 11th IEEE-RAS International Conference on Humanoid Robots.

[14]  Nicolas Perrin,et al.  Footstep planning for humanoid robots: discrete and continuous approaches , 2011 .

[15]  Andrey S. Krylov,et al.  The problem of sensor placement for triangulation-based localisation , 2011, Int. J. Autom. Control..

[16]  Anna Gorbenko,et al.  The problem of placement of visual landmarks , 2011 .

[17]  Anna Gorbenko,et al.  Task-resource scheduling problem , 2012, International Journal of Automation and Computing.

[18]  Vladimir Yu. Popov,et al.  Programming for modular reconfigurable robots , 2012, Programming and Computer Software.

[19]  A. Gorbenko,et al.  The Longest Common Subsequence Problem , 2012 .

[20]  Anna Gorbenko,et al.  The Problem of Sensor Placement , 2012 .

[21]  Anna Gorbenko,et al.  Self-Learning Algorithm for Visual Recognition and Object Categorization for Autonomous Mobile Robots , 2012 .

[22]  Vladimir Yu. Popov,et al.  The set of parameterized k-covers problem , 2012, Theor. Comput. Sci..

[23]  Anna Gorbenko,et al.  The c-Fragment Longest Arc-Preserving Common Subsequence Problem , 2012 .

[24]  Andrey Sheka,et al.  Localization on Discrete Grid Graphs , 2012 .