← 返回卡片

原书出处

Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)

核验版本的摘录快照 · 导入于 2026-11-14T16:15:54.405Z

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

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源: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

EPUB SHA-256:e922df804e4bed095a1b85e46ce7c83343b1af42a95fdc39ac9ab4a47b42acb1