知识卡片

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

回退节点按顺序寻找成功方案

理解等级:中级

Selector或Fallback先尝试前面的子节点,失败再试下一项,遇成功立即成功,遇运行则等待该项。书中抓取例先检测已持物,否则才取物,避免无条件重复抓;原文通用遍历段说成功总访问下一子项不能用于回退节点。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      Composite nodes have one or more children and are responsible for regulating the control flow. Three important examples of composite nodes are the sequence node, selector/fallback node, and parallel node. A sequence node executes each of its child nodes in order, returning “Failure” if a single one fails and “Success” after all have finished successfully. A selector (or fallback) node executes each of its child

    参考来源

    - 位置:《Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)》第11章《任务执行》(来源项目: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_11.xhtml) - 结论依据:摘录中关于回退节点按顺序寻找成功方案的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:Composite nodes have one or more children and are responsible for regulating the control flow. Three important examples of composite nodes are the sequence node, selector/fallback node, and parallel node. A sequence node executes each of its child nodes in order, returning “Failure” if a single one fails and “Success” after all have finished successfully. A selector (or fallback) node executes each of its child