top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Distributed control of robotic networks [[electronic resource] ] : a mathematical approach to motion coordination algorithms / / Francesco Bullo, Jorge Cortés, Sonia Martínez
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
Edizione [Course Book]
Pubbl/distr/stampa Princeton, NJ, : Princeton University Press, 2009
Descrizione fisica 1 online resource (333 p.)
Disciplina 629.8/9246
Altri autori (Persone) CortésJorge <1974->
MartínezSonia <1974->
Collana Princeton series in applied mathematics
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
ISBN 1-68015-897-X
1-282-45820-5
1-282-93575-5
9786612458200
9786612935756
1-4008-3147-4
0-691-14195-9
Classificazione SK 880
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
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
Record Nr. UNINA-9910781069103321
Bullo Francesco  
Princeton, NJ, : Princeton University Press, 2009
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt
Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt
Autore Mesbahi Mehran
Edizione [STU student edition]
Pubbl/distr/stampa Princeton : , : Princeton University Press, , [2010]
Descrizione fisica 1 online resource (424 pages)
Disciplina 006.3
Collana Princeton series in applied mathematics
Soggetto topico Network analysis (Planning) - Graphic methods
Multiagent systems - Mathematical models
Soggetto non controllato Addition
Adjacency matrix
Algebraic graph theory
Algorithm
Automorphism
Bipartite graph
Cardinality
Cartesian product
Circulant graph
Combinatorics
Complete graph
Computation
Connectivity (graph theory)
Controllability
Convex combination
Corollary
Cycle graph (algebra)
Cycle space
Degree (graph theory)
Degree matrix
Diagonal matrix
Diameter
Differentiable function
Dimension
Directed graph
Division by zero
Dynamical system
Eigenvalues and eigenvectors
Equilibrium point
Estimation
Estimator
Existential quantification
Extremal graph theory
Graph (discrete mathematics)
Graph theory
Identity matrix
Incidence matrix
Information exchange
Initial condition
Interconnection
Iteration
Kalman filter
Kronecker product
LTI system theory
LaSalle's invariance principle
Laplacian matrix
Least squares
Line graph
Linear map
Lipschitz continuity
Lyapunov function
Lyapunov stability
Markov chain
Mathematical optimization
Matrix exponential
Measurement
Multi-agent system
Nash equilibrium
Natural number
Network topology
Nonnegative matrix
Notation
Observability
Optimal control
Optimization problem
Pairwise
Parameter
Path graph
Permutation matrix
Permutation
Positive semidefinite
Positive-definite matrix
Probability
Quantity
Random graph
Random variable
Rate of convergence
Requirement
Result
Robotics
Scientific notation
Sensor
Sign (mathematics)
Simplicial complex
Special case
Spectral graph theory
Stochastic matrix
Strongly connected component
Subset
Summation
Supergraph
Symmetric matrix
Systems theory
Theorem
Theory
Unit interval
Upper and lower bounds
Variable (mathematics)
Vector space
Without loss of generality
ISBN 9781400835355 (electronic book)
1-282-97910-8
9786612979101
1-4008-3535-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Front matter -- Contents -- Preface -- Notation -- PART 1. FOUNDATIONS -- Chapter 1. Introduction -- Chapter 2. Graph Theory -- Chapter 3. The Agreement Protocol: Part I-The Static Case -- Chapter 4. The Agreement Protocol: Part II-Lyapunov and LaSalle -- Chapter 5. Probabilistic Analysis of Networks and Protocols -- PART 2. MULTIAGENT NETWORKS -- Chapter 6. Formation Control -- Chapter 7. Mobile Robots -- Chapter 8. Distributed Estimation -- Chapter 9. Social Networks, Epidemics, and Games -- PART 3. NETWORKS AS SYSTEMS -- Chapter 10. Agreement with Inputs and Outputs -- Chapter 11. Synthesis of Networks -- Chapter 12. Dynamic Graph Processes -- Chapter 13. Higher-order Networks -- Appendix A. -- Bibliography -- Index
Record Nr. UNINA-9910785659103321
Mesbahi Mehran  
Princeton : , : Princeton University Press, , [2010]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt
Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt
Autore Mesbahi Mehran
Edizione [STU student edition]
Pubbl/distr/stampa Princeton : , : Princeton University Press, , [2010]
Descrizione fisica 1 online resource (424 pages)
Disciplina 006.3
Collana Princeton series in applied mathematics
Soggetto topico Network analysis (Planning) - Graphic methods
Multiagent systems - Mathematical models
Soggetto non controllato Addition
Adjacency matrix
Algebraic graph theory
Algorithm
Automorphism
Bipartite graph
Cardinality
Cartesian product
Circulant graph
Combinatorics
Complete graph
Computation
Connectivity (graph theory)
Controllability
Convex combination
Corollary
Cycle graph (algebra)
Cycle space
Degree (graph theory)
Degree matrix
Diagonal matrix
Diameter
Differentiable function
Dimension
Directed graph
Division by zero
Dynamical system
Eigenvalues and eigenvectors
Equilibrium point
Estimation
Estimator
Existential quantification
Extremal graph theory
Graph (discrete mathematics)
Graph theory
Identity matrix
Incidence matrix
Information exchange
Initial condition
Interconnection
Iteration
Kalman filter
Kronecker product
LTI system theory
LaSalle's invariance principle
Laplacian matrix
Least squares
Line graph
Linear map
Lipschitz continuity
Lyapunov function
Lyapunov stability
Markov chain
Mathematical optimization
Matrix exponential
Measurement
Multi-agent system
Nash equilibrium
Natural number
Network topology
Nonnegative matrix
Notation
Observability
Optimal control
Optimization problem
Pairwise
Parameter
Path graph
Permutation matrix
Permutation
Positive semidefinite
Positive-definite matrix
Probability
Quantity
Random graph
Random variable
Rate of convergence
Requirement
Result
Robotics
Scientific notation
Sensor
Sign (mathematics)
Simplicial complex
Special case
Spectral graph theory
Stochastic matrix
Strongly connected component
Subset
Summation
Supergraph
Symmetric matrix
Systems theory
Theorem
Theory
Unit interval
Upper and lower bounds
Variable (mathematics)
Vector space
Without loss of generality
ISBN 9781400835355 (electronic book)
1-282-97910-8
9786612979101
1-4008-3535-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Front matter -- Contents -- Preface -- Notation -- PART 1. FOUNDATIONS -- Chapter 1. Introduction -- Chapter 2. Graph Theory -- Chapter 3. The Agreement Protocol: Part I-The Static Case -- Chapter 4. The Agreement Protocol: Part II-Lyapunov and LaSalle -- Chapter 5. Probabilistic Analysis of Networks and Protocols -- PART 2. MULTIAGENT NETWORKS -- Chapter 6. Formation Control -- Chapter 7. Mobile Robots -- Chapter 8. Distributed Estimation -- Chapter 9. Social Networks, Epidemics, and Games -- PART 3. NETWORKS AS SYSTEMS -- Chapter 10. Agreement with Inputs and Outputs -- Chapter 11. Synthesis of Networks -- Chapter 12. Dynamic Graph Processes -- Chapter 13. Higher-order Networks -- Appendix A. -- Bibliography -- Index
Record Nr. UNINA-9910816716403321
Mesbahi Mehran  
Princeton : , : Princeton University Press, , [2010]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui