摘要
通过比较几种常见的有障碍物时求最短路径的算法 ,在线探索算法的基础上提出了一种改良的求障碍物群中两点间最短路径的近似算法。
This paper compares several Algorithms for shortest path rounding obstacles and basing on the Line-searching algorithm,brings forward an improved algorithm which can find the approximative shortest path.
出处
《自动化技术与应用》
2003年第1期34-36,共3页
Techniques of Automation and Applications
