534 research outputs found
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
Multi-robot coordination and safe learning using barrier certificates
The objective of this research is to develop a formal safety framework for collision-free and connectivity sustained motion in multi-robot coordination and learning based control. This safety framework is designed with barrier certificates, which provably guarantee the safety of dynamical systems based on the set invariance principle. The barrier certificates are enforced on the system using an online optimization-based controller such that minimal changes to the existing control strategies are required to guarantee safety. The proposed safety barrier certificates are validated on real multi-robot systems consisting of multiple Khepera robots, Magellan Pro robot, GRITS-Bots, and Crazyflie quadrotors.Ph.D
Cooperative Control of Nonlinear Multi-Agent Systems
Multi-agent systems have attracted great interest due to their potential applications in a variety of areas. In this dissertation, a nonlinear consensus algorithm is developed for networked Euler-Lagrange multi-agent systems. The proposed consensus algorithm guarantees that all agents can reach a common state in the workspace. Meanwhile, the external disturbances and structural uncertainties are fundamentally considered in the controller design. The robustness of the proposed consensus algorithm is then demonstrated in the stability analysis. Furthermore, experiments are conducted to validate the effectiveness of the proposed consensus algorithm.
Next, a distributed leader-follower formation tracking controller is developed for networked nonlinear multi-agent systems. The dynamics of each agent are modeled by Euler-Lagrange equations, and all agents are guaranteed to track a desired time-varying trajectory in the presence of noise. The fault diagnosis strategy of the nonlinear multi-agent system is also investigated with the help of differential geometry tools. The effectiveness of the proposed controller is verified through simulations.
To further extend the application area of the multi-agent technique, a distributed robust controller is then developed for networked Lipschitz nonlinear multi-agent systems. With the appearance of system uncertainties and external disturbances, a sampled-data feedback control protocol is carried out through the Lyapunov functional approach. The effectiveness of the proposed controller is verified by numerical simulations. Other than the robustness and sampled-data information exchange, this dissertation is also concerned with the event-triggered consensus problem for the Lipschitz nonlinear multi-agent systems. Furthermore, the sufficient condition for the stochastic stabilization of the networked control system is proposed based on the Lyapunov functional method. Finally, simulation is conducted to demonstrate the effectiveness of the proposed control algorithm.
In this dissertation, the cooperative control of networked Euler-Lagrange systems and networked Lipschitz systems is investigated essentially with the assistance of nonlinear control theory and diverse controller design techniques. The main objective of this work is to propose realizable control algorithms for nonlinear multi-agent systems
Coordinated Robot Navigation via Hierarchical Clustering
We introduce the use of hierarchical clustering for relaxed, deterministic
coordination and control of multiple robots. Traditionally an unsupervised
learning method, hierarchical clustering offers a formalism for identifying and
representing spatially cohesive and segregated robot groups at different
resolutions by relating the continuous space of configurations to the
combinatorial space of trees. We formalize and exploit this relation,
developing computationally effective reactive algorithms for navigating through
the combinatorial space in concert with geometric realizations for a particular
choice of hierarchical clustering method. These constructions yield
computationally effective vector field planners for both hierarchically
invariant as well as transitional navigation in the configuration space. We
apply these methods to the centralized coordination and control of
perfectly sensed and actuated Euclidean spheres in a -dimensional ambient
space (for arbitrary and ). Given a desired configuration supporting a
desired hierarchy, we construct a hybrid controller which is quadratic in
and algebraic in and prove that its execution brings all but a measure zero
set of initial configurations to the desired goal with the guarantee of no
collisions along the way.Comment: 29 pages, 13 figures, 8 tables, extended version of a paper in
preparation for submission to a journa
COOPERATIVE LEARNING FOR THE CONSENSUS OF MULTI-AGENT SYSTEMS
Due to a lot of attention for the multi-agent system in recent years, the consensus algorithm gained immense popularity for building fault-tolerant systems in system and control theory. Generally, the consensus algorithm drives the swarm of agents to work as a coherent group that can reach an agreement regarding a certain quantity of interest, which depends on the state of all agents themselves. The most common consensus algorithm is the average consensus, the final consensus value of which is equal to the average of the initial values. If we want the agents to find the best area of the particular resources, the average consensus will be failure. Thus the algorithm is restricted due to its incapacity to solve some optimization problems.
In this dissertation, we want the agents to become more intelligent so that they can handle different optimization problems. Based on this idea, we first design a new consensus algorithm which modifies the general bat algorithm. Since bat algorithm is a swarm intelligence method and is proven to be suitable for solving the optimization problems, this modification is pretty straightforward. The optimization problem suggests the convergence direction. Also, in order to accelerate the convergence speed, we incorporate a term related to flux function, which serves as an energy/mass exchange rate in compartmental modeling or a heat transfer rate in thermodynamics. This term is inspired by the speed-up and speed-down strategy from biological swarms. We prove the stability of the proposed consensus algorithm for both linear and nonlinear flux functions in detail by the matrix paracontraction tool and the Lyapunov-based method, respectively.
Another direction we are trying is to use the deep reinforcement learning to train the agent to reach the consensus state. Let the agent learn the input command by this method, they can become more intelligent without human intervention. By this method, we totally ignore the complex mathematical model in designing the protocol for the general consensus problem. The deep deterministic policy gradient algorithm is used to plan the command of the agent in the continuous domain. The moving robots systems are considered to be used to verify the effectiveness of the algorithm.
Adviser: Qing Hu
- …