Search

Many controllers for legged robotic systems leverage open- or closed-loop control at discrete hybrid events to enhance stability. These controllers appear in several well studied phenomena such as the Raibert stepping controller, paddle juggling and swing leg retraction. This work introduces hybrid event shaping (HES): a generalized method for analyzing and producing stable hybrid event controllers. HES utilizes the saltation matrix, which gives a closed-form equation for the effect that hybrid events have on stability. We also introduce shape parameters, which are higher order terms that can be tuned completely independently from the system dynamics to promote stability. Optimization methods are used to produce values of these parameters that optimize a stability measure. Hybrid event shaping captures previously developed control methods while also producing new optimally stable trajectories without the need for continuous-domain feedback., Comment: Presented at IEEE ICRA 2022

Trajectory optimization is a popular strategy for planning trajectories for robotic systems. However, many robotic tasks require changing contact conditions, which is difficult due to the hybrid nature of the dynamics. The optimal sequence and timing of these modes are typically not known ahead of time. In this work, we extend the Iterative Linear Quadratic Regulator (iLQR) method to a class of piecewise smooth hybrid dynamical systems by allowing for changing hybrid modes in the forward pass, using the saltation matrix to update the gradient information in the backwards pass, and using a reference extension to account for mode mismatch. We demonstrate these changes on a variety of hybrid systems and compare the different strategies for computing the gradients., Comment: To Appear in IEEE CDC 2021

This paper concerns the first-order approximation of the piecewise-differentiable flow generated by a class of nonsmooth vector fields. Specifically, we represent and compute the Bouligand (or B-)derivative of the piecewise-$C^r$ flow generated by an event-selected $C^r$ vector field. Our results are remarkably efficient: although there are factorially many "pieces" of the desired derivative, we provide an algorithm that evaluates its action on a given tangent vector using polynomial time and space, and verify the algorithm's correctness by deriving a representation for the B-derivative that requires "only" exponential time and space to construct. We apply our methods in two classes of illustrative examples: piecewise-constant vector fields and mechanical systems subject to unilateral constraints.

Many state estimation and control algorithms require knowledge of how probability distributions propagate through dynamical systems. However, despite hybrid dynamical systems becoming increasingly important in many fields, there has been little work on utilizing the knowledge of how probability distributions map through hybrid transitions. Here, we make use of a propagation law that employs the saltation matrix (a first-order update to the sensitivity equation) to create the Salted Kalman Filter (SKF), a natural extension of the Kalman Filter and Extended Kalman Filter to hybrid dynamical systems. Away from hybrid events, the SKF is a standard Kalman filter. When a hybrid event occurs, the saltation matrix plays an analogous role as that of the system dynamics, subsequently inducing a discrete modification to both the prediction and update steps. The SKF outperforms a naive variational update - the Jacobian of the reset map - by having a reduced mean squared error in state estimation, especially immediately after a hybrid transition event. Compared a hybrid particle filter, the particle filter outperforms the SKF in mean squared error only when a large number of particles are used, likely due to a more accurate accounting of the split distribution near a hybrid transition., Comment: Submitted to Automatica

If robots are ever to achieve autonomous motion comparable to that exhibited by animals, they must acquire the ability to quickly recover motor behaviors when damage, malfunction, or environmental conditions compromise their ability to move effectively. We present an approach which allowed our robots and simulated robots to recover high-degree of freedom motor behaviors within a few dozen attempts. Our approach employs a behavior specification expressing the desired behaviors in terms as rank ordered differential constraints. We show how factoring these constraints through an encoding template produces a recipe for generalizing a previously optimized behavior to new circumstances in a form amenable to rapid learning. We further illustrate that adequate constraints are generically easy to determine in data-driven contexts. As illustration, we demonstrate our recovery approach on a physical 7 DOF hexapod robot, as well as a simulation of a 6 DOF 2D kinematic mechanism. In both cases we recovered a behavior functionally indistinguishable from the previously optimized motion.