4,181 research outputs found
Contact-Aided Invariant Extended Kalman Filtering for Legged Robot State Estimation
This paper derives a contact-aided inertial navigation observer for a 3D
bipedal robot using the theory of invariant observer design. Aided inertial
navigation is fundamentally a nonlinear observer design problem; thus, current
solutions are based on approximations of the system dynamics, such as an
Extended Kalman Filter (EKF), which uses a system's Jacobian linearization
along the current best estimate of its trajectory. On the basis of the theory
of invariant observer design by Barrau and Bonnabel, and in particular, the
Invariant EKF (InEKF), we show that the error dynamics of the point
contact-inertial system follows a log-linear autonomous differential equation;
hence, the observable state variables can be rendered convergent with a domain
of attraction that is independent of the system's trajectory. Due to the
log-linear form of the error dynamics, it is not necessary to perform a
nonlinear observability analysis to show that when using an Inertial
Measurement Unit (IMU) and contact sensors, the absolute position of the robot
and a rotation about the gravity vector (yaw) are unobservable. We further
augment the state of the developed InEKF with IMU biases, as the online
estimation of these parameters has a crucial impact on system performance. We
evaluate the convergence of the proposed system with the commonly used
quaternion-based EKF observer using a Monte-Carlo simulation. In addition, our
experimental evaluation using a Cassie-series bipedal robot shows that the
contact-aided InEKF provides better performance in comparison with the
quaternion-based EKF as a result of exploiting symmetries present in the system
dynamics.Comment: Published in the proceedings of Robotics: Science and Systems 201
Space-Time Sampling for Network Observability
Designing sparse sampling strategies is one of the important components in
having resilient estimation and control in networked systems as they make
network design problems more cost-effective due to their reduced sampling
requirements and less fragile to where and when samples are collected. It is
shown that under what conditions taking coarse samples from a network will
contain the same amount of information as a more finer set of samples. Our goal
is to estimate initial condition of linear time-invariant networks using a set
of noisy measurements. The observability condition is reformulated as the frame
condition, where one can easily trace location and time stamps of each sample.
We compare estimation quality of various sampling strategies using estimation
measures, which depend on spectrum of the corresponding frame operators. Using
properties of the minimal polynomial of the state matrix, deterministic and
randomized methods are suggested to construct observability frames. Intrinsic
tradeoffs assert that collecting samples from fewer subsystems dictates taking
more samples (in average) per subsystem. Three scalable algorithms are
developed to generate sparse space-time sampling strategies with explicit error
bounds.Comment: Submitted to IEEE TAC (Revised Version
- …