← 返回刚才阅读的位置

知识卡片

普通读书笔记卡 · 9190.b · 生成模型:GPT-6

采样规划以有限候选探索自由空间

理解等级:中级

RRT或PRM用采样构型与局部连接探索可行路径,减少显式枚举高维网格。概率完备需满足采样覆盖、连接与可行路径等前提,有限时间未找到路径不证明无解;它也不等于所有采样方法都必有该理论保证。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      Sampling-based planners are an alternative to graph-based planners that evaluate all possible solution and non-complete Jacobian-based inverse kinematic solutions. In sampling-based motion planning, possible paths are generated by random sampling and stored in a tree-like structure until some solution is found or the allotted time expires. As the probability to find a path approaches one when the number of samples goes to infinity, sampling-based path

    参考来源

    - 位置:《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) - 结论依据:摘录中关于采样规划以有限候选探索自由空间的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:Sampling-based planners are an alternative to graph-based planners that evaluate all possible solution and non-complete Jacobian-based inverse kinematic solutions. In sampling-based motion planning, possible paths are generated by random sampling and stored in a tree-like structure until some solution is found or the allotted time expires. As the probability to find a path approaches one when the number of samples goes to infinity, sampling-based path