Team for Research in
Ubiquitous Secure Technology

Approximate Estimation of Distributed Networked Control Systems
Songhwai Oh, Shankar Sastry

Citation
Songhwai Oh, Shankar Sastry. "Approximate Estimation of Distributed Networked Control Systems". American Control Conference, July, 2007.

Abstract
In this paper, we present two approximate filtering algorithms for estimating states of a distributed networked control system (DNCS). A DNCS consists of multiple agents communicating over a lossy communication channel, e.g., wireless channel. While the time complexity of the exact method can be exponential in the number of communication links, the time complexity of an approximate method is not dependent on the number of communication links. In addition, we discuss the general conditions for stable state estimation of DNCSs.

Electronic downloads

Citation formats  
  • HTML
    Songhwai Oh, Shankar Sastry. <a
    href="http://www.truststc.org/pubs/280.html"
    >Approximate Estimation of Distributed Networked Control
    Systems</a>, American Control Conference, July, 2007.
  • Plain text
    Songhwai Oh, Shankar Sastry. "Approximate Estimation of
    Distributed Networked Control Systems". American
    Control Conference, July, 2007.
  • BibTeX
    @inproceedings{OhSastry07_ApproximateEstimationOfDistributedNetworkedControlSystems,
        author = {Songhwai Oh and Shankar Sastry},
        title = {Approximate Estimation of Distributed Networked
                  Control Systems},
        booktitle = {American Control Conference},
        month = {July},
        year = {2007},
        abstract = {In this paper, we present two approximate
                  filtering algorithms for estimating states of a
                  distributed networked control system (DNCS). A
                  DNCS consists of multiple agents communicating
                  over a lossy communication channel, e.g., wireless
                  channel. While the time complexity of the exact
                  method can be exponential in the number of
                  communication links, the time complexity of an
                  approximate method is not dependent on the number
                  of communication links. In addition, we discuss
                  the general conditions for stable state estimation
                  of DNCSs.},
        URL = {http://www.truststc.org/pubs/280.html}
    }
    

Posted by Songhwai Oh on 7 Aug 2007.
For additional information, see the Publications FAQ or contact webmaster at www truststc org.

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.