知识卡片
延迟碰撞检查先搜索后验证候选
Lazy策略暂用未验证边搜索候选路径,再优先检查候选中需要的边,删去无效边后重搜。它减少无用检查,但最终执行路径仍须验证,未检查的边不能被直接宣称已无碰撞;90%耗时只是某类问题经验。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
- · 路径规划
原书出处 · 1 处
- · 查看原书依据
Typically, collision checking takes up to 90 percent of the execution time of a path planning problem; therefore, methods that aim at reducing computational cost are desirable. For example, the “lazy collision evaluation” algorithm differs from standard collision checking in that it does not evaluate every point for a possible collision. Rather, it first finds a suitable path, and only after a path is found
参考来源
- 位置:《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)
- 结论依据:摘录中关于延迟碰撞检查先搜索后验证候选的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:Typically, collision checking takes up to 90 percent of the execution time of a path planning problem; therefore, methods that aim at reducing computational cost are desirable. For example, the “lazy collision evaluation” algorithm differs from standard collision checking in that it does not evaluate every point for a possible collision. Rather, it first finds a suitable path, and only after a path is found