Consensus Analysis of Multi-agent Discrete-time Systems

This paper deals with consensus robust output regulation of discrete-time linear multi-agent systems under a directed interaction topology. The digraph is assumed to contain a spanning tree. Every agent or subsystem is identical and uncertain, but subsystems have different external disturbances. Based on the internal model and general discrete-time algebraic Riccati equation, a distributed consensus protocol is proposed to solve the regulator problem. A numerical simulation demonstrates the effectiveness of the proposed theoretical results.

show abstract

“…For the closed-loop system (11), the local tracking error e i (k) → 0 as k → ∞, for any initial conditions x i0 ∈ R n , ω 0 ∈ R s .…”

Section: Consensus Protocol and Main Resultsmentioning

confidence: 99%

Consensus robust output regulation of discrete-time linear multi-agent systems

Liang

Zhang

Wang

et al. 2014

IEEE/CAA J. Autom. Sinica

View full text Add to dashboard Cite

show abstract

“…The aggregation of preferences from multiple experts is a well-studied topic in a number of fields such as economic theory (properties of a social choice function under elevation of pairs) [1], social choice theory (preference aggregation from a small subset of critical nodes in social networks) [2], multicriteria decision making (group decision making) [3], machine learning [4] (evolutionary voting in classifier ensembles), multi-agent systems (reaching consensus in high-dimensional linear systems) [5] or computational biology (consensus genetic mapping) [6]. In spite of the above result, it is still possible to compute an aggregated ranking having minimal distance to the global consensus.…”

Section: Introductionmentioning

confidence: 99%

Weighted aggregation of partial rankings using Ant Colony Optimization

et al. 2017

View full text Add to dashboard Cite

The aggregation of preferences (expressed in the form of rankings) from multiple experts is a well-studied topic in a number of fields. The Kemeny ranking problem aims at computing an aggregated ranking having minimal distance to the global consensus. However, it assumes that these rankings will be complete, i.e., all elements are explicitly ranked by the expert. This assumption may not simply hold when, for instance, an expert ranks only the top-K items of interest, thus creating a partial ranking. In this paper we formalize the weighted Kemeny ranking problem for partial rankings, an extension of the Kemeny ranking problem that is able to aggregate partial rankings from multiple experts when only a limited number of relevant elements are explicitly ranked (top-K), and this number may vary from one expert to another (top-K i). Moreover, we introduce two strategies to quantify the weight of each partial ranking. We cast this problem within the realm of combinatorial optimization and lean on the successful Ant Colony Optimization (ACO) metaheuristic algorithm to arrive at high-quality solutions. The proposed approach is evaluated through a real-world scenario and 190 synthetic datasets from www.PrefLib.org. The experimental evidence indicates that the proposed ACO-based solution is capable of significantly

show abstract

“…In addition, the directed information flow among dynamic agents is based on the communication network topology digraph. Compared with the much similar interconnected systems [8][9][10], multiagent systems have advantages of reducing the cost and improving system efficiency as the distributed control protocols only require the information from the agent itself and its neighborhood agents through the communication digraph [11][12][13][14].…”

Section: Introductionmentioning

confidence: 99%

Output Consensus Regulation for State-Unmeasurable Discrete-Time Multiagent Systems with External Disturbances

Jiang

Yang

2015

Mathematical Problems in Engineering

View full text Add to dashboard Cite

This paper deals with the output consensus regulation problem for discrete-time multiagent systems with state-unmeasurable agents and external disturbances under directed communication network topologies. Firstly, the mathematical model for the output consensus problem of discrete-time multiagent systems is deduced and formulated via making matrix transformation. Then, based on state observers, a novel output consensus protocol with dynamic compensator which is used as observer for the exosystem is proposed to solve this problem. Some knowledge of matrix theory and graph theory is introduced to design protocol parameters and the convergence of output consensus errors is proved. Finally, a numerical simulation example is shown to verify the effectiveness of the proposed protocol design.

show abstract

Consensus Analysis of Multi-agent Discrete-time Systems

Cited by 11 publications

References 29 publications

Consensus robust output regulation of discrete-time linear multi-agent systems

Consensus robust output regulation of discrete-time linear multi-agent systems

Weighted aggregation of partial rankings using Ant Colony Optimization

Output Consensus Regulation for State-Unmeasurable Discrete-Time Multiagent Systems with External Disturbances

Contact Info

Product

Resources

About