Distributed Control of Robotic Networks : : A Mathematical Approach to Motion Coordination Algorithms / / Francesco Bullo, Sonia Martínez, Jorge Cortés.
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 a...
Saved in:
| Superior document: | Title is part of eBook package: De Gruyter Princeton Series in Applied Mathematics eBook-Package |
|---|---|
| VerfasserIn: | |
| Place / Publishing House: | Princeton, NJ : : Princeton University Press, , [2009] ©2009 |
| Year of Publication: | 2009 |
| Edition: | Course Book |
| Language: | English |
| Series: | Princeton Series in Applied Mathematics ;
27 |
| Online Access: | |
| Physical Description: | 1 online resource (320 p.) :; 76 line illus. |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| LEADER | 08643nam a22019335i 4500 | ||
|---|---|---|---|
| 001 | 9781400831470 | ||
| 003 | DE-B1597 | ||
| 005 | 20220131112047.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr || |||||||| | ||
| 008 | 220131t20092009nju fo d z eng d | ||
| 020 | |a 9781400831470 | ||
| 024 | 7 | |a 10.1515/9781400831470 |2 doi | |
| 035 | |a (DE-B1597)446779 | ||
| 035 | |a (OCoLC)979835075 | ||
| 040 | |a DE-B1597 |b eng |c DE-B1597 |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a nju |c US-NJ | ||
| 072 | 7 | |a TEC037000 |2 bisacsh | |
| 082 | 0 | 4 | |a 629.8/9246 |
| 084 | |a SK 880 |2 rvk |0 (DE-625)rvk/143266: | ||
| 100 | 1 | |a Bullo, Francesco, |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 0 | |a Distributed Control of Robotic Networks : |b A Mathematical Approach to Motion Coordination Algorithms / |c Francesco Bullo, Sonia Martínez, Jorge Cortés. |
| 250 | |a Course Book | ||
| 264 | 1 | |a Princeton, NJ : |b Princeton University Press, |c [2009] | |
| 264 | 4 | |c ©2009 | |
| 300 | |a 1 online resource (320 p.) : |b 76 line illus. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 0 | |a Princeton Series in Applied Mathematics ; |v 27 | |
| 505 | 0 | 0 | |t Frontmatter -- |t Contents -- |t Preface -- |t Chapter One. An introduction to distributed algorithms -- |t Chapter Two. Geometric models and optimization -- |t Chapter Three. Robotic network models and complexity notions -- |t Chapter Four. Connectivity maintenance and rendezvous -- |t Chapter Five. Deployment -- |t Chapter Six. Boundary estimation and tracking -- |t Bibliography -- |t Algorithm Index -- |t Subject Index -- |t Symbol Index |
| 506 | 0 | |a restricted access |u http://purl.org/coar/access_right/c_16ec |f online access with authorization |2 star | |
| 520 | |a 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 | ||
| 530 | |a Issued also in print. | ||
| 538 | |a Mode of access: Internet via World Wide Web. | ||
| 546 | |a In English. | ||
| 588 | 0 | |a Description based on online resource; title from PDF title page (publisher's Web site, viewed 31. Jan 2022) | |
| 650 | 7 | |a Technology & Engineering / Robotics. |2 bisacsh | |
| 653 | |a 1-center problem. | ||
| 653 | |a Adjacency matrix. | ||
| 653 | |a Aggregate function. | ||
| 653 | |a Algebraic connectivity. | ||
| 653 | |a Algebraic topology (object). | ||
| 653 | |a Algorithm. | ||
| 653 | |a Analysis of algorithms. | ||
| 653 | |a Approximation algorithm. | ||
| 653 | |a Asynchronous system. | ||
| 653 | |a Bellman-Ford algorithm. | ||
| 653 | |a Bifurcation theory. | ||
| 653 | |a Bounded set (topological vector space). | ||
| 653 | |a Calculation. | ||
| 653 | |a Cartesian product. | ||
| 653 | |a Centroid. | ||
| 653 | |a Chebyshev center. | ||
| 653 | |a Circulant matrix. | ||
| 653 | |a Circumscribed circle. | ||
| 653 | |a Cluster analysis. | ||
| 653 | |a Combinatorial optimization. | ||
| 653 | |a Combinatorics. | ||
| 653 | |a Communication complexity. | ||
| 653 | |a Computation. | ||
| 653 | |a Computational complexity theory. | ||
| 653 | |a Computational geometry. | ||
| 653 | |a Computational model. | ||
| 653 | |a Computer simulation. | ||
| 653 | |a Computer vision. | ||
| 653 | |a Connected component (graph theory). | ||
| 653 | |a Connectivity (graph theory). | ||
| 653 | |a Consensus (computer science). | ||
| 653 | |a Control function (econometrics). | ||
| 653 | |a Differentiable function. | ||
| 653 | |a Dijkstra's algorithm. | ||
| 653 | |a Dimensional analysis. | ||
| 653 | |a Directed acyclic graph. | ||
| 653 | |a Directed graph. | ||
| 653 | |a Discrete time and continuous time. | ||
| 653 | |a Disk (mathematics). | ||
| 653 | |a Distributed algorithm. | ||
| 653 | |a Doubly stochastic matrix. | ||
| 653 | |a Dynamical system. | ||
| 653 | |a Eigenvalues and eigenvectors. | ||
| 653 | |a Estimation. | ||
| 653 | |a Euclidean space. | ||
| 653 | |a Function composition. | ||
| 653 | |a Hybrid system. | ||
| 653 | |a Information theory. | ||
| 653 | |a Initial condition. | ||
| 653 | |a Instance (computer science). | ||
| 653 | |a Invariance principle (linguistics). | ||
| 653 | |a Invertible matrix. | ||
| 653 | |a Iteration. | ||
| 653 | |a Iterative method. | ||
| 653 | |a Kinematics. | ||
| 653 | |a Laplacian matrix. | ||
| 653 | |a Leader election. | ||
| 653 | |a Linear dynamical system. | ||
| 653 | |a Linear interpolation. | ||
| 653 | |a Linear programming. | ||
| 653 | |a Lipschitz continuity. | ||
| 653 | |a Lyapunov function. | ||
| 653 | |a Markov chain. | ||
| 653 | |a Mathematical induction. | ||
| 653 | |a Mathematical optimization. | ||
| 653 | |a Mobile robot. | ||
| 653 | |a Motion planning. | ||
| 653 | |a Multi-agent system. | ||
| 653 | |a Network model. | ||
| 653 | |a Network topology. | ||
| 653 | |a Norm (mathematics). | ||
| 653 | |a Numerical integration. | ||
| 653 | |a Optimal control. | ||
| 653 | |a Optimization problem. | ||
| 653 | |a Parameter (computer programming). | ||
| 653 | |a Partition of a set. | ||
| 653 | |a Percolation theory. | ||
| 653 | |a Permutation matrix. | ||
| 653 | |a Polytope. | ||
| 653 | |a Proportionality (mathematics). | ||
| 653 | |a Quantifier (logic). | ||
| 653 | |a Quantization (signal processing). | ||
| 653 | |a Robustness (computer science). | ||
| 653 | |a Scientific notation. | ||
| 653 | |a Sensor. | ||
| 653 | |a Set (mathematics). | ||
| 653 | |a Simply connected space. | ||
| 653 | |a Simulation. | ||
| 653 | |a Simultaneous equations. | ||
| 653 | |a State space. | ||
| 653 | |a State variable. | ||
| 653 | |a Stochastic matrix. | ||
| 653 | |a Stochastic. | ||
| 653 | |a Strongly connected component. | ||
| 653 | |a Synchronous network. | ||
| 653 | |a Theorem. | ||
| 653 | |a Time complexity. | ||
| 653 | |a Topology. | ||
| 653 | |a Variable (mathematics). | ||
| 653 | |a Vector field. | ||
| 700 | 1 | |a Cortés, Jorge, |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 700 | 1 | |a Martínez, Sonia, |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 773 | 0 | 8 | |i Title is part of eBook package: |d De Gruyter |t Princeton Series in Applied Mathematics eBook-Package |z 9783110515831 |o ZDB-23-PAM |
| 773 | 0 | 8 | |i Title is part of eBook package: |d De Gruyter |t Princeton University Press eBook-Package Backlist 2000-2013 |z 9783110442502 |
| 776 | 0 | |c print |z 9780691141954 | |
| 856 | 4 | 0 | |u https://doi.org/10.1515/9781400831470 |
| 856 | 4 | 0 | |u https://www.degruyter.com/isbn/9781400831470 |
| 856 | 4 | 2 | |3 Cover |u https://www.degruyter.com/document/cover/isbn/9781400831470/original |
| 912 | |a 978-3-11-044250-2 Princeton University Press eBook-Package Backlist 2000-2013 |c 2000 |d 2013 | ||
| 912 | |a EBA_BACKALL | ||
| 912 | |a EBA_CL_CHCOMSGSEN | ||
| 912 | |a EBA_EBACKALL | ||
| 912 | |a EBA_EBKALL | ||
| 912 | |a EBA_ECL_CHCOMSGSEN | ||
| 912 | |a EBA_EEBKALL | ||
| 912 | |a EBA_ESTMALL | ||
| 912 | |a EBA_PPALL | ||
| 912 | |a EBA_STMALL | ||
| 912 | |a GBV-deGruyter-alles | ||
| 912 | |a PDA12STME | ||
| 912 | |a PDA13ENGE | ||
| 912 | |a PDA18STMEE | ||
| 912 | |a PDA5EBK | ||
| 912 | |a ZDB-23-PAM | ||