• DocumentCode
    335407
  • Title

    Stochastic complexity in identification of continuous time systems

  • Author

    Gerencsér, László ; Vágó, Zsuzsanna ; Hunter, Ian ; Lafontaine, Serge ; Horváth, Attila

  • Author_Institution
    Comput. & Autom. Inst., Hungarian Acad. of Sci., Budapest, Hungary
  • Volume
    2
  • fYear
    1994
  • fDate
    29 June-1 July 1994
  • Firstpage
    1525
  • Abstract
    The purpose of this paper is to present a continuous time identification method which can be used for high accuracy prediction and control. We consider continuous time systems with quasi-periodic inputs and white observation noise. These investigations have been motivated by control problems in microrobotics, where sampling rate and accuracy requirements are very high. It is shown that continuous time identification methods lead to numerically well conditioned prediction. The key tool in showing this is a general result of the theory of stochastic complexity. Also, we give an explanation on why discrete time methods break down.
  • Keywords
    computational complexity; continuous time systems; identification; linear systems; stochastic processes; white noise; continuous time systems; identification; linear systems; microrobotics; quasi-periodic inputs; stochastic complexity; white observation noise; Automation; Biomedical computing; Biomedical engineering; Continuous time systems; Control systems; Estimation error; Polynomials; Sampling methods; Stochastic resonance; Stochastic systems;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    American Control Conference, 1994
  • Print_ISBN
    0-7803-1783-1
  • Type

    conf

  • DOI
    10.1109/ACC.1994.752323
  • Filename
    752323