1,661 research outputs found
Straight-Leg Walking Through Underconstrained Whole-Body Control
We present an approach for achieving a natural, efficient gait on bipedal
robots using straightened legs and toe-off. Our algorithm avoids complex height
planning by allowing a whole-body controller to determine the straightest
possible leg configuration at run-time. The controller solutions are biased
towards a straight leg configuration by projecting leg joint angle objectives
into the null-space of the other quadratic program motion objectives. To allow
the legs to remain straight throughout the gait, toe-off was utilized to
increase the kinematic reachability of the legs. The toe-off motion is achieved
through underconstraining the foot position, allowing it to emerge naturally.
We applied this approach of under-specifying the motion objectives to the Atlas
humanoid, allowing it to walk over a variety of terrain. We present both
experimental and simulation results and discuss performance limitations and
potential improvements.Comment: Submitted to 2018 IEEE International Conference on Robotics and
Automatio
A Reactive and Efficient Walking Pattern Generator for Robust Bipedal Locomotion
Available possibilities to prevent a biped robot from falling down in the
presence of severe disturbances are mainly Center of Pressure (CoP) modulation,
step location and timing adjustment, and angular momentum regulation. In this
paper, we aim at designing a walking pattern generator which employs an optimal
combination of these tools to generate robust gaits. In this approach, first,
the next step location and timing are decided consistent with the commanded
walking velocity and based on the Divergent Component of Motion (DCM)
measurement. This stage which is done by a very small-size Quadratic Program
(QP) uses the Linear Inverted Pendulum Model (LIPM) dynamics to adapt the
switching contact location and time. Then, consistent with the first stage, the
LIPM with flywheel dynamics is used to regenerate the DCM and angular momentum
trajectories at each control cycle. This is done by modulating the CoP and
Centroidal Momentum Pivot (CMP) to realize a desired DCM at the end of current
step. Simulation results show the merit of this reactive approach in generating
robust and dynamically consistent walking patterns
Walking Stabilization Using Step Timing and Location Adjustment on the Humanoid Robot, Atlas
While humans are highly capable of recovering from external disturbances and
uncertainties that result in large tracking errors, humanoid robots have yet to
reliably mimic this level of robustness. Essential to this is the ability to
combine traditional "ankle strategy" balancing with step timing and location
adjustment techniques. In doing so, the robot is able to step quickly to the
necessary location to continue walking. In this work, we present both a new
swing speed up algorithm to adjust the step timing, allowing the robot to set
the foot down more quickly to recover from errors in the direction of the
current capture point dynamics, and a new algorithm to adjust the desired
footstep, expanding the base of support to utilize the center of pressure
(CoP)-based ankle strategy for balance. We then utilize the desired centroidal
moment pivot (CMP) to calculate the momentum rate of change for our
inverse-dynamics based whole-body controller. We present simulation and
experimental results using this work, and discuss performance limitations and
potential improvements
Footstep and Motion Planning in Semi-unstructured Environments Using Randomized Possibility Graphs
Traversing environments with arbitrary obstacles poses significant challenges
for bipedal robots. In some cases, whole body motions may be necessary to
maneuver around an obstacle, but most existing footstep planners can only
select from a discrete set of predetermined footstep actions; they are unable
to utilize the continuum of whole body motion that is truly available to the
robot platform. Existing motion planners that can utilize whole body motion
tend to struggle with the complexity of large-scale problems. We introduce a
planning method, called the "Randomized Possibility Graph", which uses
high-level approximations of constraint manifolds to rapidly explore the
"possibility" of actions, thereby allowing lower-level motion planners to be
utilized more efficiently. We demonstrate simulations of the method working in
a variety of semi-unstructured environments. In this context,
"semi-unstructured" means the walkable terrain is flat and even, but there are
arbitrary 3D obstacles throughout the environment which may need to be stepped
over or maneuvered around using whole body motions.Comment: Accepted by IEEE International Conference on Robotics and Automation
201
Negotiating Large Obstacles with a Humanoid Robot via Multi-Contact Motion Planning
Incremental progress in humanoid robot locomotion over the years has achieved essential capabilities such as navigation over
at or uneven terrain, stepping over small obstacles and imbing stairls. However, the locomotion research has mostly been limited to using only bipedal gait and only foot contacts with the environment, using the upper body for balancing without considering additional external contacts. As a result, challenging locomotion tasks like climbing over large obstacles relative to the size of the robot have remained unsolved. In this paper, we address this class of open problems with an approach based on multi-contact motion planning, guided by physical human demonstrations. Our goal is to make humanoid locomotion
problem more tractable by taking advantage of objects in the surrounding environment instead of avoiding them. We propose a multi-contact motion planning algorithm for humanoid robot locomotion which exploits the multi-contacts at the upper and lower body limbs. We propose a contact stability measure, which simplies the contact search from demonstration and
contact transition motion generation for the multi-contact motion planning algorithm. The algorithm uses the whole-body motions generated via Quadratic Programming (QP) based solver methods. The multi-contact motion planning algorithm is applied for a challenging task of climbing over a relatively larger obstacle compared to the robot. We validate our
planning approach with simulations and experiments for climbing over a large wooden obstacle with COMAN, which is a complaint humanoid robot with 23 degrees of freedom (DOF). We also propose a generalization method, the \Policy-Contraction Learning Method" to extend the algorithm for generating new multi-contact plans for our multi-contact motion planner, that can adapt to changes in the environment. The method learns a general policy and the multi-contact behavior from the human demonstrations, for generating new multi-contact plans for the obstacle-negotiation
An Efficiently Solvable Quadratic Program for Stabilizing Dynamic Locomotion
We describe a whole-body dynamic walking controller implemented as a convex
quadratic program. The controller solves an optimal control problem using an
approximate value function derived from a simple walking model while respecting
the dynamic, input, and contact constraints of the full robot dynamics. By
exploiting sparsity and temporal structure in the optimization with a custom
active-set algorithm, we surpass the performance of the best available
off-the-shelf solvers and achieve 1kHz control rates for a 34-DOF humanoid. We
describe applications to balancing and walking tasks using the simulated Atlas
robot in the DARPA Virtual Robotics Challenge.Comment: 6 pages, published at ICRA 201
Real-Time Motion Planning of Legged Robots: A Model Predictive Control Approach
We introduce a real-time, constrained, nonlinear Model Predictive Control for
the motion planning of legged robots. The proposed approach uses a constrained
optimal control algorithm known as SLQ. We improve the efficiency of this
algorithm by introducing a multi-processing scheme for estimating value
function in its backward pass. This pass has been often calculated as a single
process. This parallel SLQ algorithm can optimize longer time horizons without
proportional increase in its computation time. Thus, our MPC algorithm can
generate optimized trajectories for the next few phases of the motion within
only a few milliseconds. This outperforms the state of the art by at least one
order of magnitude. The performance of the approach is validated on a quadruped
robot for generating dynamic gaits such as trotting.Comment: 8 page
- …