知识卡片

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

发现目标与最短运输是两阶段

理解等级:中级

无地图时先探索并定位目标,之后可在已知可行图上求返回出口的短路径,供多次搬运复用。两阶段目标不同,探索代价与运输代价需分开统计;找到目标不自动说明已知道全局最短路。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      Before we move forward to discuss potential strategies for robots with impeded sensory systems, let’s rely on a little bit on what we know from studying algorithms and briefly consider a particular strategy. You will need to explore the maze without entering any branch twice. You can use a technique known as depth-first search to do this, but you will need to be able to

    参考来源

    - 位置:《Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)》第01章《导论》(来源项目: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_1.xhtml) - 结论依据:摘录中关于发现目标与最短运输是两阶段的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:Before we move forward to discuss potential strategies for robots with impeded sensory systems, let’s rely on a little bit on what we know from studying algorithms and briefly consider a particular strategy. You will need to explore the maze without entering any branch twice. You can use a technique known as depth-first search to do this, but you will need to be able to