Distributed Coordination of Multi-agent Networks introduces problems, models, and issues such as collective periodic motion coordination, collective tracking with a dynamic leader, and containment control with multiple leaders, and explores ideas for their solution. Solving these problems extends the existing application domains of multi-agent networks; for example, collective periodic motion coordination is appropriate for applications involving repetitive movements, collective tracking guarantees tracking of a dynamic leader by multiple followers in the presence of reduced interaction and partial measurements, and containment control enables maneuvering of multiple followers by multiple leaders.

Challenges arise when the size of a group of cooperating agents is scaled to hundreds or thousands of members. In domains such as space exploration, military and disaster response, groups of this size (or larger) are required to achieve extremely complex, distributed goals. To effectively and efficiently achieve their goals, members of a group need to cohesively follow a joint course of action while remaining flexible to unforeseen developments in the environment. Coordination of Large-Scale Multiagent Systems provides extensive coverage of the latest research and novel solutions being developed in the field. It describes specific systems, such as SERSE and WIZER, as well as general approaches based on game theory, optimization and other more theoretical frameworks. It will be of interest to researchers in academia and industry, as well as advanced-level students.

Based on a suitably defined coordination model distinguishing between objective (inter-agent) coordination and subjective (intra-agent) coordination, this book addresses the engineering of multi-agent systems and thus contributes to closing the gap between research and applications in agent technology. After reviewing the state of the art, the author introduces the general coordination model ECM and the corresponding object-oriented coordination language STL++. The practicability of ECM/STL++ is illustrated by the simulation of a particular collective robotics application and the automation of an e-commerce trading system. Situated at the intersection of behavior-based artificial intelligence and concurrent and distributed systems, this monograph is of relevance to the agent R&D community approaching agent technology from the distributed artificial intelligence point of view as well as for the distributed systems community.

Observer design is an essential part of many controller design algorithms because in many applications, measured information alone does not sufficiently represent the system's state. In particular, estimating the system's state can be done by multiple observers cooperatively, which is referred to as distributed estimation. The essential benefit lies in the fact that through cooperation, each individual observer only needs very limited sensor capacity, which allows for large, spatially distributed sensor networks. This thesis is dedicated at improving distributed estimation in a number of ways, including extending the system class towards nonlinear systems implementing event-triggered communication - enabling decentralized computation of the observer parameters preserving scalability of the estimation scheme for systems of increasing size Moreover, we apply such cooperating observers to solving the synchronization and output regulation problem for multi-agent systems.

This book presents a systematic study of an emerging field in the development of multi-agent systems. In a wide spectrum of applications, it is now common to see that multiple agents work cooperatively to accomplish a complex task. The book assists the implementation of such applications by promoting the ability of multi-agent systems to track — using local communication only — the mean value of signals of interest, even when these change rapidly with time and when no individual agent has direct access to the average signal across the whole team; for example, when a better estimation/control performance of multi-robot systems has to be guaranteed, it is desirable for each robot to compute or track the averaged changing measurements of all the robots at any time by communicating with only local neighboring robots. The book covers three factors in successful distributed average tracking: algorithm design via nonsmooth and extended PI control; distributed average tracking for double-integrator, general-linear, Euler–Lagrange, and input-saturated dynamics; and applications in dynamic region-following formation control and distributed convex optimization. The book presents both the theory and applications in a general but self-contained manner, making it easy to follow for newcomers to the topic. The content presented fosters research advances in distributed average tracking and inspires future research directions in the field in academia and industry.

Multiagent systems is an expanding field that blends classical fields like game theory and decentralized control with modern fields like computer science and machine learning. This monograph provides a concise introduction to the subject, covering the theoretical foundations as well as more recent developments in a coherent and readable manner. The text is centered on the concept of an agent as decision maker. Chapter 1 is a short introduction to the field of multiagent systems. Chapter 2 covers the basic theory of singleagent decision making under uncertainty. Chapter 3 is a brief introduction to game theory, explaining classical concepts like Nash equilibrium. Chapter 4 deals with the fundamental problem of coordinating a team of collaborative agents. Chapter 5 studies the problem of multiagent reasoning and decision making under partial observability. Chapter 6 focuses on the design of protocols that are stable against manipulations by self-interested agents. Chapter 7 provides a short introduction to the rapidly expanding field of multiagent reinforcement learning. The material can be used for teaching a half-semester course on multiagent systems covering, roughly, one chapter per lecture.