Search

This paper is concerned with consensus of heterogeneous nonlinear multiagent systems via distributed control. Both the cases of leaderless and leader-following are systematically investigated. Different from some existing results, completed consensus can be reached in this paper among heterogeneous multiagent network instead of bounded-consensus. First, a novel distributed control protocol is proposed, and some general consensus criterions are derived for multiagent systems without leader. Second, a leader with unknown but bounded input for the heterogeneous multiagent network is considered; aperiodically intermittent communications among followers are considered to avoid channel blocking in this case. Finally, two simulation examples are presented to verify the effectiveness of the main results. [ABSTRACT FROM AUTHOR]

The existing results on consensus of multiagent systems are mainly based on homogeneous systems; that is, all agents have the same dynamic model. This paper focuses on consensus of heterogeneous multiagent systems, which consist of first-order and second-order integrator agents. Based on integral sliding mode control, the consensus protocols of heterogeneous multiagent systems with disturbances are investigated under the directed networks. Some sufficient conditions for finite-time consensus are obtained by utilizing Lyapunov stability theory. Finally, some examples verify the effectiveness of the proposed control schemes. [ABSTRACT FROM AUTHOR]

For task planning of the command and control structure, the existing algorithms exhibit low efficiency and poor replanning quality under abnormal conditions. Given the requirements of the current accusation architecture, a distributed command and control structure model is built in this paper based on multiagents, which exploits the superiority of multiagents in achieving complex tasks. The concept of MultiAgent-HTN is proposed based on the framework. The original hierarchical task network planning algorithm is optimized, the multiagent collaboration framework is redefined, and the coordination mechanism of local conflict is developed. With the classical resource scheduling problem as the experimental background, the proposed algorithm compared with the classical HTN algorithm is drawn. According to the experimental results, the proposed algorithm exhibits higher quality and higher efficiency than the existing algorithm and the space anomaly is significant in the course of processing. The planning is more efficient and the time is more complicated and superior in solving the same problem, and the algorithm exhibits good convergence and adaptability. In the conclusion, it is proved that the distributed command and control structure proposed in this paper exhibits high practicability in relevant fields and can solve the problem of distributed command and control structure in a multiagent scenario. [ABSTRACT FROM AUTHOR]

In this paper, an off-policy model-free algorithm is presented for solving the cooperative optimal output regulation problem for linear discrete-time multi-agent systems. First, an adaptive distributed observer is designed for each follower to estimate the leader's information. Then, a distributed feedback-feedforward controller is developed for each follower to solve the cooperative optimal output regulation problem utilizing the follower's state information and the adaptive distributed observer. Based on the reinforcement learning method, an adaptive algorithm is presented to find the optimal feedback gains via online data collection from system trajectory. By designing a Sylvester map, the solution to the regulator equations is calculated via data collected from the optimal feedback gain design steps, and the feedforward control gain is found. Finally, an off-policy model-free algorithm is proposed to design the distributed feedback-feedforward controller for each follower to solve the cooperative optimal output regulation problem. A numerical example is given to verify the effectiveness of this proposed approach. [ABSTRACT FROM AUTHOR]

Risk is an important factor affecting the success of complex equipment research and manufacturing, so how to deal with the risk properly has become the key to risk management of complex equipment cooperative research and manufacturing. In view of this, considering that the choice of risk response schemes for complex equipment research and manufacturing is a consensus issue of group negotiation, this paper exploits group decision-making and utility theory to establish a risk disposal scheme selection model for complex equipment development based on group negotiation consensus, and then a case verifies the validity and rationality of the proposed model. The results show that the consensus scheme selection problem proposed in the paper effectively combines the preference value and utility, considers the supplier's risk preference behavior, and achieves the multisubject consensus scheme. [ABSTRACT FROM AUTHOR]

This paper investigates the problem of leader-following or leaderless couple-group consensus of heterogeneous multiagent systems (HMASs) with cooperative-competitive interaction, asynchronous switching, and controller faults. Some novel protocols have been proposed to solve the couple-group consensus of the two kinds of HMASs. Compared with the existing results, asynchronous control, controller faults, leaders, and the competitive-cooperative interaction are all considered in these novel protocols. By using linear matrix inequality, graph theory, Lyapunov functional theory, and model-dependent dwell time technique (MDADT), some sufficient conditions have been gained for the leader-following or leaderless couple-group consensus of these systems. The obtained results show that the couple-group consensus of HMASs can be transformed into determining the stability of the related switching linear system. These results can also be applied to HMASs with weakly connected topology without satisfying the demand of in-degree balance, strong connectivity, or containing a spanning tree. Some simulation experiments are given to prove the validity of the obtained results. [ABSTRACT FROM AUTHOR]

