知识卡片
路线图与搜索树有不同使用倾向
PRM常先构建可复用的自由构型图,再对多次起终点查询搜索;RRT常围绕一组起终点扩展树。PRM一般是图而非必须树,这种单次与多次查询区分也存在变体,需按环境是否变化选方案。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
- · 路径规划
原书出处 · 1 处
- · 查看原书依据
An example execution of RRT is shown in figure 13.5; in essence, RRT grows a single tree from a robot’s starting point until one of its branches hits a goal. This example illustrates how a sampling-based planner can quickly explore a large portion of space and refine a solution over time. Conversely, probabilistic roadmaps create a tree by randomly sampling points in the state space,
参考来源
- 位置:《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)
- 结论依据:摘录中关于路线图与搜索树有不同使用倾向的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:An example execution of RRT is shown in figure 13.5; in essence, RRT grows a single tree from a robot’s starting point until one of its branches hits a goal. This example illustrates how a sampling-based planner can quickly explore a large portion of space and refine a solution over time. Conversely, probabilistic roadmaps create a tree by randomly sampling points in the state space,