Andrew S. Habib

Handling Non-Convex Constraints in MPC-Based Humanoid Gait Generation

In most MPC-based schemes used for humanoid gait generation, simple Quadratic Programming (QP) problems are considered for real-time implementation. Since these only allow for convex constraints, the generated gait may be conservative. In this paper we focus on the non-convex reachable region of the…