知识卡片
椭球限域依赖路径代价下界
若优化欧氏路径长度,任何能改善当前成本c的点须满足到起点与终点距离和小于c,因此可在相应椭球内重点采样。对时间、风险或其他代价,不能直接套相同几何范围;使用下界筛选需保持其可采纳性。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
- · 路径规划
原书出处 · 1 处
- · 查看原书依据
Once a possible path is found, the sampling space can be reduced to an ellipsoid that bounds the maximal path length. This ellipsoid can be constructed by mounting a wire of the maximum path length between start and goal and pushing it outward with a pen. Intuitively, only points that are contained by this ellipsoidal area can provide a shorter path than the one currently
参考来源
- 位置:《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)
- 结论依据:摘录中关于椭球限域依赖路径代价下界的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:Once a possible path is found, the sampling space can be reduced to an ellipsoid that bounds the maximal path length. This ellipsoid can be constructed by mounting a wire of the maximum path length between start and goal and pushing it outward with a pen. Intuitively, only points that are contained by this ellipsoidal area can provide a shorter path than the one currently