My Account Log in

8 options

Distributed control of robotic networks : a mathematical approach to motion coordination algorithms / Francesco Bullo, Jorge Cortes, Sonia Martinez.

De Gruyter Princeton University Press eBook-Package Backlist 2000-2013 Available online

View online

EBSCOhost Academic eBook Collection (North America) Available online

View online

EBSCOhost Ebook Public Library Collection - North America Available online

View online

EBSCOhost eBook Community College Collection Available online

View online

Ebook Central Academic Complete Available online

View online

Ebook Central University Press Available online

View online

Ebscohost Ebooks University Press Collection (North America) Available online

View online

eBook EngineeringCore Collection Available online

View online
Format:
Book
Author/Creator:
Bullo, Francesco.
Contributor:
Cortés, Jorge, 1974-
Martínez, Sonia, 1974-
Series:
Princeton series in applied mathematics.
Princeton series in applied mathematics
Language:
English
Subjects (All):
Robotics.
Computer algorithms.
Robots--Control systems.
Robots.
Physical Description:
1 online resource (333 p.)
Edition:
Course Book
Place of Publication:
Princeton, NJ : Princeton University Press, 2009.
Language Note:
English
System Details:
Mode of access: World Wide Web.
Summary:
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. Self-contained exposition of graph-theoretic concepts, distributed algorithms, and complexity measures for processor networks with fixed interconnection topology and for robotic networks with position-dependent interconnection topology Detailed treatment of averaging and consensus algorithms interpreted as linear iterations on synchronous networks Introduction of geometric notions such as partitions, proximity graphs, and multicenter functions Detailed treatment of motion coordination algorithms for deployment, rendezvous, connectivity maintenance, and boundary estimation
Contents:
Frontmatter
Contents
Preface
Chapter One. An introduction to distributed algorithms
Chapter Two. Geometric models and optimization
Chapter Three. Robotic network models and complexity notions
Chapter Four. Connectivity maintenance and rendezvous
Chapter Five. Deployment
Chapter Six. Boundary estimation and tracking
Bibliography
Algorithm Index
Subject Index
Symbol Index
Notes:
Description based upon print version of record.
Includes bibliographical references and index.
Description based on publisher supplied metadata and other sources.
ISBN:
9786612458200
9786612935756
9781680158977
168015897X
9781282458208
1282458205
9781282935754
1282935755
9781400831470
1400831474
9780691141954
0691141959
OCLC:
609855940

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Library Catalog Using Articles+ Library Account