规划的复杂性
Complexity of Planning
摘要:
这是机器人百科全书中的一章。它致力于研究机器人运动规划的完全(或精确)算法的复杂性。术语“完成”表示方法保证找到正确的解决方案(我们设置中的运动路径或轨迹),或者报告不存在其他解决方案(例如,不存在可行路径)。复杂性理论是计算机科学中的一个基本工具,用于分析算法的性能,即它们所需的资源量。(虽然复杂度可以表示不同的量,如空间和通信努力,但本章的重点是时间复杂度。)此外,复杂性理论有助于识别需要大量计算时间来解决的“困难”问题。在运动规划的背景下,复杂性理论可以以各种方式派上用场,其中一些在这里进行了说明。
英文摘要:
This is a chapter in the Encyclopedia of Robotics. It is devoted to the study of complexity of complete (or exact) algorithms for robot motion planning. The term ``complete'' indicates that an approach is guaranteed to find the correct solution (a motion path or trajectory in our setting), or to report that none exists otherwise (in case that for instance, no feasible path exists). Complexity theory is a fundamental tool in computer science for analyzing the performance of algorithms, in terms of the amount of resources they require. (While complexity can express different quantities such as space and communication effort, our focus in this chapter is on time complexity.) Moreover, complexity theory helps to identify ``hard'' problems which require excessive amount of computation time to solve. In the context of motion planning, complexity theory can come in handy in various ways, some of which are illustrated here.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。