LEADER 03561nam 22006135 450 001 9910300431503321 005 20200703132949.0 010 $a3-319-15010-3 024 7 $a10.1007/978-3-319-15010-9 035 $a(CKB)3710000000356787 035 $a(EBL)1974124 035 $a(SSID)ssj0001452292 035 $a(PQKBManifestationID)11834534 035 $a(PQKBTitleCode)TC0001452292 035 $a(PQKBWorkID)11487960 035 $a(PQKB)10264331 035 $a(DE-He213)978-3-319-15010-9 035 $a(MiAaPQ)EBC1974124 035 $a(PPN)184499259 035 $a(EXLCZ)993710000000356787 100 $a20150210d2015 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aSemi-Autonomous Networks $eEffective Control of Networked Systems through Protocols, Design, and Modeling /$fby Airlie Chapman 205 $a1st ed. 2015. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2015. 215 $a1 online resource (207 p.) 225 1 $aSpringer Theses, Recognizing Outstanding Ph.D. Research,$x2190-5053 300 $a"Doctoral Thesis accepted by University of Washington." 311 $a3-319-15009-X 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aNomenclature -- Acknowledgments -- Dedication -- Supervisor's Foreword -- Introduction -- Preliminaries -- Notation -- Network Topology -- Consensus Dynamics -- Advection on Graphs -- Beyond Linear Protocols -- Measures and Rewiring -- Distributed Online Topology Design for Disturbance Rejection -- Network Topology Design for UAV Swarming with Wind Gusts -- Cartesian Products of Z-Matrix Networks: Factorization and Interval Analysis -- On the Controllability and Observability of Cartesian Product Networks -- Strong Structural Controllability of Networked Dynamics -- Security and Infiltration of Networks: A Structural Controllability and Observability Perspective -- Conclusion and Future Work -- Appendix -- Single Anchor State Measures. 330 $aThis thesis analyzes and explores the design of controlled networked dynamic systems - dubbed semi-autonomous networks. The work approaches the problem of effective control of semi-autonomous networks from three fronts: protocols which are run on individual agents in the network; the network interconnection topology design; and efficient modeling of these often large-scale networks. The author extended the popular consensus protocol to advection and nonlinear consensus.  The network redesign algorithms are supported by a game-theoretic and an online learning regret analysis. 410 0$aSpringer Theses, Recognizing Outstanding Ph.D. Research,$x2190-5053 606 $aPhysics 606 $aControl engineering 606 $aApplications of Graph Theory and Complex Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/P33010 606 $aControl and Systems Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/T19010 615 0$aPhysics. 615 0$aControl engineering. 615 14$aApplications of Graph Theory and Complex Networks. 615 24$aControl and Systems Theory. 676 $a629.895630151563 700 $aChapman$b Airlie$4aut$4http://id.loc.gov/vocabulary/relators/aut$0792527 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910300431503321 996 $aSemi-Autonomous Networks$91772336 997 $aUNINA