1,499 research outputs found
Mathematical control of complex systems
Copyright © 2013 ZidongWang et al.This is an open access article distributed under the Creative Commons Attribution License,
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited
Decentralized formation control with connectivity maintenance and collision avoidance under limited and intermittent sensing
A decentralized switched controller is developed for dynamic agents to
perform global formation configuration convergence while maintaining network
connectivity and avoiding collision within agents and between stationary
obstacles, using only local feedback under limited and intermittent sensing.
Due to the intermittent sensing, constant position feedback may not be
available for agents all the time. Intermittent sensing can also lead to a
disconnected network or collisions between agents. Using a navigation function
framework, a decentralized switched controller is developed to navigate the
agents to the desired positions while ensuring network maintenance and
collision avoidance.Comment: 8 pages, 2 figures, submitted to ACC 201
Similarity based cooperation and spatial segregation
We analyze a cooperative game, where the cooperative act is not based on the
previous behaviour of the co-player, but on the similarity between the players.
This system has been studied in a mean-field description recently [A. Traulsen
and H. G. Schuster, Phys. Rev. E 68, 046129 (2003)]. Here, the spatial
extension to a two-dimensional lattice is studied, where each player interacts
with eight players in a Moore neighborhood. The system shows a strong
segregation independent on parameters. The introduction of a local conversion
mechanism towards tolerance allows for four-state cycles and the emergence of
spiral waves in the spatial game. In the case of asymmetric costs of
cooperation a rich variety of complex behavior is observed depending on both
cooperation costs. Finally, we study the stabilization of a cooperative fixed
point of a forecast rule in the symmetric game, which corresponds to
cooperation across segregation borders. This fixed point becomes unstable for
high cooperation costs, but can be stabilized by a linear feedback mechanism.Comment: 7 pages, 9 figure
An Overview of Recent Progress in the Study of Distributed Multi-agent Coordination
This article reviews some main results and progress in distributed
multi-agent coordination, focusing on papers published in major control systems
and robotics journals since 2006. Distributed coordination of multiple
vehicles, including unmanned aerial vehicles, unmanned ground vehicles and
unmanned underwater vehicles, has been a very active research subject studied
extensively by the systems and control community. The recent results in this
area are categorized into several directions, such as consensus, formation
control, optimization, task assignment, and estimation. After the review, a
short discussion section is included to summarize the existing research and to
propose several promising research directions along with some open problems
that are deemed important for further investigations
Consensus analysis of multi-agent systems under switching topologies by a topology-dependent average dwell time approach
© The Institution of Engineering and Technology 2016. This study addresses the consensus problem for a class of any order multi-agent systems under switching topologies which could include kinds of unconsensusable topologies. The consensus problem, depending on structure properties and the corresponding topology, is researched with fixed structure properties under directed switching topologies. By the properties of Laplacian matrix, the consensus problem for multi-agent systems is converted into the stability problem of the corresponding switched systems with a Laplacian-like matrix. Some sufficient conditions for consensus are presented by using the dwell time approach. Finally, numerical examples and the results of computer simulation are given to verify the theoretical analysis
Finite-time synchronization of Markovian neural networks with proportional delays and discontinuous activations
In this paper, finite-time synchronization of neural networks (NNs) with discontinuous activation functions (DAFs), Markovian switching, and proportional delays is studied in the framework of Filippov solution. Since proportional delay is unbounded and different from infinite-time distributed delay and classical finite-time analytical techniques are not applicable anymore, new 1-norm analytical techniques are developed. Controllers with and without the sign function are designed to overcome the effects of the uncertainties induced by Filippov solutions and further synchronize the considered NNs in a finite time. By designing new Lyapunov functionals and using M-matrix method, sufficient conditions are derived to guarantee that the considered NNs realize synchronization in a settling time without introducing any free parameters. It is shown that, though the proportional delay can be unbounded, complete synchronization can still be realized, and the settling time can be explicitly estimated. Moreover, it is discovered that controllers with sign function can reduce the control gains, while controllers without the sign function can overcome chattering phenomenon. Finally, numerical simulations are given to show the effectiveness of theoretical results
Estimation and stability of nonlinear control systems under intermittent information with applications to multi-agent robotics
This dissertation investigates the role of intermittent information in estimation and control problems and applies the obtained results to multi-agent tasks in robotics. First, we develop a stochastic hybrid model of mobile networks able to capture a large variety of heterogeneous multi-agent problems and phenomena. This model is applied to a case study where a heterogeneous mobile sensor network cooperatively detects and tracks mobile targets based on intermittent observations. When these observations form a satisfactory target trajectory, a mobile sensor is switched to the pursuit mode and deployed to capture the target. The cost of operating the sensors is determined from the geometric properties of the network, environment and probability of target detection. The above case study is motivated by the Marco Polo game played by children in swimming pools. Second, we develop adaptive sampling of targets positions in order to minimize energy consumption, while satisfying performance guarantees such as increased probability of detection over time, and no-escape conditions. A parsimonious predictor-corrector tracking filter, that uses geometrical properties of targets\u27 tracks to estimate their positions using imperfect and intermittent measurements, is presented. It is shown that this filter requires substantially less information and processing power than the Unscented Kalman Filter and Sampling Importance Resampling Particle Filter, while providing comparable estimation performance in the presence of intermittent information. Third, we investigate stability of nonlinear control systems under intermittent information. We replace the traditional periodic paradigm, where the up-to-date information is transmitted and control laws are executed in a periodic fashion, with the event-triggered paradigm. Building on the small gain theorem, we develop input-output triggered control algorithms yielding stable closed-loop systems. In other words, based on the currently available (but outdated) measurements of the outputs and external inputs of a plant, a mechanism triggering when to obtain new measurements and update the control inputs is provided. Depending on the noise environment, the developed algorithm yields stable, asymptotically stable, and Lp-stable (with bias) closed-loop systems. Control loops are modeled as interconnections of hybrid systems for which novel results on Lp-stability are presented. Prediction of a triggering event is achieved by employing Lp-gains over a finite horizon in the small gain theorem. By resorting to convex programming, a method to compute Lp-gains over a finite horizon is devised. Next, we investigate optimal intermittent feedback for nonlinear control systems. Using the currently available measurements from a plant, we develop a methodology that outputs when to update the control law with new measurements such that a given cost function is minimized. Our cost function captures trade-offs between the performance and energy consumption of the control system. The optimization problem is formulated as a Dynamic Programming problem, and Approximate Dynamic Programming is employed to solve it. Instead of advocating a particular approximation architecture for Approximate Dynamic Programming, we formulate properties that successful approximation architectures satisfy. In addition, we consider problems with partially observable states, and propose Particle Filtering to deal with partially observable states and intermittent feedback. Finally, we investigate a decentralized output synchronization problem of heterogeneous linear systems. We develop a self-triggered output broadcasting policy for the interconnected systems. Broadcasting time instants adapt to the current communication topology. For a fixed topology, our broadcasting policy yields global exponential output synchronization, and Lp-stable output synchronization in the presence of disturbances. Employing a converse Lyapunov theorem for impulsive systems, we provide an average dwell time condition that yields disturbance-to-state stable output synchronization in case of switching topology. Our approach is applicable to directed and unbalanced communication topologies.\u2
- …