| 障碍物群中近似最短路径的搜索算法 |
| |
| 引用本文： | 张法荣. 障碍物群中近似最短路径的搜索算法[J]. 计算机工程, 1999, 25(3): 15-16 |
| |
| 作者姓名： | 张法荣 |
| |
| 作者单位： | 暨南大学计算机科学系 |
| |
| 基金项目： | 国务院侨办重点学科基金 |
| |
| 摘 要： | 介绍一种在障碍物群空间中寻找给定两点之间最短路径的近似算法，北指出了算法何时能取得最短路径。
|
| 关 键 词： | 最优路径 建筑设计 CAD 搜索算法 障碍物群 |
A Searching Algorithm of the Approximately Shortest Path Among Obstacles |
| |
| Zhang Farong. A Searching Algorithm of the Approximately Shortest Path Among Obstacles[J]. Computer Engineering, 1999, 25(3): 15-16 |
| |
| Authors: | Zhang Farong |
| |
| Abstract: | 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. |
| |
| Keywords: | Algorithm Collision Optimal path |
| 本文献已被 CNKI 维普 等数据库收录！ |
