Data-Driven Methods to Build Robust Legged Robots

For robots to ever achieve signicant autonomy, they need to be able to mitigate performance loss due to uncertainty, typically from a novel environment or morphological variation of their bodies. Legged robots, with their complex dynamics, are particularly challenging to control with principled theory. Hybrid events, uncertainty, and high dimension are all confounding factors for direct analysis of models. On the other hand, direct data-driven methods have proven to be equally dicult to employ. The high dimension and mechanical complexity of legged robots have proven challenging for hardware-in-the-loop strategies to exploit without signicant eort by human operators. We advocate that we can exploit both perspectives by capitalizing on qualitative features of mathematical models applicable to legged robots, and use that knowledge to strongly inform data-driven methods. We show that the existence of these simple structures can greatly facilitate robust design of legged robots from a data-driven perspective. We begin by demonstrating that the factorial complexity of hybrid models can be elegantly resolved with computationally tractable algorithms, and establish that a novel form of distributed control is predicted. We then continue by demonstrating that a relaxed version of the famous templates and anchors hypothesis can be used to encode performance objectives in a highly redundant way, allowing robots that have suffered damage to autonomously compensate. We conclude with a deadbeat stabilization result that is quite general, and can be determined without equations of motion.PHDElectrical Engineering: SystemsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttps://deepblue.lib.umich.edu/bitstream/2027.42/155053/1/gcouncil_1.pd

A rigorous but gentle introduction for economists

This open access textbook is the first to provide Business and Economics Ph.D. students with a precise and intuitive introduction to the formal backgrounds of modern financial theory. It explains Brownian motion, random processes, measures, and Lebesgue integrals intuitively, but without sacrificing the necessary mathematical formalism, making them accessible for readers with little or no previous knowledge of the field. It also includes mathematical definitions and the hidden stories behind the terms discussing why the theories are presented in specific ways.

A bi-level model of dynamic traffic signal control with continuum approximation

This paper proposes a bi-level model for traffic network signal control, which is formulated as a dynamic Stackelberg game and solved as a mathematical program with equilibrium constraints (MPEC). The lower-level problem is a dynamic user equilibrium (DUE) with embedded dynamic network loading (DNL) sub-problem based on the LWR model (Lighthill and Whitham, 1955; Richards, 1956). The upper-level decision variables are (time-varying) signal green splits with the objective of minimizing network-wide travel cost. Unlike most existing literature which mainly use an on-and-off (binary) representation of the signal controls, we employ a continuum signal model recently proposed and analyzed in Han et al. (2014), which aims at describing and predicting the aggregate behavior that exists at signalized intersections without relying on distinct signal phases. Advantages of this continuum signal model include fewer integer variables, less restrictive constraints on the time steps, and higher decision resolution. It simplifies the modeling representation of large-scale urban traffic networks with the benefit of improved computational efficiency in simulation or optimization. We present, for the LWR-based DNL model that explicitly captures vehicle spillback, an in-depth study on the implementation of the continuum signal model, as its approximation accuracy depends on a number of factors and may deteriorate greatly under certain conditions. The proposed MPEC is solved on two test networks with three metaheuristic methods. Parallel computing is employed to significantly accelerate the solution procedure

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