Making use of precomputation, algorithm ERAMC simplifies network topology and USES a breadth-first search algorithm with priority to find a transmission path that satisfies multiple constraints.
ERAMC算法利用预先计算来简化网络拓扑,然后采用带优先权的宽度优先搜索算法寻找满足多个限制条件的传输路径。
Then, a heuristic breadth-first search is applied for path planning to find an optimal path from an original position to an aim, directing virtual human walkthrough in environments.
然后,用启发式宽度优先搜索算法进行路径规划,产生从初始位置到目标位置的最优路径,引导虚拟人对环境进行漫游。
Is it because the breadth first search always finds the shortest path?
这是因为广度优先搜索,总能找到最短路径?
应用推荐