Model (in)validation of switched ARX systems with unknown switches and its application to activity monitoring

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2010, Pages 7624-7630

  Ozay, Necmiye ^a   Sznaier, Mario ^a   Lagoa, Constantino ^b  

^a Northeastern University   (United States)

^b The Pennsylvania State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION; LINEAR SYSTEMS;

ACTIVITY MONITORING; CONVEX OPTIMIZATION PROBLEMS; MULTI-INPUT MULTI-OUTPUT; NON TRIVIAL PROBLEMS; OPTIMIZATION PROBLEMS; PRIORI INFORMATION; SWITCHED ARX SYSTEMS; SWITCHED LINEAR SYSTEM;

STRUCTURAL OPTIMIZATION;

EID: 79953131593     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2010.5717330     Document Type: Conference Paper

References (21)

1. A. Bemporad, A. Garulli, S. Paoletti, and A. Vicino. A bounded-error approach to piecewise affine system identification. IEEE Transactions on Automatic Control, 50(10):1567-1580, 2005. (Pubitemid 41555605)
2. F. Bianchi and R. Sánchez Peña. Robust identification/ invalidation in an lpv framework. International Journal of Robust and Nonlinear Control, 20(3):301-312, Mar. 2009.
3. J. Chen. Frequency-domain tests for validation of linear fractional uncertain models. IEEE Transactions on Automatic Control, 42(6):748-760, June 1997. (Pubitemid 127760871)
4. R.E. Curto and Fialkow L.A. Truncated k-moment problems in several variables. Journal of Operator Theory, 54(1):189-226, 2005. (Pubitemid 41655889)
5. C. Feng, C. Lagoa, and M. Sznaier. Hybrid system identification via sparse polynomial optimization. In American Control Conference, 2010. (to appear).
6. G. Ferrari-Trecate, M. Muselli, D. Liberati, and M. Morari. A clustering technique for the identification of piecewise affine and hybrid systems. Automatica, 39:205-207, 2003.
7. J.B. Lasserre. Global optimization with polynomials and the problem of moments. SIAM J. Optimization, 11(3):796-817, 2001.
8. J.B. Lasserre. Convergent sdp-relaxations in polynomial optimization with sparsity. SIAM J. Optimization, 17(3):822-843, 2006. (Pubitemid 47265174)
9. M. Laurent. Emerging Applications of Algebraic Geometry, chapter Sums of squares, moment matrices and optimization over polynomials, pages 157-270. Springer, 2009.
10. Y. Ma and R. Vidal. A closed form solution to the identification of hybrid arx models via the identification of algebraic varieties. In Hybrid Systems Computation and Control, pages 449-465, March 2005.
11. th IEEE Conf. Dec. Control, pages 4686-4691, 2009.
12. N. Ozay, M. Sznaier, C. Lagoa, and O. Camps. A sparsification approach to set membership identification of a class of affine hybrid systems. In Proc. 47th IEEE Conf. Dec. Control, pages 123-130, 2008.
13. S. Paoletti, A. Juloski, G. Ferrari-Trecate, and R. Vidal. Identification of hybrid systems: A tutorial. European Journal of Control, 13(2):242-260, 2007.
14. P. A. Parrilo. Semidefinite programming relaxations for semialgebraic problems. Mathematical Programming Ser. B, 96(2):293-320, 2003.
15. K. Poolla, P. Khargonekar, A. Tikku, J. Krause, and K. Nagpal. A time domain approach to model validation. IEEE Transactions on Automatic Control, 39(5):951-959, 1994.
16. S. Prajna. Barrier certificates for nonlinear model validation. Automatica, 42(1):117-126, 2006. (Pubitemid 41660568)
17. R. Sánchez Peña and M. Sznaier. Robust Systems Theory and Applications. Wiley & Sons, Inc., 1998.
18. K. Schmudgen. The k-moment problem for compact semi-algebraic sets. Mathematische Annalen, 289(1):203-206, 1991.
19. Jos F. Sturm. Using sedumi 1.02, a matlab toolbox for optimization over symmetric cones, 1999.
20. M. Sznaier and M.C. Mazzaro. An lmi approach to control-oriented identification and model (in) validation of lpv systems. Automatic Control, IEEE Transactions on, 48(9):1619-1624, sept. 2003.
21. H. Waki, S. Kim, M. Kojima, and M. Muramatsu. Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity. SIAM J. on Optimization, 17(1):218-242, 2006. (Pubitemid 46279501)