Graph Theoretic Methods in Multiagent Networks
Magnus Egerstedt author Mehran Mesbahi author
Format:Hardback
Publisher:Princeton University Press
Published:6th Aug '10
Currently unavailable, and unfortunately no date known when it will be back
This well-organized book is an extensive and complete introduction to graph theoretic methods in the context of multiagent and multivehicle cooperative networks. The presentation of the material is elegant and in addition to basic results, the book includes new topics not commonly found in the literature. Ideal for graduate students and researchers, the book represents a significant contribution to the emerging field of cooperative control and consensus. -- Randy Beard, Brigham Young University This comprehensive overview of multiagent coordination brings together the existing literature on the subject and presents it in a clean, pedagogical fashion. The book will be useful to those in the areas of control theory, signal processing, and related disciplines. -- Ali Jadbabaie, University of Pennsylvania This book focuses on graph theoretic techniques in multiagent systems, with a strong emphasis on agreement problems. It covers a good selection of issues and will make a solid textbook for advanced courses in the field. -- Richard Murray, California Institute of Technology
Focusing on graph theoretic methods for the analysis and synthesis of dynamic multiagent networks, this book presents a powerful formalism and set of tools for networked systems. It covers topics such as formation control, coverage, distributed estimation, social networks, and games over networks.This accessible book provides an introduction to the analysis and design of dynamic multiagent networks. Such networks are of great interest in a wide range of areas in science and engineering, including: mobile sensor networks, distributed robotics such as formation flying and swarming, quantum networks, networked economics, biological synchronization, and social networks. Focusing on graph theoretic methods for the analysis and synthesis of dynamic multiagent networks, the book presents a powerful new formalism and set of tools for networked systems. The book's three sections look at foundations, multiagent networks, and networks as systems. The authors give an overview of important ideas from graph theory, followed by a detailed account of the agreement protocol and its various extensions, including the behavior of the protocol over undirected, directed, switching, and random networks. They cover topics such as formation control, coverage, distributed estimation, social networks, and games over networks. And they explore intriguing aspects of viewing networks as systems, by making these networks amenable to control-theoretic analysis and automatic synthesis, by monitoring their dynamic evolution, and by examining higher-order interaction models in terms of simplicial complexes and their applications. The book will interest graduate students working in systems and control, as well as in computer science and robotics. It will be a standard reference for researchers seeking a self-contained account of system-theoretic aspects of multiagent networks and their wide-ranging applications. This book has been adopted as a textbook at the following universities: * University of Stuttgart, Germany * Royal Institute of Technology, Sweden * Johannes Kepler University, Austria * Georgia Tech, USA * University of Washington, USA * Ohio University, USA
"Presently, there are few books on multiagent systems. Thus, this book can be a useful reference book for graduate students and researchers focusing on systems, controls, and robotics, and help them to better know and study multiagent systems."--Long Wang, Mathematical Reviews
ISBN: 9780691140612
Dimensions: unknown
Weight: 794g
424 pages