A non-time reference gait planning method is proposed. The usual reference variable, time, is substituted by a non-time variable in gait, so the whole gait-planning phase can be divided into two phases, (1) planning the space walking path: Taking the forward locomotion of upper-body as reference variable, considering the constraint of the environment, the walking path of a robot without collision with other objects is designed, thus the relating locomotion of the parts of the robot is obtained; (2) planning the trajectory of the non-time reference variable: according the constraint of ZMP stability, design the forward locomotion of upper-body. The gait-planning problem is changed to the optimization problem. The optimized gait with good stabilities is obtained by Genetic Algorithm (GA). This non time reference gait planning method has advantages in passing obstacles, climbing upstairs or downstairs and other similar situation in which the walking path is specified.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Non-time reference gait planning and optimization for a stable bipedal walking


    Contributors:


    Publication date :

    2008-06-01


    Size :

    2058617 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Bipedal dynamic walking robot gait with flywheel stabilization

    Noda, A. / Sorata, K. / Hirano, T. | British Library Online Contents | 1997


    Bipedal Walking

    P. L. Muench / J. Alexander / S. Hadley et al. | NTIS | 2008


    Experimental BIPedal Walking

    Azevedo, Christine / Andreff, Nicolas / Arias, Soraya et al. | Springer Verlag | 2003


    A Review of Computational Model for Bipedal Robot Walking Using Gait Analysis

    Kumar, Manoj / Gautam, Pratiksha / Semwal, Vijay Bhaskar | IEEE | 2020


    Gait Design of a Bipedal Walking Robot Based on the Center of Gravity

    Li, Fei / Zhang, Ning / Lv, Cheng et al. | IEEE | 2023