In this paper, a neighbour-based control algorithm of group consensus is designed for a class of hybrid-based heterogeneous multiagent systems with communication time delay. We consider the statics leaders and active leaders, respectively. The original systems are transformed into new error systems by transformation. On the basis of the systems, applying Lyapunov stability theory and adopting the linear matrix inequality method, sufficient conditions which guarantee the heterogeneous multiagent systems stability are obtained. To illustrate the validity of theoretical results, some numerical simulations are given at the end of the paper. [ABSTRACT FROM AUTHOR]

This paper investigates robust consensus for nonlinear multiagent systems with uncertainty and disturbance. The consensus evolution behavior is studied under general consensus protocol when each node is disturbed by the relative states between the node and its neighbors. At first, the robust consensus condition is obtained and the convergency analysis is given by using Lyapunov stability theory and matrix theory. Then, the practical consensus is investigated and the bound of the error states is presented. Finally, two numerical simulation examples are given to illustrate the proposed theoretical results. [ABSTRACT FROM AUTHOR]

Most of the current algorithms for solving distributed online optimization problems are based on the first-order method, which are simple in computation but slow in convergence. Newton's algorithm with fast convergence speed needs to calculate the Hessian matrix and its inverse, leading to computationally complex. A distributed online optimization algorithm based on Newton's step is proposed in this paper, which constructs a positive definite matrix by using the first-order information of the objective function to replace the inverse of the Hessian matrix in Newton's method. The convergence of the algorithm is proved theoretically and the regret bound of the algorithm is obtained. Finally, numerical experiments are used to verify the feasibility and efficiency of the proposed algorithm. The experimental results show that the proposed algorithm has an efficient performance on practical problems, compared to several existing gradient descent algorithms. [ABSTRACT FROM AUTHOR]

The development of power energy structures and information communication technology has promoted the renewal of smart grid information-physical structures. At the same time, the changes in the smart grid energy structure and the vulnerability of the information network threaten the stability of the power system and uses multiagent control theory to improve the transient stability of the power grid which has strong practicability. In this paper, an optimized distributed control scheme is proposed for application to the smart grid model so that the grid system can flexibly adapt to the external operating conditions and recover to stable operating conditions after being disturbed. In this paper, an intelligent power grid information-physical network simulation system is established. According to the information exchange within the multiagent system, groups of coherent generators in the disturbed power grid in different regions are identified and controlled. Distributed control is applied to maintain the exponential frequency synchronization and phase angle aggregation of the synchronous generators to achieve transient stability. Finally, the effectiveness and rapidity of the proposed distributed optimal control scheme are verified by simulation analysis of the IEEE 39 node model. [ABSTRACT FROM AUTHOR]

In this paper, multiagent tracking control problem of second-order multiagent systems with unknown leader acceleration, input saturation, and matched and unmatched disturbances is investigated. An auxiliary system is constructed to approximate system position states, and a novel sliding mode disturbance observer is designed to estimate matched and unmatched uncertainties. A sliding mode disturbance observer-based control protocol is proposed by constructing a novel sliding mode manifold based on the sliding mode disturbance observer outputs. In addition, the input saturation and the unknown leader acceleration become a part of lumped uncertainties by using mathematic transformation. The lumped uncertainties estimated by the sliding mode disturbance observer are compensated by the sliding mode disturbance observer-based control protocol. Stability of the second-order multiagent systems is guaranteed via Lyapunov method. Finally, a simulation example is proposed to exhibit advantages and availability of the developed techniques. [ABSTRACT FROM AUTHOR]

The multiagent system has the advantages of simple structure, strong function, and cost saving, which has received wide attention from different fields. Consensus is the most basic problem in multiagent systems. In this paper, firstly, the problem of partial component consensus in the first-order linear discrete-time multiagent systems with the directed network topology is discussed. Via designing an appropriate pinning control protocol, the corresponding error system is analyzed by using the matrix theory and the partial stability theory. Secondly, a sufficient condition is given to realize partial component consensus in multiagent systems. Finally, the numerical simulations are given to illustrate the theoretical results. [ABSTRACT FROM AUTHOR]

