Optimal Control of Vehicular Formations With Nearest Neighbor Interactions

We consider the design of optimal localized feedback gains for one-dimensional formations in which vehicles only use information from their immediate neighbors. The control objective is to enhance coherence of the formation by making it behave like a rigid lattice. For the single-integrator model with symmetric gains, we establish convexity, implying that the globally optimal controller can be computed efficiently. We also identify a class of convex problems for double-integrators by restricting the controller to symmetric position and uniform diagonal velocity gains. To obtain the optimal non-symmetric gains for both the single- and the double-integrator models, we solve a parameterized family of optimal control problems ranging from an easily solvable problem to the problem of interest as the underlying parameter increases. When this parameter is kept small, we employ perturbation analysis to decouple the matrix equations that result from the optimality conditions, thereby rendering the unique optimal feedback gain. This solution is used to initialize a homotopy-based Newton’s method to find the optimal localized gain. To investigate the performance of localized controllers, we examine how the coherence of large-scale stochastically forced formations scales with the number of vehicles. We establish several explicit scaling relationships and show that the best performance is achieved by a localized controller that is both non-symmetric and spatially-varying

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

Planification de trajectoire et contrôle d'un système collaboratif : Application à un drone trirotor

This thesis is dedicated to the creation of a complete framework, from high-level to low-level, of trajectory generation for a group of independent dynamical systems. This framework, based for the trajectory generation, on the resolution of Burgers equation, is applied to a novel model of trirotor UAV and uses the flatness of the two levels of dynamical systems.The first part of this thesis is dedicated to the generation of trajectories. Formal solutions to the heat equation are created using the differential flatness of this equation. These solutions are transformed into solutions to Burgers' equation through Hopf-Cole transformation to match the desired formations. They are optimized to match specific requirements. Several examples of trajectories are given.The second part is dedicated to the autonomous trajectory tracking by a trirotor UAV. This UAV is totally actuated and a nonlinear closed-loop controller is suggested. This controller is tested on the ground and in flight by tracking, rolling or flying, a trajectory. A model is presented and a control approach is suggested to transport a pendulum load.L'objet de cette thèse est de proposer un cadre complet, du haut niveau au bas niveau, de génération de trajectoires pour un groupe de systèmes dynamiques indépendants. Ce cadre, basé sur la résolution de l'équation de Burgers pour la génération de trajectoires, est appliqué à un modèle original de drone trirotor et utilise la platitude des deux systèmes différentiels considérés. La première partie du manuscrit est consacrée à la génération de trajectoires. Celle-ci est effectuée en créant formellement, par le biais de la platitude du système considéré, des solutions à l'équation de la chaleur. Ces solutions sont transformées en solution de l'équation de Burgers par la transformation de Hopf-Cole pour correspondre aux formations voulues. Elles sont optimisées pour répondre à des contraintes spécifiques. Plusieurs exemples de trajectoires sont donnés.La deuxième partie est consacrée au suivi autonome de trajectoire par un drone trirotor. Ce drone est totalement actionné et un contrôleur en boucle fermée non-linéaire est proposé. Celui-ci est testé en suivant, en roulant, des trajectoires au sol et en vol. Un modèle est présenté et une démarche pour le contrôle est proposée pour transporter une charge pendulaire

2018 SDSU Data Science Symposium Program

Table of Contents: Letter from SDSU PresidentLetter from SDSU Department of Mathematics and Statistics Dept. HeadSponsorsGeneral InformationKeynote SpeakersInvited SpeakersSunday ScheduleWorkshop InformationMonday ScheduleAbstracts| Invited SpeakersAbstracts | Oral PresentationsPoster PresentationCommittee and Volunteer

Path planning in time dependent flows using level set methods

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2012.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Cataloged from student-submitted PDF version of thesis.Includes bibliographical references (p. 167-177).Autonomous underwater vehicles such as gliders have emerged as valuable scientific platforms due to their increasing uses in several oceanic applications, ranging from security, acoustic surveillance and military reconnaissance to collection of ocean data at specific locations for ocean prediction, monitoring and dynamics investigation. Gliders exhibit high levels of autonomy and are ideal for long range missions. As these gliders become more reliable and affordable, multi-vehicle coordination and sampling missions are expected to become very common in the near future. This endurance of gliders however, comes at an expense of being susceptible to typical coastal ocean currents. Due to the physical limitations of underwater vehicles and the highly dynamic nature of the coastal ocean, path planning to generate safe and fast vehicle trajectories becomes crucial for their successful operation. As a result, our motivation in this thesis is to develop a computationally efficient and rigorous methodology that can predict the time-optimal paths of underwater vehicles navigating in continuous, strong and dynamic ow-fields. The goal is to predict a sequence of steering directions so that vehicles can best utilize or avoid ow currents to minimize their travel time. In this thesis, we fist review existing path planning methods and discuss their advantages and drawbacks. Then, we discuss the theory of level set methods and their utility in solving front tracking problems. Then, we present a rigorous (partial differential equation based) methodology based on the level set method, which can compute time-optimal paths of swarms of underwater vehicles, obviating the need for any heuristic control based approaches. We state and prove a theorem, along with several corollaries, that forms the foundation of our approach for path planning. We show that our algorithm is computationally efficient - the computational cost grows linearly with the number of vehicles and geometrically with spatial directions. We illustrate the working and capabilities of our path planning algorithm by means of a number of applications. First, we validate our approach through simple benchmark applications, and later apply our methodology to more complex, realistic and numerically simulated ow-fields, which include eddies, jets, obstacles and forbidden regions. Finally, we extend our methodology to solve problems of coordinated motion of multiple vehicles in strong dynamic ow-fields. Here, coordination refers to maintenance of specific geometric patterns by the vehicles. The level-set based control scheme that we derive is shown to provide substantial advantages to a local control approach. Specifically, the illustrations show that the resulting coordinated vehicle motions can maintain specific patterns in dynamic flow fields with strong and complex spatial gradients.by Sri Venkata Tapovan Lolla.S.M