12,181 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
Robust Adaptive Control Barrier Functions: An Adaptive & Data-Driven Approach to Safety (Extended Version)
A new framework is developed for control of constrained nonlinear systems
with structured parametric uncertainties. Forward invariance of a safe set is
achieved through online parameter adaptation and data-driven model estimation.
The new adaptive data-driven safety paradigm is merged with a recent adaptive
control algorithm for systems nominally contracting in closed-loop. This
unification is more general than other safety controllers as closed-loop
contraction does not require the system be invertible or in a particular form.
Additionally, the approach is less expensive than nonlinear model predictive
control as it does not require a full desired trajectory, but rather only a
desired terminal state. The approach is illustrated on the pitch dynamics of an
aircraft with uncertain nonlinear aerodynamics.Comment: Added aCBF non-Lipschitz example and discussion on approach
implementatio
Tensor Computation: A New Framework for High-Dimensional Problems in EDA
Many critical EDA problems suffer from the curse of dimensionality, i.e. the
very fast-scaling computational burden produced by large number of parameters
and/or unknown variables. This phenomenon may be caused by multiple spatial or
temporal factors (e.g. 3-D field solvers discretizations and multi-rate circuit
simulation), nonlinearity of devices and circuits, large number of design or
optimization parameters (e.g. full-chip routing/placement and circuit sizing),
or extensive process variations (e.g. variability/reliability analysis and
design for manufacturability). The computational challenges generated by such
high dimensional problems are generally hard to handle efficiently with
traditional EDA core algorithms that are based on matrix and vector
computation. This paper presents "tensor computation" as an alternative general
framework for the development of efficient EDA algorithms and tools. A tensor
is a high-dimensional generalization of a matrix and a vector, and is a natural
choice for both storing and solving efficiently high-dimensional EDA problems.
This paper gives a basic tutorial on tensors, demonstrates some recent examples
of EDA applications (e.g., nonlinear circuit modeling and high-dimensional
uncertainty quantification), and suggests further open EDA problems where the
use of tensor computation could be of advantage.Comment: 14 figures. Accepted by IEEE Trans. CAD of Integrated Circuits and
System
Contracting Nonlinear Observers: Convex Optimization and Learning from Data
A new approach to design of nonlinear observers (state estimators) is
proposed. The main idea is to (i) construct a convex set of dynamical systems
which are contracting observers for a particular system, and (ii) optimize over
this set for one which minimizes a bound on state-estimation error on a
simulated noisy data set. We construct convex sets of continuous-time and
discrete-time observers, as well as contracting sampled-data observers for
continuous-time systems. Convex bounds for learning are constructed using
Lagrangian relaxation. The utility of the proposed methods are verified using
numerical simulation.Comment: conference submissio
Hierarchical Decomposition of Nonlinear Dynamics and Control for System Identification and Policy Distillation
The control of nonlinear dynamical systems remains a major challenge for
autonomous agents. Current trends in reinforcement learning (RL) focus on
complex representations of dynamics and policies, which have yielded impressive
results in solving a variety of hard control tasks. However, this new
sophistication and extremely over-parameterized models have come with the cost
of an overall reduction in our ability to interpret the resulting policies. In
this paper, we take inspiration from the control community and apply the
principles of hybrid switching systems in order to break down complex dynamics
into simpler components. We exploit the rich representational power of
probabilistic graphical models and derive an expectation-maximization (EM)
algorithm for learning a sequence model to capture the temporal structure of
the data and automatically decompose nonlinear dynamics into stochastic
switching linear dynamical systems. Moreover, we show how this framework of
switching models enables extracting hierarchies of Markovian and
auto-regressive locally linear controllers from nonlinear experts in an
imitation learning scenario.Comment: 2nd Annual Conference on Learning for Dynamics and Contro
Guaranteed passive parameterized macromodeling by using Sylvester state-space realizations
A novel state-space realization for parameterized macromodeling is proposed in this paper. A judicious choice of the state-space realization is required in order to account for the assumed smoothness of the state-space matrices with respect to the design parameters. This technique is used in combination with suitable interpolation schemes to interpolate a set of state-space matrices, and hence the poles and residues indirectly, in order to build accurate parameterized macromodels. The key points of the novel state-space realizations are the choice of a proper pivot matrix and a well-conditioned solution of a Sylvester equation. Stability and passivity are guaranteed by construction over the design space of interest. Pertinent numerical examples validate the proposed Sylvester realization for parameterized macromodeling
Prediction error identification of linear dynamic networks with rank-reduced noise
Dynamic networks are interconnected dynamic systems with measured node
signals and dynamic modules reflecting the links between the nodes. We address
the problem of \red{identifying a dynamic network with known topology, on the
basis of measured signals}, for the situation of additive process noise on the
node signals that is spatially correlated and that is allowed to have a
spectral density that is singular. A prediction error approach is followed in
which all node signals in the network are jointly predicted. The resulting
joint-direct identification method, generalizes the classical direct method for
closed-loop identification to handle situations of mutually correlated noise on
inputs and outputs. When applied to general dynamic networks with rank-reduced
noise, it appears that the natural identification criterion becomes a weighted
LS criterion that is subject to a constraint. This constrained criterion is
shown to lead to maximum likelihood estimates of the dynamic network and
therefore to minimum variance properties, reaching the Cramer-Rao lower bound
in the case of Gaussian noise.Comment: 17 pages, 5 figures, revision submitted for publication in
Automatica, 4 April 201
- …