In this paper, the consensus problem is investigated for a distributed multiagent system (MAS), where the consensus is characterized by curvature function and torsion function. According to the Frenet-Serret formulas, a distributed consensus protocol is designed for the tangent, normal, and binormal unit vectors of trajectory of each agent, and then it gets a closed-loop system. Based on the Lyapunov function, several sufficient conditions for consensus are derived for the closed-loop system. Also the consensus problem of multiagent system on a surface is studied. Finally, the numerical examples show the reliability of the proposed methods. [ABSTRACT FROM AUTHOR]

Heterogeneity is an important feature of multiagent systems. This paper addresses the consensus problem of heterogeneous multiagent systems composed of first-integrator and double-integrator agents. The dynamics of each agent switches between continuous-time and discrete-time dynamics. By using the graph theory and nonnegative matrix theory, we derive that the system can achieve consensus if and only if the fixed interaction topology has a directed spanning tree. For switching topologies, we get that the system can reach consensus if each interaction topology has a directed spanning tree. Simulation examples are provided to demonstrate the effectiveness of our theoretical results. [ABSTRACT FROM AUTHOR]

This paper studies bipartite consensus for first-order multiagent systems. To improve resource utilization, event-based protocols are considered for bipartite consensus. A new type of control gain is designed in the proposed protocols. By appropriate selection of control gains, the convergence rate of the closed-loop system can be adjusted. Firstly, for structural balance case, necessary and sufficient conditions are given on communication relations and consensus gains to achieve bipartite consensus. Secondly, for structural unbalance case, necessary and sufficient conditions are proposed to ensure the stabilizing of the system. It can be found that the system will not show Zeno behavior. Numerical simulations are used to demonstrate the theoretical results. [ABSTRACT FROM AUTHOR]

In this paper, the optimal topology structure is studied for hybrid-weighted leader-follower multiagent systems (MASs). The results are developed by taking advantage of linear quadratic regulator (LQR) theory. We show that the multiagent star composite structure is the optimal topology which can enable the MAS to achieve the bipartite consensus. In particular, we prove that the optimal topology corresponding to the multiagent system with the first-order static leader and the second-order dynamic leader is, respectively, a hybrid-weighted star composite structure and an unevenly hybrid-weighted star composite structure. The results of the paper indicate that, in addition to the necessary information communication between leader and followers, the information exchange among followers increases the control cost of the system. [ABSTRACT FROM AUTHOR]

This paper investigates couple-group consensus problems for multiagent first-order and second-order systems. Several consensus protocols are proposed based on the time-dependent distributed event-triggered control. For the case of no communication delays, the time-dependent event-triggered strategies are applied to couple-group consensus problems. Based on the matrix theory, algebraic conditions for couple-group consensus are established. For the system with communication delays, based on event-triggered strategies, a Lyapunov-Krasovskii functional is constructed to prove the input-to-state stability of the systems. Moreover, Zeno behavior is excluded. Finally, numeral examples are given to illustrate the effectiveness of these results. [ABSTRACT FROM AUTHOR]

Open source design (OSD) is an emerging cluster design mode based on Internet, and it takes full advantage of knowledge, technology, and resources among designers to promote product development. In this mode, designers’ behaviors of collaboration have important influence on product development process. In this paper, firstly collaboration flow including two types of collaboration relations between designers in open source design is depicted. Secondly, two-phase collaborative behavior model including partner selection and response is built by means of utility functions. At last, simulation experiment including 4 scenarios is designed based on open source project of mobile phone and conducted by multiagent simulation, and contrastive analysis is carried out to study collaboration behaviors’ impact on open source design process. The results show that the two-phase collaborative behavior model elaborately describes structure evolution of Open Source Community (OSC) as well as designers’ collaboration behaviors and that different ways of partner selection behaviors have significant impact on the evolution of OSD process as well as OSC structure. Furthermore, the results suggest that designers should better consider more the factor of matching degree between designers but less collaboration record. [ABSTRACT FROM AUTHOR]

