This self-contained introduction to the distributed control of robotic networks offers a distinctive blend of computer science and control theory. The book presents a broad set of tools for understanding coordination algorithms, determining their correctness, and assessing their complexity; and it analyzes various cooperative strategies for tasks such as consensus, rendezvous, connectivity maintenance, deployment, and boundary estimation. The unifying theme is a formal model for robotic networks that explicitly incorporates their communication, sensing, control, and processing capabilities--a model that in turn leads to a common formal language to describe and analyze coordination algorithms.
Written for first- and second-year graduate students in control and robotics, the book will also be useful to researchers in control theory, robotics, distributed algorithms, and automata theory. The book provides explanations of the basic concepts and main results, as well as numerous examples and exercises.
"synopsis" may belong to another edition of this title.
"This book covers its subject very thoroughly. The framework the authors have established is very elegant and, if it catches on, this book could be the primary reference for this approach. I don't know of any other book that covers this set of topics."--Richard M. Murray, California Institute of Technology
"The authors do an excellent job of clearly describing the problems and presenting rigorous, provably correct algorithms with complexity bounds for each problem. The authors also do a fantastic job of providing the mathematical insight necessary for such complex problems."--Ali Jadbabaie, University of Pennsylvania
"The order of presentation makes much sense, and the book thoroughly covers what it sets out to cover. The algorithms and results are presented using a clear mathematical and computer science formalism, which allows a uniform presentation. The formalism used and the way of presenting the algorithms may be helpful for structuring the presentation of new algorithms in the future."--Vincent Blondel, Université catholique de Louvain
"About this title" may belong to another edition of this title.
Shipping:
FREE
Within U.S.A.
Book Description Condition: New. Book is in NEW condition. 1.9. Seller Inventory # 0691141959-2-1
Book Description Condition: New. Seller Inventory # 5987360-n
Book Description HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # WP-9780691141954
Book Description Condition: New. Brand New. Seller Inventory # 9780691141954
Book Description Hardcover. Condition: new. Seller Inventory # 9780691141954
Book Description Condition: New. Introduces the distributed control of robotic networks. This book presents a set of tools for understanding coordination algorithms, determining their correctness, and assessing their complexity. It analyzes various cooperative strategies for tasks such as consensus, rendezvous, connectivity maintenance, deployment, and boundary estimation. Series: Princeton Series in Applied Mathematics. Num Pages: 320 pages, 76 line illus. BIC Classification: TBJ; TJFM1; UY. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 261 x 185 x 24. Weight in Grams: 872. . 2009. Hardcover. . . . . Seller Inventory # V9780691141954
Book Description Hardback. Condition: New. New copy - Usually dispatched within 4 working days. Introduces the distributed control of robotic networks. This book presents a set of tools for understanding coordination algorithms, determining their correctness, and assessing their complexity. It analyzes various cooperative strategies for tasks such as consensus, rendezvous, connectivity maintenance, deployment, and boundary estimation. Seller Inventory # B9780691141954
Book Description Condition: New. Seller Inventory # 5987360-n
Book Description hardback. Condition: New. Language: ENG. Seller Inventory # 9780691141954
Book Description Condition: New. In. Seller Inventory # ria9780691141954_new