An official website of the United States government
Legged robots with point or small feet are nearly impossible to control instantaneously but are controllable over the time scale of one or more steps, also known as step-to-step control. Previous approaches achieve step-to-step control using optimization by (1) using the exact model obtained by integrating the equations of motion, or (2) using a linear approximation of the step-to-step dynamics. The former provides a large region of stability at the expense of a high computational cost while the latter is computationally cheap but offers limited region of stability. Our method combines the advantages of both. First, we generate input/output data by simulating a single step. Second, the input/output data is curve fitted using a regression model to get a closed-form approximation of the step-to-step dynamics. We do this model identification offline. Next, we use the regression model for online optimal control. Here, using the spring-load inverted pendulum model of hopping, we show that both parametric (polynomial and neural network) and non-parametric (gaussian process regression) approximations can adequately model the step-to-step dynamics. We then show this approach can stabilize a wide range of initial conditions fast enough to enable real-time control. Our results suggest that closed-form approximation of the step-to-step dynamics provides a simple accurate model for fast optimal control of legged robots.
more »
« less
Motion Planning for Agile Legged Locomotion using Failure Margin Constraints
The complex dynamics of agile robotic legged locomotion requires motion planning to intelligently adjust footstep locations. Often, bipedal footstep and motion planning use mathematically simple models such as the linear inverted pendulum, instead of dynamically-rich models that do not have closed-form solutions. We propose a real-time optimization method to plan for dynamical models that do not have closed form solutions and experience irrecoverable failure. Our method uses a data-driven approximation of the step-to-step dynamics and of a failure margin function. This failure margin function is an oriented distance function in state-action space where it describes the signed distance to success or failure. The motion planning problem is formed as a nonlinear program with constraints that enforce the approximated forward dynamics and the validity of state-action pairs. For illustration, this method is applied to create a planner for an actuated spring-loaded inverted pendulum model. In an ablation study, the failure margin constraints decreased the number of invalid solutions by between 24 and 47 percentage points across different objectives and horizon lengths. While we demonstrate the method on a canonical model of locomotion, we also discuss how this can be applied to data-driven models and full-order robot models.
more »
« less
- Award ID(s):
- 1653220
- PAR ID:
- 10394237
- Date Published:
- Journal Name:
- 2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
- Page Range / eLocation ID:
- 10350 to 10355
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Locomotion on dynamic rigid surface (i.e., rigid surface accelerating in an inertial frame) presents complex challenges for controller design, which are essential to address for deploying humanoid robots in dynamic real-world environments such as moving trains, ships, and airplanes. This paper introduces a real-time, provably stabilizing control approach for humanoid walking on periodically swaying rigid surface. The first key contribution is an analytical extension of the classical angular momentum-based linear inverted pendulum model from static to swaying grounds whose motion period may be different than the robot’s gait period. This extension results in a time-varying, nonhomogeneous robot model, which is fundamentally different from the existing pendulum models. We synthesize a discrete footstep control law for the model and derive a new set of sufficient stability conditions that verify the controller’s stabilizing effect. Finally, experiments conducted on a Digit humanoid robot, both in simulations and on hardware, demonstrate the framework’s effectiveness in addressing bipedal locomotion on swaying ground, even under uncertain surface motions and unknown external pushes.more » « less
-
We present a framework to generate periodic trajectory references for a 3D under-actuated bipedal robot, using a linear inverted pendulum (LIP) based controller with adaptive neural regulation. We use the LIP template model to estimate the robot's center of mass (CoM) position and velocity at the end of the current step, and formulate a discrete controller that determines the next footstep location to achieve a desired walking profile. This controller is equipped on the frontal plane with a Neural-Network-based adaptive term that reduces the model mismatch between the template and physical robot that particularly affects the lateral motion. Then, the foot placement location computed for the LIP model is used to generate task space trajectories (CoM and swing foot trajectories) for the actual robot to realize stable walking. We use a fast, real-time QP-based inverse kinematics algorithm that produces joint references from the task space trajectories, which makes the formulation independent of the knowledge of the robot dynamics. Finally, we implemented and evaluated the proposed approach in simulation and hardware experiments with a Digit robot obtaining stable periodic locomotion for both cases.more » « less
-
In this paper, we examine the problem of push recovery for bipedal robot locomotion and present a reactive decision-making and robust planning framework for locomotion resilient to external perturbations. Rejecting perturbations is an essential capability of bipedal robots and has been widely studied in the locomotion literature. However, adversarial disturbances and aggressive turning can lead to negative lateral step width (i.e., crossed-leg scenarios) with unstable motions and self-collision risks. These motion planning problems are computationally difficult and have not been explored under a hierarchically integrated task and motion planning method. We explore a planning and decision-making framework that closely ties linear-temporal-logic-based reactive synthesis with trajectory optimization incorporating the robot’s full-body dynamics, kinematics, and leg collision avoidance constraints. Between the high-level discrete symbolic decision-making and the low-level continuous motion planning, behavior trees serve as a reactive interface to handle perturbations occurring at any time of the locomotion process. Our experimental results show the efficacy of our method in generating resilient recovery behaviors in response to diverse perturbations from any direction with bounded magnitudes.more » « less
-
Traditional geometric mechanics models used in locomotion analysis rely heavily on systems having symmetry in SE(2) (i.e., the dynamics and constraints are invariant with respect to a system’s position and orientation) to simplify motion planning. As a result, the symmetry assumption prevents locomotion analysis on non-flat surfaces because the system dynamics may vary as a function of position and orientation. In this paper, we develop geometric motion planning strategies for a mobile system moving on a position space whose manifold structure is a cylinder: constant non-zero curvature in one dimension and zero curvature in another. To handle this non-flat position space, we adapt conventional geometric mechanics tools - in particular the system connection and the constraint curvature function - to depend on the system orientation. In addition, we introduce a novel constraint projection method to a variational gait optimizer and demonstrate how to design gaits that allow the example system to move on the cylinder with optimal efficiency.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.1109/IROS47612.2022.9981903
