Abstract
This paper concerns the problem of controlling mobile nodes in a network in such a way that the resulting graph-encoding of the inter-node information flow exhibits certain desirable properties. As a sequence of such transitions between different graphs occurs, the result is a graph process. In this paper, we not only characterize the reachability properties of these graph processes, but also put them to use in a number of applications, ranging from multi-agent formation control, to optimal collaborative beamforming in sensor networks.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
About this chapter
Cite this chapter
Muhammad, A., Ji, M., Egerstedt, M. Applications of Connectivity Graph Processes in Networked Sensing and Control. In: Antsaklis, P.J., Tabuada, P. (eds) Networked Embedded Sensing and Control. Lecture Notes in Control and Information Science, vol 331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533382_5
Download citation
DOI: https://doi.org/10.1007/11533382_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32794-3
Online ISBN: 978-3-540-32847-6
eBook Packages: EngineeringEngineering (R0)