← 返回刚才阅读的位置

知识卡片

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

DFS生成树不保证最短路径

理解等级:中级

深度优先搜索得到一棵生成树,树上两节点只有一条路径,但它未必是原图最短路径,也不是最小生成树。无权图最短路可用BFS,非负权图可用Dijkstra;非树测量约束仍应保留。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      This can be addressed by constructing a minimum spanning-tree (MST) of the constraint graph. The MST is constructed by doing a depth-first search (DFS) on the constraint graph following odometry constraints. At a loop-closure, (i.e., an edge in the graph that imposes a constraint to a previously seen pose), the DFS backtracks to this node and continues from there to construct the spanning-tree. Updating all

    参考来源

    - 位置:《Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)》第17章《同时定位与建图》(来源项目: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_17.xhtml) - 结论依据:摘录中关于DFS生成树不保证最短路径的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:This can be addressed by constructing a minimum spanning-tree (MST) of the constraint graph. The MST is constructed by doing a depth-first search (DFS) on the constraint graph following odometry constraints. At a loop-closure, (i.e., an edge in the graph that imposes a constraint to a previously seen pose), the DFS backtracks to this node and continues from there to construct the spanning-tree. Updating all