Advertisement

Applications of Connectivity Graph Processes in Networked Sensing and Control

  • Abubakr Muhammad
  • Meng Ji
  • Magnus Egerstedt
Part I Multi-agent Control
Part of the Lecture Notes in Control and Information Science book series (LNCIS, volume 331)

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.

Keywords

Sensor Network Mobile Node Connectivity Graph Linear Matrix Inequality Beam Pattern 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Authors and Affiliations

  • Abubakr Muhammad
    • 1
  • Meng Ji
    • 1
  • Magnus Egerstedt
    • 1
  1. 1.School of Electrical and Computer Engineering Georgia Institute of Technology, Atlanta, GA 

Personalised recommendations