A graph theoretical approach to input design for identification of nonlinear dynamical models
From MaRDI portal
Publication:2342536
DOI10.1016/j.automatica.2014.10.097zbMath1309.93177OpenAlexW2077483124MaRDI QIDQ2342536
Cristian R. Rojas, Patricio E. Valenzuela, Håkan Hjalmarsson
Publication date: 28 April 2015
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2014.10.097
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Identification in stochastic control theory (93E12)
Related Items (4)
D-optimal input design for nonlinear FIR-type systems: a dispersion-based approach ⋮ Analysis of averages over distributions of Markov processes ⋮ Identification of symmetric noncausal processes ⋮ On robust input design for nonlinear dynamical models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Input design for structured nonlinear system identification
- Stationarity on finite strings and shift register sequences
- Dynamic system identification. Experiment design and data analysis
- An adaptive method for consistent estimation of real-valued non-minimum phase zeros in stable LTI systems
- Identification of ARX systems with non-stationary inputs -- asymptotic analysis with application to adaptive input design
- Robust optimal experiment design for system identification
- Convergence analysis of parametric identification methods
- Identification For Control: Optimal Input Design With Respect To A Worst-Case $\nu$-gap Cost Function
- Fastest Mixing Markov Chain on a Graph
- Finding All the Elementary Circuits of a Directed Graph
- Input design via LMIs admitting frequency-wise model specifications in confidence regions
- Monte Carlo sampling methods using Markov chains and their applications
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: A graph theoretical approach to input design for identification of nonlinear dynamical models
