知识与财富的链接
研究机器人在平面区域中绕过静态障碍物到达指定目的地的问题, 分别考虑了路程最短和时间最短两种目标下的最优路径, 给出了计算机自动搜索最优路径的模型和算法。
In this paper, the problems of avoiding static obstacles for robots are discussed. The best routes of shortest path and fastest path are considered separately. The mathematical models and automatic searching algorithms are given.
