[1] |
Mingliang Xu, Zhigeng Pan, Hongxing Lu, et al.Moving-Target Pursuit Algorithm Using Improved Tracking Strategy[J]. IEEE Transactions on Computational Intelligence and AI in Games (S1943-068X), 2010, 2(1): 27-39.
|
[2] |
Chong Jin Ong.Distance Computation between Smooth Convex Objects[C]// Proceedings of IEEE International Conference on Robotics and Automation, Minnesota, USA. USA: IEEE, 1996: 785-790.
|
[3] |
石祥滨, 赵鑫, 刘芳, 等. MMOG中NPC的路径搜索算法的研究[J]. 小微型计算机系统, 2006, 27(12): 2206-2211.
|
[4] |
钟瑛, 许明. 融合A*和Bresenham的游戏路径规划算法设计与实现[J]. 电子技术与软件工程, 2013 (9): 64-66.
|
[5] |
王树西, 吴政学. 改进的Dijkstra最短路径算法及其应用研究[J]. 计算机科学, 2012, 39(5): 223-228.
|
[6] |
Mark L Psiaki.Block Acquisition of weak GPS signals in a software receiver[C]// The Institute of Navigation, Salt Lake City, USA. USA: IEEE, 2001: 2838-2850.
|
[7] |
侯燕. Steiner树遗传蚁群算法在路径选择中的应用[J]. 微电子学与计算机, 2013, 30(11): 88-92.
|
[8] |
Tsui J B.Fundamentals of Global Positioning System Receivers: A Software Approach[M]. New York, USA: Wiley, 2000.
|
[9] |
王海雄, 郭剑毅, 张月红. 改进遗传算法求解交通最优路径的实现[J]. 昆明理工大学学报(理工版), 2009, 34(4): 42-46.
|
[10] |
Gunes M, Sorges U, Bouazizi I.ARA the Ant Colony based Routing Algorithm for MANETs[C]// International Conference on Parallel Processing Workshop (SICPPW02). Vancouver BC, Canada: IEEE, 2002: 79-85.
|
[11] |
张敏捷, 蔡延光, 宋康, 等. 基于改进遗传算法的路网路径优化方法[J]. 微计算机信息, 2010, 26(2): 226-227.
|
[12] |
张本群. 基于启发式算法的路径规划[J]. 计算机仿真, 2012, 29(10): 341-344.
|
[13] |
邱敏, 王公宝, 张松涛, 等. 一种求解最优路径的改进遗传算法[J]. 计算机与现代化, 2010 (4): 6-8.
|