知识卡片
渐近最优不是有限采样全局最优
RRT*在相应邻域、采样与问题条件下具有渐近改进目标,但每次择父只在当前候选近邻中比较。不能说任何时刻都已让每个节点走全空间最短路径,固定任意邻域半径也不自动满足所有理论条件。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
- · 路径规划
原书出处 · 1 处
- · 查看原书依据
Importantly, following this method does not guarantee that the shortest path will be found. As an alternative known as RRT* grows the tree in a way that always minimizes the overall path length from the root to every vertex. This is done in two steps. First, only points in the tree within a d−dimensional sphere (on a 2D map, d = 2, which is a
参考来源
- 位置:《Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)》第13章《路径规划》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)/_epub-src/OEBPS/xhtml/chapter_13.xhtml)
- 结论依据:摘录中关于渐近最优不是有限采样全局最优的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:Importantly, following this method does not guarantee that the shortest path will be found. As an alternative known as RRT* grows the tree in a way that always minimizes the overall path length from the root to every vertex. This is done in two steps. First, only points in the tree within a d−dimensional sphere (on a 2D map, d = 2, which is a