障碍物群中近似最短路径的搜索算法

A Searching Algorithm of the Approximately Shortest Path Among Obstacles

介绍一种在障碍物群空间中寻找给定两点之间最短路径的近似算法，并指出了算法何时能取得最短路径。

This paper introduces a new searching algorithm for the approximately shortest path between two given points among obstacles,and indicates when the algorithm gets the shortest path.