Open Access
2006 A comparison principle for equations of the Hamilton-Jacobi type in set-membership filtering
A. B. Kurzhanski, P. Varaiya
Commun. Inf. Syst. 6(3): 179-192 (2006).

Abstract

This paper gives comparison principles for first-order PDEs of the Hamilton-Jacobi-Bellman type that arise in the problem of filtering under unknown disturbances with set-membership bounds on the uncertainty. The exact solutions of this problem, given in set-theoretic terms as “information sets,” are expressed as level sets to the solutions of some specific types of the HJB equation. But these solutions require complicated calculations. This paper presents an alternative approach that avoids exact solutions in favor of their upper and lower bounds, which in many cases may suffice for solving the required problems. For systems with linear structure ellipsoidal estimates are given, which ensure tight approximations of the convex information sets.

Citation

Download Citation

A. B. Kurzhanski. P. Varaiya. "A comparison principle for equations of the Hamilton-Jacobi type in set-membership filtering." Commun. Inf. Syst. 6 (3) 179 - 192, 2006.

Information

Published: 2006
First available in Project Euclid: 6 July 2007

zbMATH: 1132.93024
MathSciNet: MR2347284

Keywords: Comparison principle , dynamic programming , ellipsoidal calculus , Guaranteed estimation , HJB equation , information set , information state , reachability , set-membership uncertainty

Rights: Copyright © 2006 International Press of Boston

Vol.6 • No. 3 • 2006
Back to Top