In the process of collaborative procurement, buyers and suppliers are prone to conflict in cooperation due to differences in needs and preferences. Negotiation is a crucial way to resolve the conflict. Aimed at ameliorating the situations of underdeveloped self-adaptive learning effect of current collaborative procurement negotiation, this paper constructs a negotiation model based on multi-agent system and proposes a negotiation optimization strategy combined with machine learning. It provides a novel perspective for the analysis of intelligent SCM. The experimental results suggest that the proposed strategy improves the success rate of self-adaptive learning and joint utility of agents compared with the strategy of single learning machine, and it achieves win-win cooperation between purchasing enterprise and supplier. [ABSTRACT FROM AUTHOR]

This paper proposes a novel approach to design fully distributed consensus controllers for heterogeneous linear Multiagent Systems subjected to randomly switching directed topologies and model uncertainties. The appealing features of this approach are as follows. First, it uses the mildest assumption for the randomly switching topologies that the union of switched graphs has a spanning tree. Second, the consensus is achieved under a class of state multiplicative uncertainties. Moreover, the proposed consensus controllers are low-rank and have nonconservative coupling strengths. Finally, a numerical example is presented to illustrate the effectiveness of the proposed theoretical approach. [ABSTRACT FROM AUTHOR]

This paper investigates the consensus control of a class of high-order nonlinear multiagent systems, whose topology is dynamically switching directed graph. First, the high-order nonlinear dynamics is transformed into the one-order dynamics by structuring a sliding mode plane; then, two consensus control protocols of the one-order dynamics are designed by feedback linearization, one of which is based on PD (proportion and derivative) and the other is based on PID (proportion, integral and derivative). Under these control protocols, it is proved that the consensus of new variable only requires a weaker topology condition; next, we prove that the consensus of the new variable is sufficient to the consensus of the states of multiagent systems, which implies that it only requires a weaker topology condition for the consensus of multiagent systems; finally, the study of an illustrative example with simulations shows that our results as well as designed control protocols work very well in studying the consensus of this class of multiagent systems. [ABSTRACT FROM AUTHOR]

This paper is devoted to the consensus problems for a fractional-order multiagent system (FOMAS) with double integral and time delay, the dynamics of which are double-integrator fractional-order model, where there are two state variables in each agent. The consensus problems are investigated for two types of the double-integrator FOMAS with time delay: the double-integrator FOMAS with time delay whose network topology is undirected topology and the double-integrator FOMAS with time delay whose network topology is directed topology with a spanning tree in this paper. Based on graph theory, Laplace transform, and frequency-domain theory of the fractional-order operator, two maximum tolerable delays are obtained to ensure that the two types of the double-integrator FOMAS with time delay can asymptotically reach consensus. Furthermore, it is proven that the results are also suitable for integer-order dynamical model. Finally, the relationship between the speed of convergence and time delay is revealed, and simulation results are presented as a proof of concept. [ABSTRACT FROM AUTHOR]

This paper investigates the consensus problem for the distributed multiagent system (MAS), where the trajectory of each agent is displayed by curvature and torsion, and the communication behaviors among agents are influenced by time delay and corrupted by noises. According to the Frenet–Serret formulas, a class of consensus protocols is designed for all agents, and a closed-loop system is obtained. Based on the Lyapunov method, several consensus criteria are derived, where the consensus criteria are characterized by curvature functions and torsion functions. Finally, one example shows the reliability of the proposed methods. [ABSTRACT FROM AUTHOR]

This paper investigates the consensus problem of the distributed multiagent system (MAS) with the small-world framework. A distributed consensus protocol is provided for the node-to-node communication. According to an error between every two neighbor agents, several consensus criteria among the agents are obtained firstly. Then, consensus criteria are obtained via the diameter of the graph of the MAS. Finally, based on the small-world framework, the consensus criteria are obtained; also, the relations among the consensus, the diameter of the path in the small-world framework, and the errors of agents are disclosed. Finally, one numerical example shows the reliability of the proposed methods. [ABSTRACT FROM AUTHOR]

Adaptive tracking control for distributed multiagent systems in nonaffine form is considered in this paper. Each follower agent is modeled by a nonlinear pure-feedback system with nonaffine form, and a nonlinear system is unknown functions rather than constants. Radial basis function neural networks (NNs) are employed to approximate the unknown nonlinear functions, and weights of NNs are updated by adaptive law in finite-time form. Then, the adaptive finite NN approach and backstepping technology are combined to construct the consensus tracking control protocol. Numerical simulation is presented to demonstrate the efficacy of suggested control proposal. [ABSTRACT FROM AUTHOR]

