1 / 36

Applications to Hybrid System Identification

Applications to Hybrid System Identification. René Vidal Center for Imaging Science Institute for Computational Medicine Johns Hopkins University. What are hybrid systems?. Hybrid systems Dynamical models with interacting discrete and continuous behavior Previous work

fsipp
Download Presentation

Applications to Hybrid System Identification

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Applications to Hybrid System Identification René Vidal Center for Imaging Science Institute for Computational Medicine Johns Hopkins University

  2. What are hybrid systems? • Hybrid systems • Dynamical models with interacting discrete and continuous behavior • Previous work • Modeling, analysis, stability, observability • Verification and control: reachability analysis, safety • In applications one also needs to worry about identification Video segmentation Dynamic textures Gait recognition

  3. Identification of hybrid systems • Given input/output data, identify • Number of discrete states • Model parameters of linear systems • Hybrid state (continuous & discrete) • Switching parameters (partition of state space)

  4. Main challenges • Challenging “chicken-and-egg” problem • Given switching times, estimate model parameters • Given the model parameters, estimate hybrid state • Given all above, estimate switching parameters • Possible solution: iterate • Very sensitive to initialization • Needs a minimum dwell time • Does not use all data

  5. Prior work on hybrid system identification • Mixed-integer programming: (Bemporad et al. ‘01) • Clustering approach: k-means clustering + regression + classification + iterative refinement: (Ferrari-Trecate et al. ‘03) • Greedy/iterative approach: (Bemporad et al. ‘03) • Bayesian approach: maximum likelihood via expectation maximization algorithm (Juloski et al. ‘05) • Algebraic approach: (Vidal et al. ‘03 ‘04 ‘05)

  6. Algebraic approach to hybrid system ID • Key idea • Number of models = degree of a polynomial • Model parameters = roots (factors) of a polynomial • Batch methods • CDC’03: known #models of equal and known orders • HSCC’05: unknown #models of unknown and possibly different orders • Recursive methods • CDC’04: known #models of equal and known orders • CDC’05: unknown #models of unknown and possibly different orders

  7. Problem formulation • Switch ARX system (SARX)

  8. A single ARX system: known orders Knowing Systems Orders Regressors Parameter vector Data matrix A hyperplane

  9. A single ARX system: unknown orders Not Knowing Systems Orders Regressors Parameter vectors Data matrix A subspace

  10. A switched ARX system Embedding in <D • Configuration Space of Regressors: • Regressors of each system lie on a subspace in <D • Order of each system is related to the subspace dimension • Switching among systems corresponds to switching among the subspaces

  11. Hybrid decoupling polynomial For all regressors x 2 Z’ µ Z’’:

  12. Identifying the hybrid decoupling polynomial

  13. Batch algorithm summary

  14. Stochastic versus deterministic case ML-Estimate: minimizing the sum of squares of errors (SSE): GPCA: minimizing a weighted SSE: GPCA is a “relaxed” version of expectation maximization (EM) that permits a non-iterative solution.

  15. Simulation results System: Error: Mean Variance

  16. Pick-and-place machine experiment Four datasets of T = 60,000 measurements from a component placement process in a pick-and-place machine [Juloski:CEP05] • Training and simulation errors for down-sampled datasets (1/80): • Training and simulation errors for complete datasets:

  17. Pick-and-place machine experiment Sub-sampled (1 every 80) All data (60,000) Simulation Training

  18. Application in video segmentation • Segmenting N=30 frames of a sequence containing n=3 scenes • Host • Guest • Both

  19. Application in video segmentation • Segmenting N=60 frames of a sequence containing n=3 scenes • Burning wheel • Burnt car with people • Burning car

  20. Conclusions for batch method • Identification of SARX of unknown and possibly different dimensions • Decouple identification and filtering • Algebraic solution that can be used for initialization • Polynomial fitting + rank constraint • Polynomial differentiation • Does not need minimum dwell time • Ongoing work • MIMO ARX models: multiple polynomials (HSCC’08)

  21. Recursive identification algorithms • Most existing methods are batch • Collect all input/output data • Identify model parameters using all data • Not suitable for online/real time operation • Can we perform hybrid system identification recursively? • Recursive identification algorithm for Switched ARX • No restriction on switching mechanism • Does not depend on value of the discrete state • Based on algebraic geometry and linear system ID • Key idea: identification of multiple ARX models is equivalent to identification of a single ARX model in a lifted space • Persistence of excitation conditions that guarantee exponential convergence of the identified parameters

  22. Recalling the notation • The dynamics of each mode are in ARX form • input/output • discrete state • order of the ARX models • model parameters • Input/output data lives in a hyperplane • I/O data • Model parameters

  23. Recursive identification of ARX models • True model parameters • Equation error identifier • Persistence of excitation:

  24. Overestimating the system order: single mode

  25. Recursive identification of SARX models • Identification of a SARX model is equivalent to identification of a single lifted ARX model • Can apply equation error identifier and derive persistence of excitation condition in lifted space Embedding Lifting Embedding

  26. Recursive identification of hybrid model • Recall equation error identifier for ARX models • Equation error identifier for SARX models

  27. Recursive identification of ARX models

  28. Overestimating the number of modes

  29. Overestimating system order: multiple modes 1 then == = 0 2 then = 0 Given: 2 models estimated to be of the following form: Hybrid decoupling polynomial: If models are actually of the form is a function of the true parameter vector and Using the above idea, enforce zeros in the estimated hybrid parameter vector to obtain , whose derivatives give the desired parameter vectors

  30. Final recursive identification algorithm

  31. Temporal video segmentation

  32. Temporal video segmentation Empty living room Middle-aged man enters Woman enters Young man enters, introduces the woman and leaves Middle-aged man flirts with woman and steals her tiara Middle-aged man checks the time, rises and leaves Woman walks him to the door Woman returns to her seat Woman misses her tiara Woman searches her tiara Woman sits and dismays

  33. Spatial video segmentation

  34. Spatial temporal video segmentation Video Batch Recursion

  35. Conclusions and open issues • Contributions • A recursive identification algorithm for hybrid ARX models of unknown number of modes and order • A persistence of excitation condition on the input/output data that guarantees exponential convergence • Open issues • Persistence of excitation condition on the mode and input sequences only • Extend the model to multivariate SARX models • Extend the model to more general, possibly non-linear hybrid systems

  36. For more information, Vision, Dynamics and Learning Lab @ Johns Hopkins University Thank You!

More Related