A superlinear convergence feasible sequential quadratic programming algorithm for bipedal dynamic walking robot via discrete mechanics and optimal control

For periodic gait optimization problem of the bipedal walking robot, a class of global and feasible sequential quadratic programming algorithm (FSQPA) is proposed based on discrete mechanics and optimal control. The optimal controls and trajectories are solved by the modified FSQPA. The algorithm can rapidly converge to a stable gait cycle by selecting an appropriate initial gait; otherwise, the algorithm only needs one step correction that generates a stable gait cycle. Under appropriate conditions, we provide a rigorous proof of global convergence and well‐defined properties for the FSQPA. Numerical results show that the algorithm is feasible and effective. Meanwhile, it reveals the movement mechanism in the process of bipedal dynamic walking, which is the velocity oscillations. Furthermore, we overcome the oscillatory behavior via the FSQPA, which makes the bipedal robot walk efficiently and stably on even terrain. The main result is illustrated on a hybrid model of a compass‐like robot through simulations and is utilized to achieve bipedal locomotion via FSQPA. To demonstrate the effectiveness of the high‐dimensional bipedal robot systems, we will conduct numerical simulations on the model of RABBIT with nonlinear, hybrid, and underactuated dynamics. Numerical simulation results show that the FSQPA is feasible and effective