 |
|
|
Item Details
| Title:
|
GRAPH THEORETIC METHODS IN MULTIAGENT NETWORKS
|
| By: |
Mehran Mesbahi, Magnus Egerstedt |
| Format: |
Hardback |
| List price:
|
£75.00 |
| Our price: |
£60.00 |
| Discount: |
|
| You save:
|
£15.00 |
|
|
|
|
|
| ISBN 10: |
0691140618 |
| ISBN 13: |
9780691140612 |
| Availability: |
Usually dispatched within 1-3 weeks.
 Delivery
rates
|
| Stock: |
Currently 0 available |
| Publisher: |
PRINCETON UNIVERSITY PRESS |
| Pub. date: |
21 July, 2010 |
| Series: |
Princeton Series in Applied Mathematics |
| Pages: |
424 |
| Description: |
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. |
| Synopsis: |
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 |
| Illustrations: |
137 line illus. |
| Publication: |
US |
| Imprint: |
Princeton University Press |
| Returns: |
Returnable |
|
|
|
 |
|
|
|
|
|
Little Worried Caterpillar (PB)
Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
|
|
All the Things We Carry PB
What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
|
|
|
|