Simulation-based optimal sensor scheduling with application to observer trajectory planning

S.S. Singh, N. Kantas, Ba-Ngu Vo, A. Doucet, R.J. Evans

    Research output: Contribution to journalArticlepeer-review

    42 Citations (Scopus)

    Abstract

    The sensor scheduling problem can be formulated as a controlled hidden Markov model and this paper solves the problem when the state, observation and action spaces are continuous. This general case is important as it is the natural framework for many applications. The aim is to minimise the variance of the estimation error of the hidden state w.r.t. the action sequence. We present a novel simulation-based method that uses a stochastic gradient algorithm to find optimal actions. (c) 2007 Elsevier Ltd. All rights reserved.
    Original languageEnglish
    Pages (from-to)817-830
    JournalAutomatica
    Volume43
    Issue number5
    DOIs
    Publication statusPublished - 2007

    Fingerprint

    Dive into the research topics of 'Simulation-based optimal sensor scheduling with application to observer trajectory planning'. Together they form a unique fingerprint.

    Cite this