知识卡片
只访问一次未必存在可行覆盖路线
Hamilton路径访问每个图顶点恰一次,环还需回起点,某些图根本没有这样的路线。TSP另有最小总成本与访问城市的优化条件,不能把任意Hamilton环直接等同最优TSP;优化版本通常表述为NP难,判定形式才讨论NP完全。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
- · 路径规划
原书出处 · 1 处
- · 查看原书依据
Doing a DFS or a BFS might generate efficient coverage paths, but they are far from optimal as many vertices might be visited twice. A path that connects all vertices in a graph but passes every vertex only once is known as a Hamiltonian path. A Hamiltonian path that returns to its starting vertex is known as a Hamiltonian cycle. This problem is also known
参考来源
- 位置:《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)
- 结论依据:摘录中关于只访问一次未必存在可行覆盖路线的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:Doing a DFS or a BFS might generate efficient coverage paths, but they are far from optimal as many vertices might be visited twice. A path that connects all vertices in a graph but passes every vertex only once is known as a Hamiltonian path. A Hamiltonian path that returns to its starting vertex is known as a Hamiltonian cycle. This problem is also known