LEADER 08125nam 2201897 450 001 9910785659103321 005 20220416005445.0 010 $a9781400835355 (electronic book) 010 $a1-282-97910-8 010 $a9786612979101 010 $a1-4008-3535-6 024 7 $a10.1515/9781400835355 035 $a(CKB)2670000000067921 035 $a(EBL)548754 035 $a(OCoLC)701703574 035 $a(SSID)ssj0000543818 035 $a(PQKBManifestationID)11381923 035 $a(PQKBTitleCode)TC0000543818 035 $a(PQKBWorkID)10530847 035 $a(PQKB)10078326 035 $a(MiAaPQ)EBC548754 035 $a(DE-B1597)446776 035 $a(OCoLC)979968498 035 $a(DE-B1597)9781400835355 035 $a(Au-PeEL)EBL548754 035 $a(CaPaEBR)ebr10901635 035 $a(CaONFJC)MIL297910 035 $a(PPN)18226548X 035 $a(EXLCZ)992670000000067921 100 $a20100419h20102010 uy| 0 101 0 $aeng 135 $aurnn#---|u||u 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aGraph theoretic methods in multiagent networks /$fMehran Mesbahi and Magnus Egerstedt 205 $aSTU student edition 210 1$aPrinceton :$cPrinceton University Press,$d[2010] 210 4$dİ2010 215 $a1 online resource (424 pages) 225 1 $aPrinceton series in applied mathematics 300 $aDescription based upon print version of record. 311 0 $a0-691-14061-8 320 $aIncludes bibliographical references and index. 327 $tFront matter --$tContents --$tPreface --$tNotation --$tPART 1. FOUNDATIONS --$tChapter 1. Introduction --$tChapter 2. Graph Theory --$tChapter 3. The Agreement Protocol: Part I-The Static Case --$tChapter 4. The Agreement Protocol: Part II-Lyapunov and LaSalle --$tChapter 5. Probabilistic Analysis of Networks and Protocols --$tPART 2. MULTIAGENT NETWORKS --$tChapter 6. Formation Control --$tChapter 7. Mobile Robots --$tChapter 8. Distributed Estimation --$tChapter 9. Social Networks, Epidemics, and Games --$tPART 3. NETWORKS AS SYSTEMS --$tChapter 10. Agreement with Inputs and Outputs --$tChapter 11. Synthesis of Networks --$tChapter 12. Dynamic Graph Processes --$tChapter 13. Higher-order Networks --$tAppendix A. --$tBibliography --$tIndex 330 $aThis 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 networks, networked economics, biological synchronization, and social networks. Focusing on graph theoretic methods for the analysis and synthesis of dynamic multiagent networks, the book presents a powerful new formalism and set of tools for networked systems. The book's three sections look at foundations, multiagent networks, and networks as systems. The authors give an overview of important ideas from graph theory, followed by a detailed account of the agreement protocol and its various extensions, including the behavior of the protocol over undirected, directed, switching, and random networks. They cover topics such as formation control, coverage, distributed estimation, social networks, and games over networks. And they explore intriguing aspects of viewing networks as systems, by making these networks amenable to control-theoretic analysis and automatic synthesis, by monitoring their dynamic evolution, and by examining higher-order interaction models in terms of simplicial complexes and their applications. The book will interest graduate students working in systems and control, as well as in computer science and robotics. It will be a standard reference for researchers seeking a self-contained account of system-theoretic aspects of multiagent networks and their wide-ranging applications. This book has been adopted as a textbook at the following universities: ? University of Stuttgart, Germany Royal Institute of Technology, Sweden Johannes Kepler University, Austria Georgia Tech, USA University of Washington, USA Ohio University, USA 410 0$aPrinceton series in applied mathematics. 606 $aNetwork analysis (Planning)$xGraphic methods 606 $aMultiagent systems$xMathematical models 610 $aAddition. 610 $aAdjacency matrix. 610 $aAlgebraic graph theory. 610 $aAlgorithm. 610 $aAutomorphism. 610 $aBipartite graph. 610 $aCardinality. 610 $aCartesian product. 610 $aCirculant graph. 610 $aCombinatorics. 610 $aComplete graph. 610 $aComputation. 610 $aConnectivity (graph theory). 610 $aControllability. 610 $aConvex combination. 610 $aCorollary. 610 $aCycle graph (algebra). 610 $aCycle space. 610 $aDegree (graph theory). 610 $aDegree matrix. 610 $aDiagonal matrix. 610 $aDiameter. 610 $aDifferentiable function. 610 $aDimension. 610 $aDirected graph. 610 $aDivision by zero. 610 $aDynamical system. 610 $aEigenvalues and eigenvectors. 610 $aEquilibrium point. 610 $aEstimation. 610 $aEstimator. 610 $aExistential quantification. 610 $aExtremal graph theory. 610 $aGraph (discrete mathematics). 610 $aGraph theory. 610 $aIdentity matrix. 610 $aIncidence matrix. 610 $aInformation exchange. 610 $aInitial condition. 610 $aInterconnection. 610 $aIteration. 610 $aKalman filter. 610 $aKronecker product. 610 $aLTI system theory. 610 $aLaSalle's invariance principle. 610 $aLaplacian matrix. 610 $aLeast squares. 610 $aLine graph. 610 $aLinear map. 610 $aLipschitz continuity. 610 $aLyapunov function. 610 $aLyapunov stability. 610 $aMarkov chain. 610 $aMathematical optimization. 610 $aMatrix exponential. 610 $aMeasurement. 610 $aMulti-agent system. 610 $aNash equilibrium. 610 $aNatural number. 610 $aNetwork topology. 610 $aNonnegative matrix. 610 $aNotation. 610 $aObservability. 610 $aOptimal control. 610 $aOptimization problem. 610 $aPairwise. 610 $aParameter. 610 $aPath graph. 610 $aPermutation matrix. 610 $aPermutation. 610 $aPositive semidefinite. 610 $aPositive-definite matrix. 610 $aProbability. 610 $aQuantity. 610 $aRandom graph. 610 $aRandom variable. 610 $aRate of convergence. 610 $aRequirement. 610 $aResult. 610 $aRobotics. 610 $aScientific notation. 610 $aSensor. 610 $aSign (mathematics). 610 $aSimplicial complex. 610 $aSpecial case. 610 $aSpectral graph theory. 610 $aStochastic matrix. 610 $aStrongly connected component. 610 $aSubset. 610 $aSummation. 610 $aSupergraph. 610 $aSymmetric matrix. 610 $aSystems theory. 610 $aTheorem. 610 $aTheory. 610 $aUnit interval. 610 $aUpper and lower bounds. 610 $aVariable (mathematics). 610 $aVector space. 610 $aWithout loss of generality. 615 0$aNetwork analysis (Planning)$xGraphic methods. 615 0$aMultiagent systems$xMathematical models. 676 $a006.3 700 $aMesbahi$b Mehran$0771532 702 $aEgerstedt$b Magnus 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910785659103321 996 $aGraph theoretic methods in multiagent networks$93809922 997 $aUNINA