OBSERVABILITY OF POLYNOMIAL SYSTEMS .1. FINITE-TIME PROBLEMS

被引:113
作者
SONTAG, ED
机构
关键词
D O I
10.1137/0317011
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Different notions of observability are compared for systems defined by polynomial difference equations. The main result states that, for systems having the standard property of (multiple-experiment initial-state) observability, the response to a generic input sequence is sufficient for final-state determination. Some remarks are made on results for nonpolynomial and/or continuous-time systems. An identifiability result is derived from the above.
引用
收藏
页码:139 / 151
页数:13
相关论文
共 22 条
  • [1] Anderson B.D.O., 1971, LINEAR OPTIMAL CONTR
  • [2] BELLMAN R, 1970, Mathematical Biosciences, V7, P329, DOI 10.1016/0025-5564(70)90132-X
  • [3] BROCKETT RW, 1972, THEORY APPLICATIONS
  • [4] Conway J. H., 1971, REGULAR ALGEBRA FINI
  • [5] REALIZATION AND STRUCTURE THEORY OF BILINEAR DYNAMICAL-SYSTEMS
    DALESSANDRO, P
    ISIDORI, A
    RUBERTI, A
    [J]. SIAM JOURNAL ON CONTROL, 1974, 12 (03): : 517 - 535
  • [6] EILENBERG S, 1974, AUTOMATA LANGUAGES A
  • [8] FLIESS M, 1973, C R ACAD SCI PARIS A, V277, P243
  • [9] REGULATOR THEORY FOR FINITE AUTOMATA
    GATTO, M
    GUARDABASSI, G
    [J]. INFORMATION AND CONTROL, 1976, 31 (01): : 1 - 16
  • [10] Gill A., 1962, INTRO THEORY FINITE