397 research outputs found

    Nonlinear Model Predictive Control for Motion Generation of Humanoids

    Get PDF
    Das Ziel dieser Arbeit ist die Untersuchung und Entwicklung numerischer Methoden zur Bewegungserzeugung von humanoiden Robotern basierend auf nichtlinearer modell-prädiktiver Regelung. Ausgehend von der Modellierung der Humanoiden als komplexe Mehrkörpermodelle, die sowohl durch unilaterale Kontaktbedingungen beschränkt als auch durch die Formulierung unteraktuiert sind, wird die Bewegungserzeugung als Optimalsteuerungsproblem formuliert. In dieser Arbeit werden numerische Erweiterungen basierend auf den Prinzipien der Automatischen Differentiation für rekursive Algorithmen, die eine effiziente Auswertung der dynamischen Größen der oben genannten Mehrkörperformulierung erlauben, hergeleitet, sodass sowohl die nominellen Größen als auch deren ersten Ableitungen effizient ausgewertet werden können. Basierend auf diesen Ideen werden Erweiterungen für die Auswertung der Kontaktdynamik und der Berechnung des Kontaktimpulses vorgeschlagen. Die Echtzeitfähigkeit der Berechnung von Regelantworten hängt stark von der Komplexität der für die Bewegungerzeugung gewählten Mehrkörperformulierung und der zur Verfügung stehenden Rechenleistung ab. Um einen optimalen Trade-Off zu ermöglichen, untersucht diese Arbeit einerseits die mögliche Reduktion der Mehrkörperdynamik und andererseits werden maßgeschneiderte numerische Methoden entwickelt, um die Echtzeitfähigkeit der Regelung zu realisieren. Im Rahmen dieser Arbeit werden hierfür zwei reduzierte Modelle hergeleitet: eine nichtlineare Erweiterung des linearen inversen Pendelmodells sowie eine reduzierte Modellvariante basierend auf der centroidalen Mehrkörperdynamik. Ferner wird ein Regelaufbau zur GanzkörperBewegungserzeugung vorgestellt, deren Hauptbestandteil jeweils aus einem speziell diskretisierten Problem der nichtlinearen modell-prädiktiven Regelung sowie einer maßgeschneiderter Optimierungsmethode besteht. Die Echtzeitfähigkeit des Ansatzes wird durch Experimente mit den Robotern HRP-2 und HeiCub verifiziert. Diese Arbeit schlägt eine Methode der nichtlinear modell-prädiktiven Regelung vor, die trotz der Komplexität der vollen Mehrkörperformulierung eine Berechnung der Regelungsantwort in Echtzeit ermöglicht. Dies wird durch die geschickte Kombination von linearer und nichtlinearer modell-prädiktiver Regelung auf der aktuellen beziehungsweise der letzten Linearisierung des Problems in einer parallelen Regelstrategie realisiert. Experimente mit dem humanoiden Roboter Leo zeigen, dass, im Vergleich zur nominellen Strategie, erst durch den Einsatz dieser Methode eine Bewegungserzeugung auf dem Roboter möglich ist. Neben Methoden der modell-basierten Optimalsteuerung werden auch modell-freie Methoden des verstärkenden Lernens (Reinforcement Learning) für die Bewegungserzeugung untersucht, mit dem Fokus auf den schwierig zu modellierenden Modellunsicherheiten der Roboter. Im Rahmen dieser Arbeit werden eine allgemeine vergleichende Studie sowie Leistungskennzahlen entwickelt, die es erlauben, modell-basierte und -freie Methoden quantitativ bezüglich ihres Lösungsverhaltens zu vergleichen. Die Anwendung der Studie auf ein akademisches Beispiel zeigt Unterschiede und Kompromisse sowie Break-Even-Punkte zwischen den Problemformulierungen. Diese Arbeit schlägt basierend auf dieser Grundlage zwei mögliche Kombinationen vor, deren Eigenschaften bewiesen und in Simulation untersucht werden. Außerdem wird die besser abschneidende Variante auf dem humanoiden Roboter Leo implementiert und mit einem nominellen modell-basierten Regler verglichen

    ADD: Analytically Differentiable Dynamics for Multi-Body Systems with Frictional Contact

    Full text link
    We present a differentiable dynamics solver that is able to handle frictional contact for rigid and deformable objects within a unified framework. Through a principled mollification of normal and tangential contact forces, our method circumvents the main difficulties inherent to the non-smooth nature of frictional contact. We combine this new contact model with fully-implicit time integration to obtain a robust and efficient dynamics solver that is analytically differentiable. In conjunction with adjoint sensitivity analysis, our formulation enables gradient-based optimization with adaptive trade-offs between simulation accuracy and smoothness of objective function landscapes. We thoroughly analyse our approach on a set of simulation examples involving rigid bodies, visco-elastic materials, and coupled multi-body systems. We furthermore showcase applications of our differentiable simulator to parameter estimation for deformable objects, motion planning for robotic manipulation, trajectory optimization for compliant walking robots, as well as efficient self-supervised learning of control policies.Comment: Moritz Geilinger and David Hahn contributed equally to this wor

    Optimization-Based Control for Dynamic Legged Robots

    Full text link
    In a world designed for legs, quadrupeds, bipeds, and humanoids have the opportunity to impact emerging robotics applications from logistics, to agriculture, to home assistance. The goal of this survey is to cover the recent progress toward these applications that has been driven by model-based optimization for the real-time generation and control of movement. The majority of the research community has converged on the idea of generating locomotion control laws by solving an optimal control problem (OCP) in either a model-based or data-driven manner. However, solving the most general of these problems online remains intractable due to complexities from intermittent unidirectional contacts with the environment, and from the many degrees of freedom of legged robots. This survey covers methods that have been pursued to make these OCPs computationally tractable, with specific focus on how environmental contacts are treated, how the model can be simplified, and how these choices affect the numerical solution methods employed. The survey focuses on model-based optimization, covering its recent use in a stand alone fashion, and suggesting avenues for combination with learning-based formulations to further accelerate progress in this growing field.Comment: submitted for initial review; comments welcom

    An Inverse Optimal Control Approach for Trajectory Prediction of Autonomous Race Cars

    Full text link
    This paper proposes an optimization-based approach to predict trajectories of autonomous race cars. We assume that the observed trajectory is the result of an optimization problem that trades off path progress against acceleration and jerk smoothness, and which is restricted by constraints. The algorithm predicts a trajectory by solving a parameterized nonlinear program (NLP) which contains path progress and smoothness in cost terms. By observing the actual motion of a vehicle, the parameters of prediction are updated by means of solving an inverse optimal control problem that contains the parameters of the predicting NLP as optimization variables. The algorithm therefore learns to predict the observed vehicle trajectory in a least-squares relation to measurement data and to the presumed structure of the predicting NLP. This work contributes with an algorithm that allows for accurate and interpretable predictions with sparse data. The algorithm is implemented on embedded hardware in an autonomous real-world race car that is competing in the challenge Roborace and analyzed with respect to recorded data.Comment: ECC 202

    Efficient numerical methods for hierarchical dynamic optimization with application to cerebral palsy gait modeling

    Get PDF
    This thesis aims at developing efficient mathematical methods for solving hierarchical dynamic optimization problems. The main motivation is to model processes in nature, for which there is evidence to assume that they run optimally. We describe models of such processes by optimal control problems (called optimal control models (OCMs)). However, an OCM typically includes unknown parameters that cannot be derived entirely on a theoretical basis, which is in particular the case for the cost function. Therefore, we develop parameter estimation techniques to estimate the unknowns in an OCM from observation data of the process. Mathematically, this leads to a hierarchical dynamic optimization problem with a parameter estimation problem on the upper level and an optimal control problem on the lower level. We focus on multi-stage equality and inequality constrained optimal control problems based on nonlinear ordinary differential equations. The main goal of this thesis is to derive numerically efficient mathematical methods for solving hierarchical dynamic optimization problems, and to use these methods to estimate parameters in high-dimensional OCMs from real-world measurement data. We develop parameter-dependent OCMs for the gait of cerebral palsy patients and able-bodied subjects. The unknown parameters in the OCMs are then estimated from real-world motion capture data provided by the Heidelberg MotionLab of the Orthopedic University Clinic Heidelberg by using the mathematical methods developed within this work. The main novelties and contributions of this thesis to the field of hierarchical dynamic optimization are summarized herein. - We establish a novel mathematical method, a so-called direct all-at-once approach, for solving hierarchical dynamic optimization problems based on the direct multiple shooting method and first-order optimality conditions. - Furthermore, we propose an efficient numerical algorithm for large-scale hierarchical dynamic optimization problems, which fully exploits the structures inherited from both the hierarchical setting and the discretization. - Pontryagin's maximum principle is used to analyze solution properties of hierarchical dynamic optimization problems like second-order optimality conditions of the lower-level problem. - In addition, we propose and discuss alternative methods for hierarchical dynamic optimization that are based on derivative-free optimization and a bundle approach. These methods keep the hierarchical problem setting and do not reformulate the lower-level problem using first-order optimality conditions. - We establish a novel lifting method for regularizing mathematical programs with complementarity constraints, which is discussed and numerically investigated by means of a well-known collection of benchmark problems. - Proofs of regularity and convergence results for sequential quadratic programming methods applied to lifted mathematical programs with complementarity constraints are provided. - Efficient state-of-the-art implementations of all mathematical methods derived in this thesis, as well as a benchmark collection of hierarchical dynamic optimization problems are presented. - High-dimensional optimal control gait models for cerebral palsy patients and able-bodied subjects are developed. The mathematical methods derived in this thesis are used to estimate the unknown model parameters from real-world motion capture data provided by the Heidelberg MotionLab of the Orthopedic University Clinic Heidelberg. The theoretical and practical results presented in this thesis can be considered an initial motivating step towards answering open questions in current medical research in fields like treatment planning, classification of gaits, or the evaluation of surgeries by means of hierarchical dynamic optimization

    Optimization-based multi-contact motion planning for legged robots

    Get PDF
    For legged robots, generating dynamic and versatile motions is essential for interacting with complex and ever-changing environments. So far, robots that routinely operate reliably over rough terrains remains an elusive goal. Yet the primary promise of legged locomotion is to replace humans and animals in performing tedious and menial tasks, without requiring changes in the environment as wheeled robots do. A necessary step towards this goal is to endow robots with capabilities to reason about contacts but this vital skill is currently missing. An important justification for this is that contact phenomena are inherently non-smooth and non-convex. As a result, posing and solving problems involving contacts is non-trivial. Optimization-based motion planning constitutes a powerful paradigm to this end. Consequently, this thesis considers the problem of generating motions in contact-rich situations. Specifically, we introduce several methods that compute dynamic and versatile motion plans from a holistic optimization perspective based on trajectory optimization techniques. The advantage is that the user needs to provide a high-level task description in the form of an objective function only. Subsequently, the methods output a detailed motion plan—that includes contact locations, timings, gait patterns—that optimally achieves the high-level task. Initially, we assume that such a motion plan is available, and we investigate the relevant control problem. The problem is to track a nominal motion plan as close as possible given external disturbances by computing inputs for the robot. Thus, this stage typically follows the motion planning stage. Additionally, this thesis presents methods that do not necessarily require a separate control stage by computing the controller structure automatically. Afterwards, we proceed to the main parts of this thesis. First, assuming a pre-specified contact sequence, we formulate a trajectory optimization method reminiscent of hybrid approaches. Its backbone is a high-accuracy integrator, enabling reliable long-term motion planning while satisfying both translational and rotational dynamics. We utilize it to compute motion plans for a hopper traversing rough terrains—with gaps and obstacles—and performing explosive motions, like a somersault. Subsequently, we provide a discussion on how to extend the method when the contact sequence is unspecified. In the next chapter, we increase the complexity of the problem in many aspects. First, we formulate the problem in joint-level utilizing full dynamics and kinematics models. Second, we assume a contact-implicit perspective, i.e. decisions about contacts are implicitly defined in the problem’s formulation rather than defined as explicit contact modes. As a result, pre-specification of the contact interactions is not required, like the order by which the feet contact the ground for a quadruped robot model and the respective timings. Finally, we extend the classical rigid contact model to surfaces with soft and slippery properties. We quantitatively evaluate our proposed framework by performing comparisons against the rigid model and an alternative contact-implicit framework. Furthermore, we compute motion plans for a high-dimensional quadruped robot in a variety of terrains exhibiting the enhanced properties. In the final study, we extend the classical Differential Dynamic Programming algorithm to handle systems defined by implicit dynamics. While this can be of interest in its own right, our particular application is computing motion plans in contact-rich settings. Compared to the method presented in the previous chapter, this formulation enables experiencing contacts with all body parts in a receding horizon fashion, albeit with limited contact discovery capabilities. We demonstrate the properties of our proposed extension by comparing implicit and explicit models and generating motion plans for a single-legged robot with multiple contacts both for trajectory optimization and receding horizon settings. We conclude this thesis by providing insights and limitations of the proposed methods, and possible future directions that can improve and extend aspects of the presented work

    Versatile Multi-Contact Planning and Control for Legged Loco-Manipulation

    Full text link
    Loco-manipulation planning skills are pivotal for expanding the utility of robots in everyday environments. These skills can be assessed based on a system's ability to coordinate complex holistic movements and multiple contact interactions when solving different tasks. However, existing approaches have been merely able to shape such behaviors with hand-crafted state machines, densely engineered rewards, or pre-recorded expert demonstrations. Here, we propose a minimally-guided framework that automatically discovers whole-body trajectories jointly with contact schedules for solving general loco-manipulation tasks in pre-modeled environments. The key insight is that multi-modal problems of this nature can be formulated and treated within the context of integrated Task and Motion Planning (TAMP). An effective bilevel search strategy is achieved by incorporating domain-specific rules and adequately combining the strengths of different planning techniques: trajectory optimization and informed graph search coupled with sampling-based planning. We showcase emergent behaviors for a quadrupedal mobile manipulator exploiting both prehensile and non-prehensile interactions to perform real-world tasks such as opening/closing heavy dishwashers and traversing spring-loaded doors. These behaviors are also deployed on the real system using a two-layer whole-body tracking controller
    corecore