Graph theoretic methods in multiagent networks

This accessible book provides an introduction to the analysis and design of dynamic multiagent networks. Such networks are of great interest in a wide range of areas in science and engineering, including: mobile sensor networks, distributed robotics such as formation flying and swarming, quantum net...

Celý popis

Uloženo v:

Podrobná bibliografie
Hlavní autoři:	Mesbahi, Mehran, Egerstedt, Magnus
Médium:	E-kniha Kniha
Jazyk:	angličtina
Vydáno:	Princeton Princeton University Press 2010
Vydání:	STU - Student edition
Edice:	Princeton Series in Applied Mathematics
Témata:	Abstraction (software engineering) Adjacency matrix Algebraic connectivity Algebraic graph theory Algorithm Applied Arborescence (graph theory) Asymmetric graph Automorphism Bipartite graph Cartesian product Characterization (mathematics) Circulant graph Combinatorial optimization Combinatorial topology Combinatorics Complete graph Computational resource Connectivity (graph theory) Controllability Cycle graph Cycle graph (algebra) Degree (graph theory) Degree matrix Diagonalizable matrix Directed graph Distance-vector routing protocol Eigenvalues and eigenvectors Estimation Expander graph Extremal combinatorics Extremal graph theory Gabriel graph Graph (discrete mathematics) Graph embedding Graph product Graph property Graph theory Graphic Methods Hypercube graph Identity matrix Incidence matrix Instance (computer science) Intersection (set theory) Johnson graph Kalman filter Line graph Lloyd's algorithm LTI system theory Lyapunov function Markov chain Mathematical models Mathematical optimization MATHEMATICS MATHEMATICS / Applied MATHEMATICS / Graphic Methods Multiagent systems Multiagent systems > Mathematical models Network analysis (Planning) Network analysis (Planning) > Graphic methods Network model Network topology Norm (mathematics) Optimal control Optimization problem Path graph PBV Permutation matrix Petersen graph Planar graph Proportionality (mathematics) Random geometric graph Random graph Recursion (computer science) Simplicial complex Stochastic matrix Symmetric graph Theorem Topological graph theory Variable (computer science) Vertex (graph theory) Connectivity (graph theory) Identity matrix Topological graph theory Vertex (graph theory) Incidence matrix Network topology Hypercube graph Simplicial complex Eigenvalues and eigenvectors Recursion (computer science) Variable (computer science) Gabriel graph Controllability Characterization (mathematics) Extremal graph theory Bipartite graph Combinatorics Arborescence (graph theory) Lloyd's algorithm Stochastic matrix Complete graph Cycle graph (algebra) Estimation Algebraic connectivity Cycle graph Algorithm Random graph Degree matrix Line graph Proportionality (mathematics) Random geometric graph LTI system theory Mathematical optimization Directed graph Lyapunov function Graph product Diagonalizable matrix Combinatorial topology Symmetric graph Kalman filter Extremal combinatorics Computational resource Combinatorial optimization Markov chain Johnson graph Network model Graph (discrete mathematics) Theorem Degree (graph theory) Path graph Algebraic graph theory Cartesian product Expander graph Automorphism Planar graph Circulant graph Adjacency matrix Graph theory Graph property Instance (computer science) Permutation matrix Asymmetric graph Petersen graph Norm (mathematics) Abstraction (software engineering) Optimal control Distance-vector routing protocol Intersection (set theory) Graph embedding Optimization problem
ISBN:	1400835356, 9781400835355, 9780691140612, 0691140618
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!