空基伪卫星组网部署的航路规划算法

发布时间：2018-05-24 08:57

本文选题：导航增强 + 空基伪卫星　；参考：《北京航空航天大学学报》2016年07期

【摘要】：针对以临近空间飞艇为平台的空基伪卫星组网问题,提出了一种空基伪卫星从初始位置到目标位置进行组网部署的航路规划算法。首先,通过梳理空基伪卫星组网的性能指标,设计了基于距离和几何精度因子(GDOP)的航路规划代价函数;然后,对航路规划的约束条件进行了分析,在稀疏A*算法的基础上,设计了距离代价和GDOP代价权重可自适应调整的空基伪卫星航路规划算法,并对规划出的航路采用Dubins曲线进行平滑;最后,通过仿真实验,对提出的航路规划算法进行了验证。仿真实验结果表明,航路规划算法在GDOP较恶劣的情况下,能够有效地在后续的航路规划中降低GDOP代价,提高用户定位精度;而在GDOP较为良好时,则可以增加距离代价的权重,在航路规划时使伪卫星尽快向目标位置收敛,减少时间消耗。
[Abstract]:In order to solve the problem of space-based pseudosatellites networking based on near space airship, a route planning algorithm for space-based pseudosatellites from the initial position to the target position is proposed. Firstly, the cost function of route planning based on distance and geometric precision factor (GDOP) is designed by combing the performance index of space-based pseudosatellite network, and then the constraint conditions of route planning are analyzed based on sparse A * algorithm. An adaptive space-based pseudosatellite route planning algorithm which can adjust the distance cost and GDOP cost weight is designed, and the Dubins curve is used to smooth the planned route. Finally, the proposed route planning algorithm is verified by simulation experiments. The simulation results show that the route planning algorithm can effectively reduce the GDOP cost and improve the user positioning accuracy in the subsequent route planning under the condition of GDOP, but when the GDOP is better, the weight of the distance cost can be increased. In route planning, pseudosatellites converge to the target position as soon as possible, reducing time consumption.
【作者单位】：中国科学院光电研究院;
【基金】：国家自然科学基金(91438207)~~
【分类号】：V249

【相似文献】