Approximate dynamic programming for constrained linear systems: A piecewise quadratic approximation approach

Approximate dynamic programming (ADP) faces challenges in dealing with constraints in control problems. Model predictive control (MPC) is, in comparison, well-known for its accommodation of constraints and stability guarantees, although its computation is sometimes prohibitive. This paper introduces an approach combining the two methodologies...

Finite-sample analysis of identification of switched linear systems with arbitrary or restricted switching

For the identification of switched systems with measured states and a measured switching signal, this work aims to analyze the effect of switching strategies on the estimation error. The data is assumed to be collected from globally asymptotically or marginally stable switched systems under switches that are arbitrary or subject to an average...

Excitation allocation for generic identifiability of linear dynamic networks with fixed modules

Identifiability of linear dynamic networks requires the presence of a sufficient number of external excitation signals. The problem of allocating a minimal number of external signals for guaranteeing generic network identifiability in the full measurement case has been recently addressed in the literature. Here we will extend that work by...