• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.3
• /
• pp.625-631
• /
• 2011

This paper presents a discrete-time output feedback consensus algorithm for Multi-Agent Systems (MAS). Under the assumption that an agent is aware of the relative state information about its neighbors, a state feedback consensus algorithm is designed based on Linear Matrix Inequality (LMI) method. In general, however, it is possible to obtain its relative output information rather than the relative state information. To reconcile this problem, an Unknown Input Observer (UIO) is employed in this paper. To this end, first it is shown that the relative state information can be estimated using the UIO and the measured relative output information. Then a certainty-equivalence type output feedback consensus algorithm is proposed by combining the LMI-based state feedback consensus algorithm with the UIO. Finally, simulation results are given to illustrate that the proposed method successfully achieves the state consensus.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.5
• /
• pp.390-397
• /
• 2013

This paper presents a consensus algorithm for uMAS (uncertain Multi-Agent Systems). Unlike previous results in which only nominal models for agents are considered, it is assumed that the uncertain agent model belongs to a known polytope set. In the middle of deriving the proposed algorithm, a convex set is found which includes all uncertainties in the problem using convexity of the polytope set. This set plays an important role in designing the consensus algorithm for uMAS. Based on the set, a consensus condition for uMAS is proposed and the corresponding consensus design problem is solved using LMI (Linear Matrix Inequality). Simulation result shows that the proposed consensus algorithm successfully leads to consensus of the state of uMAS.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.7
• /
• pp.617-621
• /
• 2012

This paper studies asymptotic consensus problem for linear multi-agent systems. We propose a distributed state feedback control algorithm for solving the problem under fixed and undirected network communication. In contrast with the conventional algorithms that use global information (e.g., graph connectivity), the proposed algorithm only uses local information from neighbors. The principle for achieving asymptotic consensus is that, for each agent, a distributed update law gradually increases the coupling gain of LQR-type feedback and thus, the overall stability of the multi-agent system is recovered by the gain margin of LQR.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.5
• /
• pp.526-532
• /
• 2014

In this paper, we present and analyze a LQ (Linear Quadratic) inverse optimal state-consensus protocol for continuous-time multi-agent systems with undirected graph topology. By Lyapunov analysis of the state-consensus error dynamics, we show the sufficient conditions on the algebraic connectivity of the graph to guarantee LQ inverse optimality and closed-loop stability. A more relaxed stability condition is also provided in terms of the algebraic connectivity. Finally, a formation control protocol for multiple mobile robots is proposed based on the target LQ inverse optimal consensus protocol, and the simulation results are provided to verify the performance of the proposed LQ inverse formation control method.

• Journal of the Institute of Convergence Signal Processing
• /
• v.24 no.2
• /
• pp.103-111
• /
• 2023

Consensus, that aims to converge the states of agents to the same states through information exchanges between agents, has been widely studied to control the multi-agent systems. In real systems, the measurement variables of each agent may be different, the loss of information across communication may occur, and the different networks for each state may need to be constructed for safety. Moreover, the input saturation and the disturbances in the system may cause instability. Therefore, this paper studies the PID(Proportional-Integral-Derivative)-based consensus control to achieve the swarm behavior of the multi-agent systems considering the heterogeneous state information, the input saturations, and the disturbances. Specifically, we consider the multiple follower agents and the single leader agent modeled by the second-order systems, and investigate the conditions to achieve the consensus based on the stability of the error system. It is confirmed that the proposed algorithm can achieve the consensus if only the connectivity of the position graph is guaranteed. Moreover, by extending the consensus algorithm, we study the formation control problem for the multi-agent systems. Finally, the validity of the proposed algorithm was verified through the simulations.

• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.361-366
• /
• 2015

The objective of this paper was to establish the attributes that determines neighbourhood satisfaction in South Africa lowincome housing subsidy scheme ultilising the Delphi approach. This is because the perception and housing satisfaction of lowincome housing beneficiaries toward their housing condition can be studied by examining their satisfaction toward s the neighbourhood factors. The Delphi method was used where the views of housing experts were solicited on 26 potential attributes as identified from li terature. Consensus was achieved after three iterative rounds. The expert"s scored each attributes on a 10-point ordinal scale of impact significance, where 1-2=No impact and 9-10= very high impact. The scales adapted for consensus were: strong consensus, median 9-10, inter quartile deviation (IQD) ≤1; good consensus, median 7 ≤ 6.99and IQD≥2.1≤3. The key findings indicate that there was a good to strong consensus of 19 attributes which were key attributes that the experts perceived as determinants of neighbourhood satisfaction; while 6 other attributes had weak consensus, as they were considered to have a le sser impact in determining residents" neighbourhood satisfaction. However, attributes with weak consensus were the attributes that are highly regarded as core neighbourhood factors in other housing settings. The study contributes to the body of knowledge on th e subject where no consensus has been reached pertaining to indicators for measuring neighbourhood satisfaction in subsidised low-income housing in South Africa.

• Journal of the Korean Mathematical Society
• /
• v.61 no.3
• /
• pp.565-602
• /
• 2024

We study the collective behaviors of two second-order nonlinear consensus models with a bonding force, namely the Kuramoto model and the Cucker-Smale model with inter-particle bonding force. The proposed models contain feedback control terms which induce collision avoidance and emergent consensus dynamics in a suitable framework. Through the cooperative interplays between feedback controls, initial state configuration tends to an ordered configuration asymptotically under suitable frameworks which are formulated in terms of system parameters and initial configurations. For a two-particle system on the real line, we show that the relative state tends to the preassigned value asymptotically, and we also provide several numerical examples to analyze the possible nonlinear dynamics of the proposed models, and compare them with analytical results.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.9
• /
• pp.857-862
• /
• 2011

This paper studies the output consensus problem for a class of heterogeneous linear multi-agent systems under a fixed directed communication network. The dynamics, as well as its dimension, of each agent can widely differ from the others, but all the agents are assumed to have the same transfer matrix. In addition, only the system outputs are constrained to be delivered through the network. Under these conditions, we show that the output consensus is reached by a group of identical controllers, which is designed to achieve the state consensus for the homogeneous multi-agent system obtained from the minimal realization of the transfer matrix. Finally, an example is given to demonstrate the proposed result.

• Journal of IKEEE
• /
• v.18 no.4
• /
• pp.517-522
• /
• 2014

This paper investigates the consensus problem for linear multi-agent systems with an arbitrary network delay. The sufficient conditions for a state consensus of linear multi-agent systems are provided by using linear matrix inequalities. Moreover, it is shown that under the proposed protocol, the consensus can be achieved even in the presence of an arbitrarily large network delay. Finally, an illustrative example is given in order to show the effectiveness of our design method.

• Journal of Advanced Navigation Technology
• /
• v.26 no.4
• /
• pp.226-234
• /
• 2022

With advances in autonomous vehicles and networked control, there is a growing interest in the consensus control of a multi-agents system to control multi-agents with distributed control beyond the control of a single agent. Since consensus control is a distributed control, it is bound to have delay in a practical system. In addition, it is often difficult to have a very accurate mathematical model for a system. Even though a reinforcement learning (RL) method was developed to deal with these issues, it often experiences slow convergence in the presence of large uncertainties. Thus, we propose a slide RL which combines the sliding mode control with RL to be robust to the uncertainties. The structure of a sliding mode control is introduced to the action in RL while an auxiliary sliding variable is included in the state information. Numerical simulation results show that the slide RL provides comparable performance to the model-based consensus control in the presence of unknown time-varying delay and disturbance while outperforming existing state-of-the-art RL-based consensus algorithms.