Local search is a common approximate search algorithm.
局部搜索算法是一种通用的近似搜索算法。
The proposed algorithm consists of three processes, approximate search, descent search and subtle search.
该算法分三个阶段：粗搜索阶段、下降搜索阶段和细搜索阶段。
It means to search an optimal or approximate optimal free path from start state to target state according to some optimize criterion.
它是按照某一优化指标规划出一条从起始状态到目标状态的最优或者近似最优的无碰路径。
应用推荐