scispace - formally typeset
Search or ask a question
Author

Joao Y. Ishihara

Bio: Joao Y. Ishihara is an academic researcher from University of Brasília. The author has contributed to research in topics: Kalman filter & Discrete time and continuous time. The author has an hindex of 20, co-authored 137 publications receiving 1661 citations. Previous affiliations of Joao Y. Ishihara include University of São Paulo & University of California, Los Angeles.


Papers
More filters
Journal ArticleDOI
TL;DR: With the proposed systematization of the Unscented Kalman Filter theory, the symmetric sets of sigma points in the literature are formally justified, and the proposed SRUKF has improved computational properties when compared to state-of-the-art methods.
Abstract: In this paper, we propose a systematization of the (discrete-time) Unscented Kalman Filter (UKF) theory. We gather all available UKF variants in the literature, present corrections to theoretical inconsistencies, and provide a tool for the construction of new UKF's in a consistent way. This systematization is done, mainly, by revisiting the concepts of Sigma-Representation, Unscented Transformation (UT), Scaled Unscented Transformation (SUT), UKF, and Square-Root Unscented Kalman Filter (SRUKF). Inconsistencies are related to 1) matching the order of the transformed covariance and cross-covariance matrices of both the UT and the SUT; 2) multiple UKF definitions; 3) issue with some reduced sets of sigma points described in the literature; 4) the conservativeness of the SUT; 5) the scaling effect of the SUT on both its transformed covariance and cross-covariance matrices; and 6) possibly ill-conditioned results in SRUKF's. With the proposed systematization, the symmetric sets of sigma points in the literature are formally justified, and we are able to provide new consistent variations for UKF's, such as the Scaled SRUKF's and the UKF's composed by the minimum number of sigma points. Furthermore, our proposed SRUKF has improved computational properties when compared to state-of-the-art methods.

210 citations

Journal ArticleDOI
TL;DR: It is shown that the Lyapunov equation of the work by Lewis can lead to incorrect conclusion about stability, and an attempt to correct that theorem with a generalized Lyap unov equation similar to the original one leads naturally to the generalized equation of Takaba et al.
Abstract: In this paper, we revisit the Lyapunov theory for singular systems. There are basically two well-known generalized Lyapunov equations used to characterize stability for singular systems. We start with the Lyapunov theorem of the work by Lewis. We show that the Lyapunov equation of that theorem can lead to incorrect conclusion about stability. Some cases where that equation can be used are clarified. We also show that an attempt to correct that theorem with a generalized Lyapunov equation similar to the original one leads naturally to the generalized equation of Takaba et al.

207 citations

Journal ArticleDOI
TL;DR: It is shown that the equivalence between impulse controllability (observability) and the existence of an impulse eliminating semistate feedback (output injection) gain, although true for square descriptor systems, does not hold for rectangular descriptor systems in general.
Abstract: The presence of impulsive responses in descriptor systems and how it relates to impulse controllability and impulse observability is considered. It is shown that the equivalence between impulse controllability (observability) and the existence of an impulse eliminating semistate feedback (output injection) gain, although true for square descriptor systems, does not hold for rectangular descriptor systems in general. Hence, necessary and sufficient conditions for the existence of an impulse eliminating semistate feedback (output injection) gain are presented.

137 citations

Journal ArticleDOI
TL;DR: This note is concerned with the problem of state estimation for descriptor systems subject to uncertainties and a Kalman type recursive algorithm is derived.
Abstract: This note is concerned with the problem of state estimation for descriptor systems subject to uncertainties. A Kalman type recursive algorithm is derived. Numerical examples are included to demonstrate the performance of the proposed robust filter

88 citations

Journal ArticleDOI
TL;DR: A robust recursive regulator for linear discrete-time systems, which are subject to parametric uncertainties, is proposed and a quadratic cost function based on the combination of penalty function and robust weighted least-squares methods is formulated.
Abstract: In this technical note, a robust recursive regulator for linear discrete-time systems, which are subject to parametric uncertainties, is proposed. The main feature of the optimal regulator developed is the absence of tuning parameters in online applications. To achieve this purpose, a quadratic cost function based on the combination of penalty function and robust weighted least-squares methods is formulated. The convergence and stability proofs for the stationary system and a numerical comparative study among the standard linear quadratic regulator, guaranteed cost and H ∞ controllers are provided.

70 citations


Cited by
More filters
Book
16 Dec 2017

1,681 citations

01 Jan 2015
TL;DR: This compact, informal introduction for graduate students and advanced undergraduates presents the current state-of-the-art filtering and smoothing methods in a unified Bayesian framework and learns what non-linear Kalman filters and particle filters are, how they are related, and their relative advantages and disadvantages.
Abstract: Filtering and smoothing methods are used to produce an accurate estimate of the state of a time-varying system based on multiple observational inputs (data). Interest in these methods has exploded in recent years, with numerous applications emerging in fields such as navigation, aerospace engineering, telecommunications, and medicine. This compact, informal introduction for graduate students and advanced undergraduates presents the current state-of-the-art filtering and smoothing methods in a unified Bayesian framework. Readers learn what non-linear Kalman filters and particle filters are, how they are related, and their relative advantages and disadvantages. They also discover how state-of-the-art Bayesian parameter estimation methods can be combined with state-of-the-art filtering and smoothing algorithms. The book’s practical and algorithmic approach assumes only modest mathematical prerequisites. Examples include MATLAB computations, and the numerous end-of-chapter exercises include computational assignments. MATLAB/GNU Octave source code is available for download at www.cambridge.org/sarkka, promoting hands-on work with the methods.

1,102 citations

Journal ArticleDOI
01 Mar 1970

1,097 citations