Compared with single consensus, the multiconsensus of multiagent systems with nonlinear dynamics can reflect some real-world cases. This paper proposes a novel distributed law based only on intermittent relative information to achieve the multiconsensus. By constructing an appropriate Lyapunov function, sufficient conditions on control parameters are derived to undertake the reliability of closed-loop dynamics. Ultimately, the availability of results is completely validated by these numerical examples. [ABSTRACT FROM AUTHOR]

This paper deals with the leader-following output consensus problem for a class of high-order affine nonlinear strict-feedback multiagent systems with unknown control gains and input saturation under a general directed graph. Nussbaum gain function technique is used to handle the unknown control gains, and the uncertain nonlinear dynamics of each agent is approximated by radial basis function neural networks. Distributed adaptive controllers are designed via the backstepping technique as well as the dynamic surface control approach. It is proved that the closed-loop multiagent systems are semiglobally uniformly ultimately bounded, and the output consensus error can converge to a small region around the origin. Finally, the theoretical results are supported by a numerical simulation. [ABSTRACT FROM AUTHOR]

This paper investigates the distributed finite-time event-triggered bipartite consensus control for multiagent systems over antagonistic networks. Under the constraint of energy conservation, a distributed nonlinear finite-time control protocol only depending upon local information is proposed coupled with event-triggered strategies, where controllers of agents at triggered instants are only updated to reduce the computation. It is proved that when the antagonistic network is structurally balanced with a spanning tree, a necessary and sufficient condition is established to guarantee all agents to reach consensus values with identical magnitude but opposite signs. More interestingly, the settling time depending on the initial state is obtained over the whole process. Comparing to asymptotic control algorithms, the proposed control method has better disturbance rejection properties and convergence rate. Simulations are given to demonstrate the effectiveness of the theoretical results. [ABSTRACT FROM AUTHOR]

This paper investigates the event-triggered containment control problem of a class of uncertain nonlinear multiagent systems (MASs). By employing the local relative information, we design an adaptive event-triggered containment algorithm. The proposed containment algorithm can cope with the unavailability of global topology information and uncertain dynamics of follower agents. Therefore, the presented containment algorithm is free of global topology information, i.e., the designed algorithm is fully distributed. In addition, it is proved that Zeno behavior will not occur. At last, a numerical example is given to verify our event-triggered containment algorithm. [ABSTRACT FROM AUTHOR]

Multiagent systems are used in artificial intelligence, control theory, and social sciences. In this article, we studied a Cucker–Smale model with a continuous non-Lipschitz protocol. The methodology presented in the current paper is based on the explicit construction of a Lyapunov functional. By using the fixed-time control technology, we show that the flocking can occur in fixed-time and collision avoiding when a singular communication function with a weighted sum of sign functions of the relative velocities among agents, and we can obtain the estimation of the converging time which is independent of the initial states of agents. Theoretical results are supported by numerical simulations. [ABSTRACT FROM AUTHOR]

This paper investigates the flocking problem of multi-agents with partial information exchange, which means that only part, but not all, of the agents are informed of the group objective. A distributed flocking model based on the inclusion principle is provided to simplify the design and analysis of multi-agent systems. Furthermore, to reduce the communication energy consumption, an improved flocking algorithm based on the model is proposed to achieve stable flocking for all the agents. The stability of the multi-agent system is then established, with the help of the Lyapunov stability theorem and LaSalle's invariance principle. Especially, considering the individual heterogeneity in both nature and engineering applications, we also investigate the flocking problem of multi-agents with different sensing radiuses and equilibrium distances. Finally, two kinds of simulation results are presented to demonstrate the validity of the proposed results. This work provides an insight not only into the properties of the different species of individual flocking, but also into the theoretical framework for the engineering design of multi-agent systems considering individual heterogeneity. [ABSTRACT FROM AUTHOR]

