2,596 research outputs found
Dynamically Stable 3D Quadrupedal Walking with Multi-Domain Hybrid System Models and Virtual Constraint Controllers
Hybrid systems theory has become a powerful approach for designing feedback
controllers that achieve dynamically stable bipedal locomotion, both formally
and in practice. This paper presents an analytical framework 1) to address
multi-domain hybrid models of quadruped robots with high degrees of freedom,
and 2) to systematically design nonlinear controllers that asymptotically
stabilize periodic orbits of these sophisticated models. A family of
parameterized virtual constraint controllers is proposed for continuous-time
domains of quadruped locomotion to regulate holonomic and nonholonomic outputs.
The properties of the Poincare return map for the full-order and closed-loop
hybrid system are studied to investigate the asymptotic stabilization problem
of dynamic gaits. An iterative optimization algorithm involving linear and
bilinear matrix inequalities is then employed to choose stabilizing virtual
constraint parameters. The paper numerically evaluates the analytical results
on a simulation model of an advanced 3D quadruped robot, called GR Vision 60,
with 36 state variables and 12 control inputs. An optimal amble gait of the
robot is designed utilizing the FROST toolkit. The power of the analytical
framework is finally illustrated through designing a set of stabilizing virtual
constraint controllers with 180 controller parameters.Comment: American Control Conference 201
A Statistical Learning Theory Approach for Uncertain Linear and Bilinear Matrix Inequalities
In this paper, we consider the problem of minimizing a linear functional
subject to uncertain linear and bilinear matrix inequalities, which depend in a
possibly nonlinear way on a vector of uncertain parameters. Motivated by recent
results in statistical learning theory, we show that probabilistic guaranteed
solutions can be obtained by means of randomized algorithms. In particular, we
show that the Vapnik-Chervonenkis dimension (VC-dimension) of the two problems
is finite, and we compute upper bounds on it. In turn, these bounds allow us to
derive explicitly the sample complexity of these problems. Using these bounds,
in the second part of the paper, we derive a sequential scheme, based on a
sequence of optimization and validation steps. The algorithm is on the same
lines of recent schemes proposed for similar problems, but improves both in
terms of complexity and generality. The effectiveness of this approach is shown
using a linear model of a robot manipulator subject to uncertain parameters.Comment: 19 pages, 2 figures, Accepted for Publication in Automatic
- …