Frequency-Aware Model Predictive Control

Transferring solutions found by trajectory optimization to robotic hardware remains a challenging task. When the optimization fully exploits the provided model to perform dynamic tasks, the presence of unmodeled dynamics renders the motion infeasible on the real system. Model errors can be a result of model simplifications, but also naturally arise when deploying the robot in unstructured and nondeterministic environments. Predominantly, compliant contacts and actuator dynamics lead to bandwidth limitations. While classical control methods provide tools to synthesize controllers that are robust to a class of model errors, such a notion is missing in modern trajectory optimization, which is solved in the time domain. We propose frequency-shaped cost functions to achieve robust solutions in the context of optimal control for legged robots. Through simulation and hardware experiments we show that motion plans can be made compatible with bandwidth limits set by actuators and contact dynamics. The smoothness of the model predictive solutions can be continuously tuned without compromising the feasibility of the problem. Experiments with the quadrupedal robot ANYmal, which is driven by highly-compliant series elastic actuators, showed significantly improved tracking performance of the planned motion, torque, and force trajectories and enabled the machine to walk robustly on terrain with unmodeled compliance

Computational methods and software systems for dynamics and control of large space structures

Two key areas of crucial importance to the computer-based simulation of large space structures are discussed. The first area involves multibody dynamics (MBD) of flexible space structures, with applications directed to deployment, construction, and maneuvering. The second area deals with advanced software systems, with emphasis on parallel processing. The latest research thrust in the second area involves massively parallel computers

Motion Planning for the On-orbit Grasping of a Non-cooperative Target Satellite with Collision Avoidance

A method for grasping a tumbling noncooperative target is presented, which is based on nonlinear optimization and collision avoidance. Motion constraints on the robot joints as well as on the end-effector forces are considered. Cost functions of interest address the robustness of the planned solutions during the tracking phase as well as actuation energy. The method is applied in simulation to different operational scenarios

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 constraint-stabilized time-stepping approach for piecewise smooth multibody dynamics

Rigid multibody dynamics is an important area of mathematical modeling which attempts to predict the position and velocity of a system of rigid bodies. Many methods will use smooth bodies without friction. The task is made especially more difficult in the face of noninterpenetration constraints, joint constraints, and friction forces. The difficulty that arises when noninterpenetration constraints are enforced is directly related to the fact that the usual methods of computing the distance between bodies do not give any indication of the amount of penetration when two bodies interpenetrate. Because we wish to calculate vectors that are normal to contact, and because it is necessary to determine the amount of penetration, when it exists, the classical computation of the depth of penetration when applied to convex polyhedral bodies is inefficient.We hereby describe a new method of determining when two convex polyhedra intersect and of evaluating a measure of the amount of penetration, when it exists. Our method is much more efficient than the classic computation of the penetration depth since it can be shown that its complexity grows only linearly with the size of the problem. We use our method to construct a signed distance function and implement it for use with a method for achieving geometrical constraint stabilization for a linear-complementarity-based time-stepping scheme for rigid multibody dynamics with joints, contact, and friction which, before now, was not equipped to handle polyhedral bodies. During our analysis, we describe how to compute normal vectors at contact, despite the cases when the classic derivative fails to exist.We put this analysis into a time-stepping procedure that uses a convex relaxation of a mixed linear complementarity problem with a resulting fixed point iteration that is guaranteed to converge if the friction is not too large, the time step is not too large, and the initial solution is feasible. Finally, we construct an algorithm that achieves constraint stabilization with quadratic convergence.The numerical results proved to be quite satisfactory, implying that the constraint stabilization holds, and that quadratic convergence exists