Abstract
Recently, several properties in networked sensing and distributed systems have been modeled by various researchers [1,2,3,5,7,9,11,12] using topological spaces and their topological invariants. The unifying theme in these approaches has been that the local properties of a network, as dictated by local interactions among agents, can be captured by certain topological spaces. These spaces are mostly combinatorial in nature and are a generalization of the more familiar graphical models. Moreover, the global properties of the network characteristics correspond to certain topological invariants of these spaces such as genus, homology, homotopy, and the existence of simplicial maps. Examples of such modeling attempts include coverage problems for sensor networks [1,2,3,7]; consensus & concurrency modeling in asynchronous distributed systems [9]; and routing in networks without geographical information [5]. One notable characteristic of these studies has been that the topological abstractions preserve many global geometrical properties of the network while abstracting away the redundant geometrical details at small scales. This promises great simplification of algorithms as well as hardware, which is an important requirement for realizing large-scale robust networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
de Silva, V., Ghrist, R.: Coordinate-free coverage in sensor networks with controlled boundaries via homology. Intl. J. Robotics Research, to appear
de Silva, V., Ghrist, R.: Coverage in sensor networks via persistent homology. Algebraic and Geometric Topology (To appear)
de Silva, V., Ghrist, R., Muhammad, A.: Blind Swarms for Coverage in 2-D. In: Robotics: Science and Systems, MIT, Cambridge, MA, June 8-11 (2005)
Eckmann, B.: Harmonische Funktionen und Randwertaufgaben in einem Komplex. Commentarii Math. Helvetici 17, 240–245 (1945)
Fang, Q., et al.: Glider: gradient landmark-based distributed routing for sensor networks. In: Proc. IEEE Infocom, IEEE Computer Society Press, Los Alamitos (2005)
Gage, D.: Command control for many-robot systems. In: Nineteenth Annual AUVS Technical Symposium, Huntsville, Alabama, USA, pp. 22–24 (1992)
Ghrist, R., Muhammad, A.: Coverage and Hole-Detection in Sensor Networks via Homology. In: The Fourth International Conference on Information Processing in Sensor Networks (IPSN’05), UCLA, Los Angeles, CA, April 25-27 (2005)
Hatcher, A.: Algebraic Topology. Cambridge University Press, Cambridge (2002)
Herlihy, M., Shavit, N.: The Topological Structure of Asynchronous Computability. Journal of the ACM 46(6), 858–923 (1999)
Jadbabaie, A., Lin, J., Morse, A.: Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Transactions on Automatic Control 48(6), 988–1001 (2003)
Muhammad, A., Egerstedt, M.: Control Using Higher Order Laplacians in Network Topologies. In: Proc. of 17th International Symposium on Mathematical Theory of Networks and Systems, Kyoto, Japan (2006)
Muhammad, A., Jadbabaie, A.: Decentralized Computation of Homology Groups in Networks by Gossip. American Controls Conference (Submitted) (2007)
Muhammad, A., Jadbabaie, A.: From Consensus in Switching Graphs to Coverage in Switching Simplicial Complexes. University of Pennsylvania Technical Report (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Muhammad, A., Jadbabaie, A. (2007). Asymptotic Stability of Switched Higher Order Laplacians. In: Bemporad, A., Bicchi, A., Buttazzo, G. (eds) Hybrid Systems: Computation and Control. HSCC 2007. Lecture Notes in Computer Science, vol 4416. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71493-4_70
Download citation
DOI: https://doi.org/10.1007/978-3-540-71493-4_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71492-7
Online ISBN: 978-3-540-71493-4
eBook Packages: Computer ScienceComputer Science (R0)