Topic
Multi-agent system
About: Multi-agent system is a research topic. Over the lifetime, 27978 publications have been published within this topic receiving 465191 citations. The topic is also known as: multi-agent systems & multiagent system.
Papers published on a yearly basis
Papers
More filters
TL;DR: In this paper, the authors describe an empirical method that defines an agent typology and allocates agents into the different agent types for an entire region, where processes of farm expansion and diversification of farm practices take place.
238 citations
TL;DR: This paper proposes decentralized model predictive control schemes that take into account constraints on the agents' input and show that they guarantee consensus under mild assumptions.
Abstract: In this paper, we address the problem of driving a group of agents towards a consensus point when the agents have a discrete-time single- or double-integrator dynamics and the communication network is time-varying. We propose decentralized model predictive control schemes that take into account constraints on the agents' input and show that they guarantee consensus under mild assumptions. Since the global cost does not decrease monotonically, it cannot be used as a Lyapunov function for proving convergence to consensus. For this reason, our proofs exploit geometric properties of the optimal path followed by individual agents.
237 citations
TL;DR: It is proved that all agents with any initial state can reach output consensus at an optimal solution to the given constrained optimization problem, provided that the graph describing the communication links among agents is undirected and connected.
Abstract: This technical note presents a continuous-time multi-agent system for distributed optimization with an additive objective function composed of individual objective functions subject to bound, equality, and inequality constraints. Each individual objective function is assumed to be convex in the region defined by its local bound constraints only without the need to be globally convex. All agents in the system communicate using a proportional-integral protocol with their output information instead of state information to reduce communication bandwidth. It is proved that all agents with any initial state can reach output consensus at an optimal solution to the given constrained optimization problem, provided that the graph describing the communication links among agents is undirected and connected. It is further proved that the system with only integral protocol is also convergent to the unique optimal solution if each individual objective function is strictly convex. Simulation results are presented to substantiate the theoretical results.
236 citations
TL;DR: It is shown that the no-cycle assumption can be removed if all subsystems of the follower have the same nominal dynamics and by directly making use of the property of the internal model, this technical note provides a more straightforward proof.
Abstract: The cooperative output regulation problem for linear uncertain multi-agent systems was studied in via an internal model approach under the assumption that the information graph of the system contains no cycle. In this technical note, we further show that the no-cycle assumption can be removed if all subsystems of the follower have the same nominal dynamics. Moreover, by directly making use of the property of the internal model, we provide a more straightforward proof than the one in in that we don't need to verify the satisfaction of certain matrix equations.
236 citations
TL;DR: In this paper, a distributed event-triggered algorithm is proposed to solve the multi-agent average consensus problem for networks whose communication topology is described by weight-balanced, strongly connected digraphs, and the resulting network executions provably converge to the average of the initial agents' states exponentially fast.
236 citations