skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Award ID contains: 1635014

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Given a linear dynamical system affected by noise, we consider the problem of optimally placing sensors (at design-time) subject to certain budget constraints to minimize the trace of the steady-state error covariance of the Kalman filter. Previous work has shown that this problem is NP-hard in general. In this paper, we impose additional structure by considering systems whose dynamics are given by a stochastic matrix corresponding to an underlying consensus network. In the case when there is a single input at one of the nodes in a tree network, we provide an optimal strategy (computed in polynomial-time) to place the sensors over the network. However, we show that when the network has multiple inputs, the optimal sensor placement problem becomes NP-hard. 
    more » « less