← 返回刚才阅读的位置

知识卡片

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

覆盖规划要求访问整个工作区域

理解等级:中级

清扫或涂刷关注工具扫过的区域、重复率与完成时间,不只是起点到目标最短路径。图遍历可覆盖连通节点,但物理工具尺寸、不可达区域和连接移动仍需建模;BFS的访问次序也不天然是一条相邻可执行路线。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      So far, we have only considered the problem of finding a (shortest) path. A variation of the path planning problem is coverage path planning. This is relevant for applications such as cleaning, mowing, or painting and usually aims at minimizing the time to completion and redundancy during coverage. This problem is closely related to the shortest path problem. For example, floor coverage can be achieved

    参考来源

    - 位置:《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) - 结论依据:摘录中关于覆盖规划要求访问整个工作区域的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:So far, we have only considered the problem of finding a (shortest) path. A variation of the path planning problem is coverage path planning. This is relevant for applications such as cleaning, mowing, or painting and usually aims at minimizing the time to completion and redundancy during coverage. This problem is closely related to the shortest path problem. For example, floor coverage can be achieved