Showing papers in "Automatica in 2011"
••
TL;DR: This paper suggests the lower bound lemma for such a combination, which achieves performance behavior identical to approaches based on the integral inequality lemma but with much less decision variables, comparable to thosebased on the Jensen inequalityLemma.
2,248 citations
••
TL;DR: An internal model requirement is necessary and sufficient for synchronizability of the network to polynomially bounded trajectories and the resulting dynamic feedback couplings can be interpreted as a generalization of existing methods for identical linear systems.
886 citations
••
TL;DR: The auxiliary design system is introduced to analyze the effect of input constraints, and its states are used to adaptive tracking control design, and the closed-loop semi-global uniformly ultimate bounded stability is achieved via Lyapunov synthesis.
861 citations
••
TL;DR: This paper discusses the finite-time consensus problem for leaderless and leader-follower multi-agent systems with external disturbances, and proposes continuous distributed control algorithms designed for these agents described by double integrators.
816 citations
••
TL;DR: It is shown that asymptotic output tracking is achieved without violation of the time-varying constraint, and that all closed loop signals remain bounded.
688 citations
••
TL;DR: A Maximum Likelihood (ML) framework is employed and an Expectation Maximisation (EM) algorithm is derived to compute these ML estimates, which lend itself perfectly to the particle smoother, which provides arbitrarily good estimates.
543 citations
••
TL;DR: Under the assumption that the initial network is connected, this work introduces local adaptation strategies for both the weights on the velocity navigational feedback and the velocity coupling strengths that enable all agents to synchronize with the virtual leader even when only one agent is informed, without requiring any knowledge of the agent dynamics.
504 citations
••
TL;DR: It is found that second-order consensus in such a multi-agent system cannot be reached without any sampled position data under the given protocol while it can be achieved by appropriately choosing the sampling period.
480 citations
••
TL;DR: It is shown that, for any time-invariant exponentially stable linear system with additive disturbances, time-varying exponentially stable interval observers can be constructed.
429 citations
••
TL;DR: An automatic C-code generation strategy for real-time nonlinear model predictive control (NMPC) is presented, which is designed for applications with kilohertz sample rates and shows a promising performance being able to provide feedback in much less than a millisecond.
414 citations
••
TL;DR: It is proved that for networks of interconnected second-order linear time invariant systems, one can construct a bank of unknown input observers, and use them to detect and isolate faults in the network, by exploiting the system structure.
••
TL;DR: A Lyapunov theorem on finite-time instability is proved, which states that almost surely globally asymptotical stability is not equivalent to finite- time stability for some stochastic systems.
••
TL;DR: An online adaptive control algorithm based on policy iteration reinforcement learning techniques to solve the continuous-time (CT) multi player non-zero-sum (NZS) game with infinite horizon for linear and nonlinear systems.
••
TL;DR: A new iterative adaptive dynamic programming (ADP) method is proposed to solve a class of continuous-time nonlinear two-person zero-sum differential games and the convergence property of the performance index function is proved.
••
TL;DR: The distributed parameter model of the flexible marine riser with vessel dynamics is described by a partial differential equation coupled with ordinary differential equations (ODEs) involving functions of space and time to reduce the riser's vibrations.
••
TL;DR: A unified theoretical framework-based on a general Lyapunov-like function-that, upon slight modification, allows to analyze the stability of all the schemes.
••
TL;DR: This paper is concerned with the two-mode-dependent robust control synthesis of networked control systems where random delays existing in both forward controller-to-actuator (C-A) and feedback sensor- to-controller (S-C) communication links are modeled as Markov chains.
••
TL;DR: Both a state feedback controller and an observer-based output feedback controller are designed and the infinite distributed delay is introduced in the discrete networked domain for the first time.
••
TL;DR: It is shown that, even if all the subsystems governing the continuous dynamics, in the absence of impulses, are not ISS/iISS, impulses can successfully stabilize the system in the ISS/ iISS sense, provided that there are no overly long intervals between impulses.
••
TL;DR: These pseudospectral methods can be written equivalently in either a differential or an implicit integral form and it is shown that the map @f:[-1,+1)->[0,+~) can be tuned to improve the quality of the discrete approximation.
••
TL;DR: A new design methodology is proposed that simplifies the design of formation control laws with delayed communication for this class of under-actuated systems and achieves global results in terms of the position and removes the requirement of the linear-velocity measurements.
••
TL;DR: The free-connection weighting matrix method is proposed to obtain a less conservative stability criterion of Markovian jump systems with partly known transition probability or completely unknown transition probability, and a sufficient condition for the state feedback controller design is derived in terms of linear matrix inequalities.
••
TL;DR: In this paper, the authors consider continuous-time average consensus dynamics in which the agents' states are communicated through uniform quantizers and prove that solutions to the resulting system are defined in the Krasowskii sense and converge to conditions of practical consensus.
••
[...]
TL;DR: In this paper, a consensus-based protocol, referred to as Average TimeSync (ATS), is proposed for synchronizing the clocks of a wireless sensor network based on a cascade of two consensus algorithms, whose main task is to average local information.
••
TL;DR: B bipartite, first-order networks where the nodes take on leader or follower roles are studied, and LaSalle's Invariance Principle is used for switched systems, and the result is shown to hold for arbitrary state dimensions.
••
TL;DR: A gradient-based algorithm is derived to estimate the parameters of the input-output representation with scarce measurements, and the convergence properties of the parameter estimation and unavailable output estimation are established using the Kronecker lemma and the deterministic version of the martingale convergence theorem.
••
TL;DR: The conditions that guarantee the finite-time consensus for the systems are identified and the signum protocol does not require explicit measurement of time signals from neighbors, and hence has the potential to significantly reduce the requirements for both computation and sensing.
••
TL;DR: This paper shows how different mechanisms may lead to clustering behavior in connected networks consisting of diffusively coupled agents, and presents two other mechanisms under which cluster synchronization might be achieved.
••
TL;DR: A novel Bayesian paradigm for the identification of output error models is applied to the design of optimal predictors and discrete-time models based on prediction error minimization by interpreting the predictor impulse responses as realizations of Gaussian processes.
••
TL;DR: It is shown that security and privacy of computer systems and communication protocols can be investigated in terms of opacity, and three important properties of discrete event systems, namely observability, diagnosability, and detectability, can all be reformulated as opacity.