In this brief, we consider the consensus problem of hybrid multiagent systems. First, system is proposed, which composed continuous-time and discrete-time dynamic agents. Then, three kinds protocols are presented for system. The analysis tool developed in brief based on matrix theory graph theory. With different restrictions sampling period, some necessary sufficient conditions established solving states also obtained under protocols. Finally, simulation examples provided to demonstrate...

This brief deals with the consensus problem in a network of agents cooperative and antagonistic interactions subject to quantization. By employing techniques from nonsmooth analysis, we prove that all can be guaranteed asymptotically reach bipartite for any logarithmic quantizer accuracy under connected structurally balanced topology states converge zero unbalanced topology. In addition, finite-time is considered single-integrator binary quantized information. The simulation results are...

Summary In this paper, we consider the optimal topology for leader‐following consensus problem of continuous‐time and discrete‐time multi‐agent systems based on linear quadratic regulator theory. For first‐order systems, propose a cost function, which is independent interaction graph, find that star topology. second‐order function also constructed, whereas an unevenly weighted The universality these findings means if each follower connected with leader, information exchange between followers...

Summary This paper considers a consensus problem for hybrid multiagent systems, which comprise two groups of agents: group continuous‐time dynamic agents and discrete‐time agents. Firstly, game‐theoretic approach is adopted to model the interactions between To achieve considered cost functions are designed. Moreover, it shown that designed game admits unique Nash equilibrium. Secondly, sufficient/necessary conditions solving established. Thirdly, we find convergence speed system depends on...

Competition is ubiquitous in nature. This paper studies competition phenomena of multi-agent systems consisting three groups agents. In order to achieve maximal influence, the first and second send information third group, which leads competition. First, we formulate this as a noncooperative game are two players. Players decide agents who receive information. Consequently, interaction topology system generated from players' strategies. Therefore, define decided by Nash equilibrium system....

In this paper, we consider the consensus problem of hybrid multi-agent system. First, system is proposed which composed continuous-time and discrete-time dynamic agents. Then, three kinds protocols are presented for The analysis tool developed in paper based on matrix theory graph theory. With different restrictions sampling period, some necessary sufficient conditions established solving states also obtained under protocols. Finally, simulation examples provided to demonstrate effectiveness...

In this paper, we consider the consensus problem of switched multi-agent system composed continuous-time and discrete-time subsystems. By combining classical protocols systems, propose a linear protocol for system. Based on graph theory Lyapunov theory, prove that is solvable under arbitrary switching with undirected connected graph, directed topologies, respectively. Simulation examples are also provided to demonstrate effectiveness theoretical results.

It is typical to assume that there no conflict of interest among leaders. Under such assumption, it known that, for a multi-agent system with two leaders, if the followers' interaction subgraph undirected and connected, then followers will converge convex combination leaders' states linear consensus protocol. In this paper, we introduce between leaders: by choosing k connect with, every leader attempts all himself closer than other. By using graph theory matrix theory, formulate as standard...

In this paper, we consider two optimal topology selection problems of multi-agent systems with leaders - a tracking target and its opponent. First, study how to select given number guided informed-agents (the followers who receive the target's information) in order minimize error. Second, problem selecting minimal under an upper bound constraint Two algorithms are established approximately solve them. Finally, numerical examples worked out on different networks illustrate effectiveness our...

This paper considers optimal control for the first-order multi-agent systems with leaders. Based on linear quadratic regulator theory, we propose a cost function which is independent of interaction graph. For leader-following consensus problem, corresponds to star topology. containment obtained by solving series convex optimization problems. Simulation examples are provided illustrate effectiveness theoretical results.

In this paper, a stochastic optimal model of the exploration exhaustible resources has been established with aim to maximize profit extraction and by assumption that both price reserve resource following geometric Brownian motion. The HJB equation its economics explanation are deduced. Moreover, it is shown equal sum extracted cost shadow rent.

In this paper, the problem that aggregation of opinions for several individuals which are divided into two different subgroups is considered. Firstly, we establish a new model evolution all individual in system. Moreover, it's shown designed game admits unique Nash equilibrium. Secondly, by using matrix theory and theory, obtain sufficient condition consensus with co-evolution over time issues. Finally, simulation examples given to validate effectiveness theoretical results.

Coalescence, as a kind of ubiquitous group behavior in the nature and society, means that agents, companies or other substances keep consensus states act whole. This paper considers coalescence for n rational agents with distinct initial states. Considering rationality intellectuality population, coalescing process is described by bimatrix game which has unique mixed strategy Nash equilibrium solution. Since not an independent stochastic process, it difficult to analyze process. By using...