CDN$ 89.98 + FREE SHIPPING
Only 2 left in stock.
Ships from and sold by Book Depository CA.
CDN$ 89.98 + FREE SHIPPING
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See this image

Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms Hardcover – Jul 26 2009


See all formats and editions Hide other formats and editions
Amazon Price
New from Used from
Hardcover
CDN$ 89.98
CDN$ 79.77 CDN$ 89.67

How to Stop Time

click to open popover

No Kindle device required. Download one of the Free Kindle apps to start reading Kindle books on your smartphone, tablet, and computer.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your mobile phone number.



Product details

  • Hardcover: 320 pages
  • Publisher: Princeton University Press (July 26 2009)
  • Language: English
  • ISBN-10: 0691141959
  • ISBN-13: 978-0691141954
  • Product Dimensions: 19 x 2.5 x 26.7 cm
  • Shipping Weight: 862 g
  • Average Customer Review: Be the first to review this item
  • Amazon Bestsellers Rank: #2,112,773 in Books (See Top 100 in Books)
  • Would you like to tell us about a lower price?
    If you are a seller for this product, would you like to suggest updates through seller support?

  • See Complete Table of Contents

Product description

From the Inside Flap

"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

From the Back Cover

"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

See all Product description

Customer reviews

There are no customer reviews yet.
Share your thoughts with other customers

Most helpful customer reviews on Amazon.com

Amazon.com: 1.0 out of 5 stars 1 reviews
stochasticmind
1.0 out of 5 starspaper collection.
August 6, 2014 - Published on Amazon.com
Verified Purchase
6 people found this helpful.

Where's My Stuff?

Delivery & Returns

Need Help?