10 research outputs found
Recommended from our members
A Variational Model for Joint Motion Estimation and Image Reconstruction
The aim of this paper is to derive and analyze a variational model for the joint estimation of motion and reconstruction of image sequences, which is based on a time-continuous Eulerian motion model. The model can be set up in terms of the continuity equation or the brightness constancy equation. The analysis in this paper focuses on the latter for robust motion estimation on sequences of twodimensional images. We rigorously prove the existence of a minimizer in a suitable function space setting. Moreover, we discuss the numerical solution of the model based on primal-dual algorithms and investigate several examples. Finally, the benefits of our model compared to existing techniques, such as sequential image reconstruction and motion estimation, are shown.The work of the first author was also supported by the German
Science Foundation DFG via EXC 1003 Cells in Motion Cluster of Excellence, M¨unster, German
Recommended from our members
Large-Scale Multi-Agent Transport: Theory, Algorithms and Analysis
The problem of transport of multi-agent systems has received much attention in a wide range of engineering and biological contexts, such as spatial coverage optimization, collective migration, estimation and mapping of unknown environments. In particular, the emphasis has been on the search for scalable decentralized algorithms that are applicable to large-scale multi-agent systems.For large multi-agent collectives, it is appropriate to describe the configuration of the collective and its evolution using macroscopic quantities, while actuation rests at the microscopic scale at the level of individual agents. Moreover, the control problem faces a multitude of information constraints imposed by the multi-agent setting, such as limitations in sensing, communication and localization. Viewed in this way, the problem naturally extends across scales and this motivates a search for algorithms that respect information constraints at the microscopic level while guaranteeing performance at the macroscopic level.We address the above concerns in this dissertation on three fronts: theory, algorithms and analysis. We begin with the development of a multiscale theory of gradient descent-based multi-agent transport that bridges the microscopic and macroscopic perspectives and sets out a general framework for the design and analysis of decentralized algorithms for transport. We then consider the problem of optimal transport of multi-agent systems, wherein the objective is the minimization of the net cost of transport under constraints of distributed computation. This is followed by a treatment of multi-agent transport under constraints on sensing and communication, in the absence of location information, where we study the problem of self-organization in swarms of agents. Motivated by the problem of multi-agent navigation and tracking of moving targets, we then present a study of moving-horizon estimation of nonlinear systems viewed as a transport of probability measures. Finally, we investigate the robustness of multi-agent networks to agent failure, via the problem of identifying critical nodes in large-scale networks
Fast, Optimal, and Safe Motion Planning for Bipedal Robots
Bipedal robots have the potential to traverse a wide range of unstructured environments, which are otherwise inaccessible to wheeled vehicles.
Though roboticists have successfully constructed controllers for bipedal robots to walk over uneven terrain such as snow, sand, or even stairs, it has remained challenging to synthesize such controllers in an online fashion while guaranteeing their satisfactory performance.
This is primarily due to the lack of numerical method that can accommodate the non-smooth dynamics, high degrees of freedom, and underactuation that characterize bipedal robots.
This dissertation proposes and implements a family of numerical methods that begin to address these three challenges along three dimensions: optimality, safety, and computational speed.
First, this dissertation develops a convex relaxation-based approach to solve optimal control for hybrid systems without a priori knowledge of the optimal sequence of transition.
This is accomplished by formulating the problem in the space of relaxed controls, which gives rise to a linear program whose solution is proven to compute the globally optimal controller.
This conceptual program is solved using a sequence of semidefinite programs whose solutions are proven to converge from below to the true optimal solution of the original optimal control problem.
Moreover, a method to synthesize the optimal controller is developed.
Using an array of examples, the performance of this method is validated on problems with known solutions and also compared to a commercial solver.
Second, this dissertation constructs a method to generate safety-preserving controllers for a planar bipedal robot walking on flat ground by performing reachability analysis on simplified models under the assumption that the difference between the two models can be bounded.
Subsequently, this dissertation describes how this reachable set can be incorporated into a Model Predictive Control framework to select controllers that result in safe walking on the biped in an online fashion.
This method is validated on a 5-link planar model.
Third, this dissertation proposes a novel parallel algorithm capable of finding guaranteed optimal solutions to polynomial optimization problems up to pre-specified tolerances.
Formal proofs of bounds on the time and memory usage of such method are also given.
Such algorithm is implemented in parallel on GPUs and compared against state-of-the-art solvers on a group of benchmark examples.
An application of such method on a real-time trajectory-planning task of a mobile robot is also demonstrated.
Fourth, this dissertation constructs an online Model Predictive Control framework that guarantees safety of a 3D bipedal robot walking in a forest of randomly-placed obstacles.
Using numerical integration and interval arithmetic techniques, approximations to trajectories of the robot are constructed along with guaranteed bounds on the approximation error.
Safety constraints are derived using these error bounds and incorporated in a Model Predictive Control framework whose feasible solutions keep the robot from falling over and from running into obstacles.
To ensure that the bipedal robot is able to avoid falling for all time, a finite-time terminal constraint is added to the Model Predictive Control algorithm.
The performance of this method is implemented and compared against a naive Model Predictive Control method on a biped model with 20 degrees of freedom.
In summary, this dissertation presents four methods for control synthesis of bipedal robots with improvements in either optimality, safety guarantee, or computational speed.
Furthermore, the performance of all proposed methods are compared with existing methods in the field.PHDMechanical EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/162880/1/pczhao_1.pd
Variational methods for combined image and motion estimation
Diese Arbeit beschäftigt sich mit zwei Variationsmodellen zur kombinierten Bild- und Bewegungsschätzung. Der Fokus liegt dabei auf einer detaillierten Analysis und der Vorstellung eines numerischen Frameworks zur Implementierung. Die entwickelten Methoden werden in beiden Fällen auf je einem künstlichen Datensatz mit bereits bekannten Methoden detailliert verglichen.This thesis is concerned with two variational models for combined image and motion estimation. The focus is laid on establishing analytical results aswell as presenting a numerical framework for the implementation. Both methods are compared in detail to established methods on artificial data.<br