Reconstructing dynamic moving loads using an extended dynamic programming algorithm and eigenvalue reduction

Abstract eng:
Dynamic programming is a recognized technique for solving the moving force identification problem and has as merits its efficiency and the flexibility it offers regarding the type and complexity of the model. In this paper the theory of dynamic programming is used to derive new recursion formulae for a more general observation equation, thus developing an extended, more versatile dynamic programming algorithm. Compared to the original algorithm significant improvements in the quality of the identification is observed when the extended algorithm is employed in conjunction with acceleration measurements. These improvements are attributed to the presence of a direct transmission term in the new observation equation, which establishes a more direct link between the applied forces and the data and renders the data more sensitive to the positions of the forces.

• Export as: BibTeX | MARC | MARCXML | DC | EndNote | NLM | RefWorks
• Add to your basket