Distributed control of robotic networks [[electronic resource] ] : a mathematical approach to motion coordination algorithms / / Francesco Bullo, Jorge Cortés, Sonia Martínez

• Autore: Bullo Francesco
• Pubblicazione: Princeton, NJ, : Princeton University Press, 2009
• Edizione: Course Book
• Descrizione fisica: 1 online resource (333 p.)
• Disciplina: 629.8/9246
• Soggetto topico: Robotics; Computer algorithms; Robots - Control systems
• Soggetto non controllato: 1-center problem; Adjacency matrix; Aggregate function; Algebraic connectivity; Algebraic topology (object); Algorithm; Analysis of algorithms; Approximation algorithm; Asynchronous system; Bellman–Ford algorithm; Bifurcation theory; Bounded set (topological vector space); Calculation; Cartesian product; Centroid; Chebyshev center; Circulant matrix; Circumscribed circle; Cluster analysis; Combinatorial optimization; Combinatorics; Communication complexity; Computation; Computational complexity theory; Computational geometry; Computational model; Computer simulation; Computer vision; Connected component (graph theory); Connectivity (graph theory); Consensus (computer science); Control function (econometrics); Differentiable function; Dijkstra's algorithm; Dimensional analysis; Directed acyclic graph; Directed graph; Discrete time and continuous time; Disk (mathematics); Distributed algorithm; Doubly stochastic matrix; Dynamical system; Eigenvalues and eigenvectors; Estimation; Euclidean space; Function composition; Hybrid system; Information theory; Initial condition; Instance (computer science); Invariance principle (linguistics); Invertible matrix; Iteration; Iterative method; Kinematics; Laplacian matrix; Leader election; Linear dynamical system; Linear interpolation; Linear programming; Lipschitz continuity; Lyapunov function; Markov chain; Mathematical induction; Mathematical optimization; Mobile robot; Motion planning; Multi-agent system; Network model; Network topology; Norm (mathematics); Numerical integration; Optimal control; Optimization problem; Parameter (computer programming); Partition of a set; Percolation theory; Permutation matrix; Polytope; Proportionality (mathematics); Quantifier (logic); Quantization (signal processing); Robustness (computer science); Scientific notation; Sensor; Set (mathematics); Simply connected space; Simulation; Simultaneous equations; State space; State variable; Stochastic matrix; Stochastic; Strongly connected component; Synchronous network; Theorem; Time complexity; Topology; Variable (mathematics); Vector field
• Classificazione: SK 880
• Altri autori: CortésJorge <1974-> MartínezSonia <1974->
• Note generali: Description based upon print version of record.
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: 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
• Sommario/riassunto: 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
• Titolo autorizzato: Distributed control of robotic networks
• ISBN: 1-68015-897-X; 1-282-45820-5; 1-282-93575-5; 9786612458200; 9786612935756; 1-4008-3147-4; 0-691-14195-9
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 9910781069103321
• Lo trovi qui: Univ. Federico II
• Serie: Princeton series in applied mathematics.