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 | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Linear Inequalities and Related Systems. (AM-38), Volume 38 / / Harold William Kuhn, Albert William Tucker
| Linear Inequalities and Related Systems. (AM-38), Volume 38 / / Harold William Kuhn, Albert William Tucker |
| Autore | Kuhn Harold William |
| Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
| Descrizione fisica | 1 online resource (353 pages) : illustrations, tables |
| Disciplina | 512.89 |
| Collana | Annals of Mathematics Studies |
| Soggetto topico |
Linear programming
Matrices Game theory |
| Soggetto non controllato |
Banach space
Basic solution (linear programming) Big O notation Bilinear form Boundary (topology) Brouwer fixed-point theorem Characterization (mathematics) Coefficient Combination Computation Computational problem Convex combination Convex cone Convex hull Convex set Corollary Correlation and dependence Cramer's rule Cyclic permutation Dedekind cut Degeneracy (mathematics) Determinant Diagram (category theory) Dilworth's theorem Dimension (vector space) Directional derivative Disjoint sets Doubly stochastic matrix Dual space Duality (mathematics) Duality (optimization) Eigenvalues and eigenvectors Elementary proof Equation solving Equation Equivalence class Euclidean space Existence theorem Existential quantification Extreme point Fixed-point theorem Functional analysis Fundamental theorem General equilibrium theory Hall's theorem Hilbert space Incidence matrix Inequality (mathematics) Infimum and supremum Invertible matrix Kakutani fixed-point theorem Lagrange multiplier Linear equation Linear inequality Linear map Linear programming Linear space (geometry) Linear subspace Loss function Main diagonal Mathematical induction Mathematical optimization Mathematical problem Max-flow min-cut theorem Maxima and minima Maximal set Maximum flow problem Menger's theorem Minor (linear algebra) Monotonic function N-vector Nonlinear programming Nonnegative matrix Parity (mathematics) Partially ordered set Permutation matrix Permutation Polyhedron Quantity Representation theorem Row and column vectors Scientific notation Sensitivity analysis Set notation Sign (mathematics) Simplex algorithm Simultaneous equations Solution set Special case Subset Summation System of linear equations Theorem Transpose Unit sphere Unit vector Upper and lower bounds Variable (mathematics) Vector space Von Neumann's theorem |
| ISBN | 1-4008-8198-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Preface -- Contents -- 1 . Dual Systems of Homogeneous Linear Relations / Tucker, A. W. -- 2. Polyhedral Convex Cones / Goldman, A. J. / Tucker, A. W. -- 3 . Resolution and Separation Theorems for Polyhedral Convex Sets / Goldman, A. J. -- 4. Theory of Linear Programming / Goldman, A. J. / Tucker, A. W. -- 5. On Systems of Linear Inequalities / Pan, Ky -- 6. Infinite Programs / Duffin, R . J . -- 7* A Primal-Dual Algorithm for Linear Programs / Dantzig, G. B. / Ford, L. R. / Fulkerson, D. R. -- 8. Marginal Values of Matrix Games and Linear Programs / Mills, Harlan D. -- 9 . Determinateness of Polyhedral Games / Wolfe, Philip -- 10. On Systems of Distinct Representatives / Hoffman, A. J. / Kuhn, H. W. -- 11. Dilworth's Theorem on Partially Ordered Sets / Dantzig, G. B. / Hoffman, A. J. -- 12. On the Max-Flow Min-Cut Theorem of Networks / Dantzig, G. B. / Fulkerson, D. R. -- 13. Integral Boundary Points of Convex Polyhedra / Hoffman, A. J. / Kruskal, J. B. -- 14 . An Extension of a Theorem of Dantzig's / Heller, I. / Tompkins, C. B. -- 15. Neighboring Vertices on a Convex Polyhedron / Gale, David -- 16. On a Theorem of Wald / Kuhn, H. W. -- 17. On the Solution of a Game-Theoretic Problem / Thompson, Gerald L. -- 18. The Closed Linear Model of Production / Gale, David -- Bibliography -- Backmatter |
| Record Nr. | UNINA-9910154749603321 |
Kuhn Harold William
|
||
| Princeton, NJ : , : Princeton University Press, , [2016] | ||
| Lo trovi qui: Univ. Federico II | ||
| ||