[1] Ge S S, Cui Y J.Dynamic motion planning for mobile robots using potential field method[J].Autonomous Robots, 2002, 13(2):207-222.[2] Csiszar A, Drust M, Dietz T, et al.Dynamic andInteractive Path Planning and Collision Avoidance for an Industrial Robot Using Artificial Potential Field Based Method[M].Berlin:Springer, 2012.413-421.[3] Jaradat M A K, Garibeh M H, Feilat E A.Autonomous mobile robot dynamic motion planning using hybrid fuzzy potential field[J].Soft Computing, 2012, 16(1):153-164.[4] Pan C Z, Lai X Z, Yang S X, et al.An efficient neural network approach to tracking control of an autonomous surface vehicle with unknown dynamics[J].Expert Systems with Applications, 2013, 40(5):1629-1635.[5] Masoud A A.Managing the dynamics of a harmonic potential field-guided robot in a cluttered environment[J].IEEE Transactions on Industrial Electronics, 2009, 56(2):488-496.[6] Pal A, Tiwari R, Shukla A.Modified A*Algorithm for Mobile Robot Path Planning[M].Berlin:Springer, 2012.183-193.[7] Stentz A.Optimal and efficient path planning for partially-known environments[A].Proceedings of the 1994 International Conference on Robotics and Automation[C].San Diego, USA:IEEE Computer Society, 1994.3310-3317.[8] Ferguson D, Stentz A.The delayed D* algorithm for efficient path replanning[A].Proceedings of the 2005 IEEE International Conference on Robotics and Automation, ICRA 2005[C].Barcelona, Spain:IEEE Press, 2005.2045-2050.[9] Devaurs D, Siméon T, Cortés Mastral J.Parallelizing RRT on large-scale distributed-memory architectures[J].IEEE Transactions on Robotics and Automation, 2013, 29(2):571-579.[10] 宋金泽, 戴斌, 单恩忠, 等.一种改进的RRT路径规划算法[J].电子学报, 2010, 38(2A):225-228. SONG Jin-ze, DAI Bin, SHAN En-zhong et al.An improved RRT path planning algorithm[J].Acta Electronica Sinica, 2010, 38(2A):225-228.(in Chinese)[11] Lee J, Kang B Y, Kim D W.Fast genetic algorithm for robot path planning[J].Electronics Letters, 2013, 49(23):1449-1451.[12] 李志海, 付宜利.基于遗传算法的仿生双足爬壁机器人越障运动规划[J].机器人, 2012, 34(6):751-757. LI Zhihai, FU Yi-li.Motion planning of a bio-inspired biped wall climbing robot stepping over obstacles based on genetic algorithm[J].ROBOT, 2012, 34(6):751-757.(in Chinese)[13] Chen X, Kong Y, Fang X, et al.A fast two-stage ACO algorithm for robotic path planning[J].Neural Computing and Applications, 2013, 22(2):313-319.[14] Zhao J, Fu X.Improvedant colony optimization algorithm and its application on path planning of mobile robot[J].Journal of Computers, 2012, 7(8):2055-2062.[15] 陈雄, 赵一路, 韩建达.一种改进的机器人路径规划的蚁群算法[J].控制理论与应用, 2010, 27(6):821-825. Chen Xiong, Zhao Yi-lu, Han Jian-da.An improved ant colony optimization algorithm for robotic path planning[J].Control Theory & Applications, 2010, 27(6):821-825.(in Chinese)[16] 柳长安, 鄢小虎, 刘春阳, 等.基于改进蚁群算法的移动机器人动态路径规划方法[J].电子学报, 2011, 39(5):1220-1224. LIU Chang-an, YAN Xiao-hu, LIU Chun-yang et al.Dynamic path planning for mobile robot based on improved ant colony optimization algorithm[J].Acta Electronica Sinica, 2011, 39(5):1220-1224.(in Chinese)[17] 徐晓晴, 朱庆保.动态环境下基于多人工鱼群算法和避碰规则库的机器人路径规划[J].电子学报, 2012, 40(8):1694-1700. XUXiao-qing, ZHU Qing-bao.Multi-artificial fish-swarm algorithm and a rule library based dynamic collision avoidance algorithm for robot path planning in a dynamic environment[J].Acta Electronica Sinica, 2012, 40(8):1694-1700.(in Chinese)[18] Krishnanand K N, Ghose D.Glowworm swarm optimization for simultaneous capture of multiple local optima ofmultimodal functions[J].Swarm Intelligence, 2009, 3(2):87-124.[19] Wu B, Qian C, Ni W, et al.The improvement of glowworm swarm optimization for continuous optimization problems[J].Expert Systems with Applications, 2012, 39(7):6335-6342.[20] Krishnanand K, Ghose D.Aglowworm swarm optimization based multi-robot system for signal source localization[J].Design and Control of Intelligent Robotic Systems, 2009:49-68.[21] Krishnanand K N, Ghose D.Theoretical foundations for rendezvous of glowworm-inspired agent swarms at multiple locations[J].Robotics and Autonomous Systems, 2008, 56(7):549-569.[22] 周永权, 黄正新, 刘洪霞.求解TSP问题的离散型萤火虫群优化算法[J].电子学报, 2012, 40(6):1164-1170. Zhou Y Q, Huang Z X, Liu H X.Discreteglowworm swarm optimization algorithm for TSP problem[J].Acta Electronica Sinica, 2012, 40(6):1164-1170.(in Chinese)[23] Hart P E, Nilsson N J, Raphael B.A formal basis for the heuristic determination of minimum cost paths[J].IEEE Transactions on Systems Science and Cybernetics, 1968, 4(2):100-107. |