A Convex Optimization Framework for Computing Robustness Margins of Kalman Filters
<|reference_start|>A Convex Optimization Framework for Computing Robustness Margins of Kalman Filters: This paper proposes a novel convex optimization framework for designing robust Kalman filters that guarantee a user-specified steady-state error while maximizing process and sensor noise. The proposed framework simultaneously determines the Kalman gain and the robustness margin in terms of the process and sensor noise. This is the first paper to present such a joint formulation for Kalman filtering. The proposed methodology is validated through two distinct examples: the Clohessy-Wiltshire-Hill equations for a chaser spacecraft in an elliptical orbit and the longitudinal motion model of an F-16 aircraft.<|reference_end|>
@article{prabhat2024a,
    title={A Convex Optimization Framework for Computing Robustness Margins of
  Kalman Filters},
    author={Himanshu Prabhat and Raktim Bhattacharya},
    journal={arXiv preprint arXiv:2403.02996},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.02996},
    primaryClass={eess.SY cs.SY math.OC stat.AP}
}