This study addresses one of the most essential distributed control problems in multiagent systems, called the average consensus issue, using a new event-triggered sampling control perspective. Although the continuous-time sampling for average consensus has provided good results currently, a systematic investigation into the continuous-time agent dynamics with sampled-data control inputs under an event-triggered mechanism is critically lacking. The problem considered in this paper can be formulated into an average consensus problem of hybrid systems. The method considers three types of control schemes, among which periodic sampling is integrant. The first scheme is a classical sampling controller reinvestigated through a lemma. The second scheme realizes aperiodic control update as well as periodic communication, while the third scheme achieves both aspects aperiodically. Corresponding sufficient conditions of the aforementioned three schemes are derived such that the asymptotic stability of systems is ensured by using algebraic graph theory, matrix analysis, and Lyapunov theory. The constraints for the allowed sampling period, event parameter, and maximum eigenvalue of graph Laplacian are explicitly derived. Moreover, the potential Zeno behavior of agents due to the sampling control theory is avoided. Thus, a digitally implementable technique is provided. Finally, some numerical examples are provided to verify the effectiveness of the proposed theoretical analysis. [ABSTRACT FROM AUTHOR]

This paper considers the problem of consensus control for a class of nonlinear multiagent systems with incremental quadratic constraints and time delays. Each agent exchanges state information through a strongly connected communication topology. Based on the information obtained from neighboring agents, a distributed consensus protocol is designed. A delay-independent consensus condition is formed for the protocol to solve the consensus problem by employing Lyapunov–Krasovskii functional method. In order to deal with the nonlinear terms in matrix inequalities, an iterative algorithm is proposed by using the Schur complement lemma and the cone complementary linearization method. The nonlinearities under consideration are more general than many other nonlinearities considered in related literature studies since the incremental quadratic constraints include many other known nonlinearities as some special cases. Finally, we give a numerical example to illustrate the effectiveness of the proposed consensus control protocol. [ABSTRACT FROM AUTHOR]

With the development of communication technology, distributed cooperative controls of multiagent systems (MAS) have been applied in many fields. Based on the communication between the agents, multiple individual systems are composed of a distributed network. Since the function of the agents is different, the distributed network can be divided into many parts. For first-order/second-order dynamic MAS, group cooperation algorithms with the competition mechanism are proposed in this paper. By applying modern control theory and homogeneous theory, finite-time stabilities for the cooperation motion of dynamic MAS are analyzed. By studying the dynamic properties of agents, finite-time group consensus of distributed MAS based on directed topology is obtained. Finally, the system simulation results are given to illustrate the effectiveness of the conclusion. [ABSTRACT FROM AUTHOR]

Underthe background of the new era, the architectural environment design is constantly changing. Architectural environment design is to beautify the environment and provide people with a pleasant architectural environment. No matter what time, beauty is the eternal theme and the pursuit of people. Structural bionic design is based on the natural prototype, which is transformed into understandable digital or technical models by extracting relevant structural and behavioral features as design elements. The application of this design technique in architectural devices not only has strong structural logic but also artistic beauty, and can form novel spatial form and structural form of architectural devices. By analyzing the present situation and existing problems of theoretical research and simulation experiment of multiagent system, the necessity of designing a multiagent system planning algorithm and developing distributed real-time simulation experiment system is pointed out. A good environmental art design scheme can be designed in many different styles, and the performance of the design renderings will also appear in different pictures. The really chosen design scheme depends on the designer's conception theme and then look at the performance of the renderings. In recent years, the emergence of multiagent has had a great impact on building environment design. Multiagent technology is a comprehensive information technology that integrates artificial intelligence, network, digital, and other technologies. [ABSTRACT FROM AUTHOR]

Nearly all applications in multiagent systems demand precision, robustness, consistency, and rapid convergence in designing of distributed consensus algorithms. Keeping this thing in our sight, this research suggests a robust consensus protocol for distributed multiagent networks, continuing asynchronous communications, where agent’s states values are updated at diverse interval of time. This paper presents an asynchronous communication for both reliable and unreliable network topologies. The primary goal is to delineate local control inputs to attain time synchronization by processing the update information received by the agents associated in a communication topology. Additionally in order to accomplish the robust convergence, modelling of convergence analysis is conceded by commissioning the basic principles of graph and matrix theory alongside the suitable lemmas. Moreover, statistical examples presenting four diverse scenarios are provided in the end; produced results are the recognisable indicator to authenticate the robust effectiveness of the proposed algorithm. Likewise, a simulation comparison of the projected algorithm with the other existing approaches is conducted, considering different performance parameters are being carried out to support our claim. [ABSTRACT FROM AUTHOR]

