TY - JOUR
T1 - A Modified Range Consensus Algorithm Based on GA for Receiver Autonomous Integrity Monitoring
AU - Zhao, Jing
AU - Xu, Chengdong
AU - Jian, Yimei
AU - Zhang, Pengfei
N1 - Publisher Copyright:
© 2020 Jing Zhao et al.
PY - 2020
Y1 - 2020
N2 - With the considerable increase of visible satellites for positioning, the fault detection and identification performance of Range Consensus (RANCO) algorithm for Receiver Autonomous Integrity Monitoring (RAIM) will significantly be improved. However, the calculation amount of RANCO algorithm will exponentially increase for the sharp addition of visible satellite subsets. This paper proposes a modified RANCO algorithm based on genetic algorithm (GA-RANCO) for RAIM to inhibit the exponentially expanded calculation amount. To reduce the calculation amount in searching the optimal minimal necessary subset (MNS), the preselection step is developed to speed up the convergence process of GA-RANCO. It is executed to exclude the chromosome-represented MNS for which the count of faulty satellites will exceed the upper limit of independent simultaneous satellite faults to be monitored. Mathematical simulations are introduced to determine the GA parameters, and simulation experiments under different schemes are designed to evaluate the performance of GA-RANCO algorithm. Results illustrate that the time consumption under a large number of visible satellites of GA-RANCO is much lower than that of RANCO and the faulty detection and identification performance of GA-RANCO is the same as that of RANCO.
AB - With the considerable increase of visible satellites for positioning, the fault detection and identification performance of Range Consensus (RANCO) algorithm for Receiver Autonomous Integrity Monitoring (RAIM) will significantly be improved. However, the calculation amount of RANCO algorithm will exponentially increase for the sharp addition of visible satellite subsets. This paper proposes a modified RANCO algorithm based on genetic algorithm (GA-RANCO) for RAIM to inhibit the exponentially expanded calculation amount. To reduce the calculation amount in searching the optimal minimal necessary subset (MNS), the preselection step is developed to speed up the convergence process of GA-RANCO. It is executed to exclude the chromosome-represented MNS for which the count of faulty satellites will exceed the upper limit of independent simultaneous satellite faults to be monitored. Mathematical simulations are introduced to determine the GA parameters, and simulation experiments under different schemes are designed to evaluate the performance of GA-RANCO algorithm. Results illustrate that the time consumption under a large number of visible satellites of GA-RANCO is much lower than that of RANCO and the faulty detection and identification performance of GA-RANCO is the same as that of RANCO.
UR - http://www.scopus.com/inward/record.url?scp=85087985891&partnerID=8YFLogxK
U2 - 10.1155/2020/8969032
DO - 10.1155/2020/8969032
M3 - Article
AN - SCOPUS:85087985891
SN - 1024-123X
VL - 2020
JO - Mathematical Problems in Engineering
JF - Mathematical Problems in Engineering
M1 - 8969032
ER -