参数化复杂度
充分统计
统计的
外稃(植物学)
统计
极限(数学)
计算机科学
扫描统计信息
功能(生物学)
分离(统计)
数学
算法
生物
进化生物学
数学分析
禾本科
生态学
作者
Juan Blanch,Todd Walter,Per Enge
摘要
One of the most commonly used detection statistics in autonomous integrity monitoring is the solution separation statistic. In this paper, we show that the solution separation statistic is closely linked to the optimal detection statistics. More precisely, we show that in the case of one threat, even multi-dimensional, the optimal detection statistic is the solution separation, and that in the case of many one-dimensional threats, the optimal statistics can be expressed as a function of the solution separations corresponding to each threat. This is achieved by casting the search of the optimal detection region as a mini-max problem and by using the Neyman–Pearson lemma to limit the search of the detection regions to a class of regions parameterized by a bias. These results allow us to establish a lower bound on the minimum achievable integrity risk. Copyright © 2017 Institute of Navigation
科研通智能强力驱动
Strongly Powered by AbleSci AI