Due to the complex external environment, many multiagent systems cannot be precisely described or even cannot be described by an integer-order dynamical model and can only be described by a fractional-order dynamical model. In this paper, consensus problems are investigated for two types of fractional-order multiagent systems (FOMASs) with nonuniform time delays: FOMAS with symmetric time delays and undirected topology and FOMAS with asymmetric time delays and directed topology. Employing the Laplace transform and the frequency-domain theory, two delay margins are obtained to guarantee the consensus for the two types of FOMAS, respectively. These results are also suitable for the integer-order dynamical model. Finally, simulation results are provided to illustrate the effectiveness of our theoretical results. [ABSTRACT FROM AUTHOR]

This paper focuses on the consensus problem of high-order heterogeneous multiagent systems with arbitrarily bounded communication delays. Through the method of nonnegative matrices, we get a sufficient consensus condition for the systems with dynamically changing topology. The results of this paper show, even when there are arbitrarily bounded communication delays in the systems, all agents can reach a consensus no matter whether there are spanning trees for the corresponding communication graphs at any time. [ABSTRACT FROM AUTHOR]

In this paper, the containment control of heterogeneous MASs with multi-interactional leaders is addressed. The objective of the containment control is of two layers. The leaders converge to an expected form; subsequently, the followers enter the convex hull spanned by the leader's final position. To achieve the goal, the dynamics of the leaders and the followers are modeled by a single integrator and a double integrator, respectively. A reduced-order transformation is employed to obtain the sufficient conditions for realizing the follower agents' control. In this manner, the maximum allowed time delay is given. Moreover, based on the topological structure and matrix, it confirms that the followers are able to enter the expected convex hull. Finally, the numerical simulation reveals the effectiveness of the control strategy. [ABSTRACT FROM AUTHOR]

In a multiagent system (MAS), communication signals are affected by harsh wireless networks when they are transmitted from an agent to its neighboring agents, leading to the inconsistency of the MAS. In this paper, an average-iterative learning control (average-ILC) method is studied to address the consensus problem of MAS over wireless networks in the presence of channel noise and data dropout. The combined effects of channel noise and data dropout on iterative learning controllers are carefully analyzed. Based on graph theory and mathematical expectation, the corresponding average-iterative learning scheme is proposed. Especially, a sufficient condition is derived for the average-iterative learning scheme. Rigorous theoretical analysis demonstrates that the convergence of the covariance matrix of tracking error can be guaranteed with the help of an average-iterative learning scheme. Finally, simulation results are given to show the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

This paper evaluates the project risks with a multidimensional and interactive model from multiagent and utility combination, which takes subjective psychological negative utility into account rather than only focusing on the thinking pattern of objective value loss. Firstly, it analyzes the bodies’ heterogeneous preference and their game behavior using game theory application methods. Secondly, it builds multidimensional and interactive evaluation model of large-scale infrastructure project from many dimensions, such as risk rate, objective utility, and subjective utility. It reflects different values and behavior strategy interdynamic factor in the design of risk utility function. Lastly, it deduces process and approaches of multidimensional and interactive evaluation by typical project. In addition, it tests model parameter with regression analysis. The research of this paper broadens the dimension of project risk evaluation and provides comprehensive and balanced reference for the measure of project risk utility and a better basis for project risk control. [ABSTRACT FROM AUTHOR]

This paper solves control problems of agents achieving consensus motions in presence of nonuniform time delays by obtaining the maximal tolerable delay value. Two types of consensus motions are considered: the rectilinear motion and the rotational motion. Unlike former results, this paper has remarkably reduced conservativeness of the consensus conditions provided in such form: for each system, if all the nonuniform time delays are bounded by the maximal tolerable delay value which is referred to as “delay margin,” the system will achieve consensus motion; otherwise, if all the delays exceed the delay margin, the system will be unstable. When discussing the system which is intended to achieve rotational consensus motion, an expanded system whose state variables are real numbers (those of the original system are complex numbers) is introduced, and corresponding consensus condition is given also in the form of delay margin. Numerical examples are provided to illustrate the results. [ABSTRACT FROM AUTHOR]

