JIANG Shun|liang1,FAN Qin|ru2(1.College of Computer and Information Engineering, Nanchang University,Nanchang 330029,China;2.College of Communication and Science ,Technology institute of NingBo, Zhejiang University, Ningbo 315100,China)
Abstract：The authors proposed a method to solve the global path planning and locally optimize the path. With the method, the shortest distance of one node is estimated by the shortest distance of two neighbor nodes and its geometric information, then the shortest
江顺亮; 范勤儒. 基于空间离散的最短路径求解法及其局部优化方法[J]. 南昌大学学报（理科版）, 2003, 27(02): 1-.
JIANG Shun|liang1,FAN Qin|ru2(1.College of Computer and Information Engineering, Nanchang University,Nanchang 330029,China;2.College of Communication and Science ,Technology institute of NingBo, Zhejiang University, Ningbo 315100,China). . , 2003, 27(02): 1-.
2003, Vol. 27 