𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A dynamic programming algorithm for input estimation on linear time-variant systems

✍ Scribed by Lars J.L. Nordström

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
837 KB
Volume
195
Category
Article
ISSN
0045-7825

No coin nor oath required. For personal study only.

✦ Synopsis

A time domain input estimation algorithm for linear systems with general time-varying parameters is developed. The algorithm is an extension of an existing approach for time-invariant state space models and several new features, such as higher order input approximations and an extended time-variant output relation including direct input influence, are introduced. Numerical examples are given to illustrate the new features and show that the algorithm is valid in a general time-variant setting. In particular, excellent results are obtained for an ill-posed moving force identification problem with noise-contaminated data, treated with Tikhonov regularization.

📜 SIMILAR VOLUMES

A constrained minimum variance input-out
A constrained minimum variance input-output estimator for linear dynamic systems
✍ J. Gertler 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 435 KB

A stationary estimator is presented that provides estimates for both the outputs and the inputs of linear timeinvariant systems. The estimates satisfy the input-output equations and are optimal in a weighted minimum variance sense. It is shown that the true optimum problem is too complicated to allo

A dynamic programming algorithm for sche
A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems
✍ J. Miltenburg; G. Steiner; S. Yeomans 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 812 KB

## A dynamic programming procedure for determining the optimal just-in-time (JIT) production schedule for a mixed-model facility is presented. Compared to previously available optimization methods it substantially reduces computation and storage requirements, enabling practical-sized problems to b

A dynamic programming algorithm for the
A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
✍ Ioachim, Irina; G�linas, Sylvie; Soumis, Fran�ois; Desrosiers, Jacques 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 3 views

This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time windows and additional linear costs on the node service start times. To optimally solve this problem, we propose a new dynamic programming algorithm w