This paper focuses on the periodic event-triggered consensus problem for multiagent systems under undirected graph. In the periodic event-triggered control, the event condition is tested only periodically to decide when to exert the control behaviors and when to broadcast the sampling data. Two sets of event-triggered strategies combining with sampled-data control are designed based on an exponential decay function and a quadratic Lyapunov function, respectively. Some useful theorems for these two periodic event-triggered strategies about the choice of period are derived to guarantee the asymptotical stability of the closed-loop multiagent systems. In addition, this paper gives a sufficient condition about the bounds of communication delay for the multiagent systems. It is rigorously proved that the overall system will achieve the consensus under the proposed strategy if the period and time delay satisfy the theorems. Finally, we extend these solutions to general linear dynamical systems. Simulation results are presented to show the effectiveness. [ABSTRACT FROM AUTHOR]

Finite-time consensus problems for networked multiagent systems with first-order/second-order dynamics are investigated in this paper. The goal of this paper is to design local information based control protocols such that the systems achieve consensus at any preset time. In order to realize this objective, a class of linear feedback control protocols with time-varying gains is introduced. We prove that the multiagent systems under such kinds of time-varying control protocols can achieve consensus at the preset time if the undirected communication graph is connected. Numerical simulations are presented to illustrate the effectiveness of the obtained theoretic results. [ABSTRACT FROM AUTHOR]

This paper investigates the consensus problem of high-order continuous-time linear multiagent systems (LMASs) with multitype switching topologies which include both consensusable and unconsensusable communication topologies. A linear transformation is introduced, which equivalently transforms the consensus problem into the stability problem of a corresponding switched system, along with a necessary and sufficient condition to analyze the consensus problem. This paper is aimed at studying the impact of a switching rule on communication topologies for consensus of LMASs. Based on the dynamic dwell time method, a sufficient condition is derived for consensus of LMASs. It is shown that, with switching signals that satisfy this switching rule, LMASs can achieve consensus under directed switching communication topologies. A numerical example is provided to illustrate the effectiveness of the theoretical results. [ABSTRACT FROM AUTHOR]

This paper investigates the controllability of discrete-time leader-follower multiagent systems (MASs) with two-time-scale and heterogeneous features, motivated by the fact that many real systems are operating in discrete-time. In this study, singularly perturbed difference systems are used to model the two-time-scale heterogeneous discrete-time MASs. To avoid the ill-posedness problem caused by the singular perturbation parameter when using the classical control theory to study the model, the singular perturbation method was first applied to decompose the system into two subsystems with slow-time-scale and fast-time-scale feature. Then, from the perspective of algebra and graph theory, several easier-to-use controllability criteria for the related MASs are proposed. Finally, the effectiveness of the main results is verified by simulation. [ABSTRACT FROM AUTHOR]

A method of detecting water vapor on boundary layer based on multiagent system is proposed in this paper. Multiagent system receives electromagnetic signals emitted by the telecommunication base station. Due to the analysis of the actual electromagnetic wave signal propagation path in the atmosphere, atmospheric refraction index and moisture inversion are discussed in this paper. And the feasibility of using electromagnetic detection method is also analyzed. A multiagent system is designed to receive the electromagnetic signals. The composition and function of the multiagent system are clearly described. The atmospheric refractivity is detected by the multiagent system in three weather conditions of sunny, foggy, and rainy days. The results demonstrate the feasibility of water vapor detection method of multiagent system boundary by comparing the result of experiment with traditional method. [ABSTRACT FROM AUTHOR]

Consensus of first-order and second-order multiagent systems has been wildly studied. However, the convergence of high-order (especially the third-order to the sixth-order) state variables is also ubiquitous in various fields. The paper handles consensus problems of high-order multiagent systems in the presence of multiple time delays. Obtained by a novel frequency domain approach which properly resolves the challenges associated with nonuniform time delays, the consensus conditions for the first-order and second-order systems are proven to be nonconservative, and those for the third-order to the sixth-order systems are provided in the form of simple inequalities. The method revealed in this article is applicable to arbitrary-order systems, and the results are less conservative than those based on Lyapunov approaches, because it roots in sufficient and necessary criteria of stabilities. Simulations are carried out to validate the theoretical results. [ABSTRACT FROM AUTHOR]

In this paper, we consider the consensus problem of high-order multiagent systems on both fixed and switching interaction topologies with time delays. A neighbor-based protocol is presented, under which we prove that the state errors converge to zero asymptotically if there is a solution to a given Riccati inequality. The proof of our theorem is shown in time domain based on a Lyapunov approach. A numerical example is introduced to indicate the correctness of our analysis. [ABSTRACT FROM AUTHOR]