Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Electronicsarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Electronics
Article . 2024 . Peer-reviewed
License: CC BY
Data sources: Crossref
versions View all 2 versions
addClaim

Overbounding the Model Uncertainty for Kalman Filter-Based Advanced Receiver Autonomous Integrity Monitoring in the Presence of Time Correlation by the Hybrid Evolutionary Algorithm

Authors: Hengwei Zhang; Yiping Jiang;

Overbounding the Model Uncertainty for Kalman Filter-Based Advanced Receiver Autonomous Integrity Monitoring in the Presence of Time Correlation by the Hybrid Evolutionary Algorithm

Abstract

Overbounding the integrity risk is a significant challenge for Kalman filter (KF)-based advanced receiver autonomous integrity monitoring (ARAIM) when the measurement error has an uncertain time correlation. Thus, this paper presents a method that addresses this challenge by effectively bounding the integrity risk for KF-based ARAIM while considering the uncertainty in the model of the time-correlated error. Firstly, the recursive equation for covariance is derived, establishing a direct mathematical expression that links the integrity risk and the correlation time constant. Subsequently, a min–max optimization model is constructed, utilizing the obtained expression as the objective function, to simultaneously bound the integrity risk and reduce conservatism. To effectively address the current min–max optimization problem, a hybrid evolutionary algorithm is proposed, which conducts global searching followed by local searching. The simulation result demonstrates that it outperforms other algorithms, enabling rapid attainment of the minimum upper bound on the integrity risk.

Related Organizations
Keywords

overbounding, evolutionary algorithm, Kalman filter, uncertain time correlation

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
gold