• Journal of IKEEE
• /
• v.20 no.4
• /
• pp.378-384
• /
• 2016

This paper addresses the output feedback consensus problem for high-order integrators under a directed network with a communication delay. In order to solve this problem, the dynamic output feedback controller is proposed. Also, by using Lyapunov-Krasovskii functional, it is shown that the existence of the proposed consensus controller can always be guaranteed even in the presence of an arbitrarily large communication delay.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.67-69
• /
• 2009

This paper deals with the consensus problem for multi-agent linear dynamic systems with parameter uncertainties. All the agents are identical high-order linear systems with parameter uncertainties and their state information is exchanged through a communication network. It is shown that a consensus is achieved if there exists a feasible solution to a set of linear matrix inequalities obtained for a simultaneous stabilization problem for multiple systems. A numerical example is presented to show the effectiveness of the proposed method.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.88-90
• /
• 2009

This paper deals with the consensus problem for multi-agent linear dynamic systems with communication delay. All the agents are identical high-order linear systems and their state information is exchanged through a communication network with constant communication delay. It is shown that a consensus is achieved if there exists a feasible solution to a set of linear matrix inequalities obtained for a simultaneous stabilization problem for multiple systems with delay. A numerical example is presented to show the effectiveness of the proposed method.

• 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.

• Smart Media Journal
• /
• v.12 no.3
• /
• pp.60-67
• /
• 2023

Hyperledger Indy is an open-source implementation of DID, a decentralized identity verification technology. Hyperledger Indy uses the RBFT consensus algorithm, and if there is a lack of consensus with more than a certain number of problem nodes in the pool, data is not added. This problem can be prevented in advance by adding a node, and a node monitoring system was implemented to operate automatically. The node monitoring system continuously checks the status of the pool and automatically adds nodes when there are more than a certain number of problematic nodes to prevent consensus problems from occurring. This proposed method can increase the availability of Hyperledger Indy and is a study that can be referenced in various blockchain services that use consensus algorithms.

• Journal of Information Processing Systems
• /
• v.14 no.1
• /
• pp.101-128
• /
• 2018

Thanks to its potential in many applications, Blockchain has recently been nominated as one of the technologies exciting intense attention. Blockchain has solved the problem of changing the original low-trust centralized ledger held by a single third-party, to a high-trust decentralized form held by different entities, or in other words, verifying nodes. The key contribution of the work of Blockchain is the consensus algorithm, which decides how agreement is made to append a new block between all nodes in the verifying network. Blockchain algorithms can be categorized into two main groups. The first group is proof-based consensus, which requires the nodes joining the verifying network to show that they are more qualified than the others to do the appending work. The second group is voting-based consensus, which requires nodes in the network to exchange their results of verifying a new block or transaction, before making the final decision. In this paper, we present a review of the Blockchain consensus algorithms that have been researched and that are being applied in some well-known applications at this time.

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.4
• /
• pp.243-248
• /
• 2013

In wireless sensor networks, consensus algorithms for dynamic systems may flexibly usable for their data fusion of a sensor network. In this paper, a distributed data fusion filter is implemented using an average consensus based on distributed sensor data, which is composed of some sensor nodes and a sink node to track the mean values of n sensors' data. The consensus filter resolve the problem of data fusion by a distribution Kalman filtering scheme. We showed that the consensus filter has an optimal convergence to decrease of noise propagation and fast tracking ability for input signals. In order to verify for the results of consensus filtering, we showed the output signals of sensor nodes and their filtering results, and then showed the result of the combined signal and the consensus filtering using zeegbee communication.

• 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 Institute of Control, Robotics and Systems
• /
• v.16 no.3
• /
• pp.222-226
• /
• 2010

In this paper we study the consensus problem of SISO (Single-Input Single-Output) linear multi-agent systems under a fixed weighted undirected network communication. The dynamics of each agent can be of any order, while it is constrained to be neutrally stable. Based on a simple root locus argument, we show that the problem at hand is always solvable if the gain and zeros of the dynamic compensator, of which dimension is the same as the number of plant poles on the imaginary axis, are chosen suitably, finally the result is successfully verified by an example.