106 research outputs found
Recent advances on filtering and control for nonlinear stochastic complex systems with incomplete information: A survey
This Article is provided by the Brunel Open Access Publishing Fund - Copyright @ 2012 Hindawi PublishingSome recent advances on the filtering and control problems for nonlinear stochastic complex systems with incomplete information are surveyed. The incomplete information under consideration mainly includes missing measurements, randomly varying sensor delays, signal quantization, sensor saturations, and signal sampling. With such incomplete information, the developments on various filtering and control issues are reviewed in great detail. In particular, the addressed nonlinear stochastic complex systems are so comprehensive that they include conventional nonlinear stochastic systems, different kinds of complex networks, and a large class of sensor networks. The corresponding filtering and control technologies for such nonlinear stochastic complex systems are then discussed. Subsequently, some latest results on the filtering and control problems for the complex systems with incomplete information are given. Finally, conclusions are drawn and several possible future research directions are pointed out.This work was supported in part by the National Natural Science Foundation of China under Grant nos. 61134009, 61104125, 61028008, 61174136, 60974030, and 61074129, the Qing Lan Project of Jiangsu Province of China, the Project sponsored by SRF for ROCS of SEM of China, the Engineering and Physical Sciences Research Council EPSRC of the UK under Grant GR/S27658/01, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany
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
Performance analysis with network-enhanced complexities: On fading measurements, event-triggered mechanisms, and cyber attacks
Copyright © 2014 Derui Ding 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.Nowadays, the real-world systems are usually subject to various complexities such as parameter uncertainties, time-delays, and nonlinear disturbances. For networked systems, especially large-scale systems such as multiagent systems and systems over sensor networks, the complexities are inevitably enhanced in terms of their degrees or intensities because of the usage of the communication networks. Therefore, it would be interesting to (1) examine how this kind of network-enhanced complexities affects the control or filtering performance; and (2) develop some suitable approaches for controller/filter design problems. In this paper, we aim to survey some recent advances on the performance analysis and synthesis with three sorts of fashionable network-enhanced complexities, namely, fading measurements, event-triggered mechanisms, and attack behaviors of adversaries. First, these three kinds of complexities are introduced in detail according to their engineering backgrounds, dynamical characteristic, and modelling techniques. Then, the developments of the performance analysis and synthesis issues for various networked systems are systematically reviewed. Furthermore, some challenges are illustrated by using a thorough literature review and some possible future research directions are highlighted.This work was supported in part by the National Natural Science Foundation of China under Grants 61134009, 61329301, 61203139, 61374127, and 61374010, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany
Distributed Delay-Tolerant Strategies for Equality-Constraint Sum-Preserving Resource Allocation
This paper proposes two nonlinear dynamics to solve constrained distributed
optimization problem for resource allocation over a multi-agent network. In
this setup, coupling constraint refers to resource-demand balance which is
preserved at all-times. The proposed solutions can address various model
nonlinearities, for example, due to quantization and/or saturation. Further, it
allows to reach faster convergence or to robustify the solution against
impulsive noise or uncertainties. We prove convergence over weakly connected
networks using convex analysis and Lyapunov theory. Our findings show that
convergence can be reached for general sign-preserving odd nonlinearity. We
further propose delay-tolerant mechanisms to handle general bounded
heterogeneous time-varying delays over the communication network of agents
while preserving all-time feasibility. This work finds application in CPU
scheduling and coverage control among others. This paper advances the
state-of-the-art by addressing (i) possible nonlinearity on the agents/links,
meanwhile handling (ii) resource-demand feasibility at all times, (iii)
uniform-connectivity instead of all-time connectivity, and (iv) possible
heterogeneous and time-varying delays. To our best knowledge, no existing work
addresses contributions (i)-(iv) altogether. Simulations and comparative
analysis are provided to corroborate our contributions
Self-Triggered Network Coordination over Noisy Communication Channels
This paper investigates coordination problems over packet-based communication
channels. We consider the scenario in which the communication between network
nodes is corrupted by unknown-but-bounded noise. We introduce a novel
coordination scheme, which ensures practical consensus in the noiseless case,
while preserving bounds on the nodes disagreement in the noisy case. The
proposed scheme does not require any global information about the network
parameters and/or the operating environment (the noise characteristics).
Moreover, network nodes can sample at independent rates and in an aperiodic
manner. The analysis is substantiated by extensive numerical simulations.Comment: 15 pages, 15 figure
- …