知识卡片
拓扑地图将可通行关系抽成图
把区域或地点作为节点、可导航连接作为边,可支持高层路径搜索。节点也能带几何坐标,边能标距离或代价;拓扑与度量可组合,不是互斥选择,区域大小不同也不自动足以定义正确连通关系。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
- · 建图
原书出处 · 1 处
- · 查看原书依据
In order to plan a path, we need to represent the environment digitally. We differentiate between two complementary approaches: discrete and continuous approximations. In a discrete approximation, a map is sub-divided into sections of equal (e.g., a grid or hexagonal map) or differing sizes (e.g., rooms in a building). The latter maps are also known as topological maps or graph-based maps. Discrete maps lend themselves
参考来源
- 位置:《Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)》第12章《建图》(来源项目: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_12.xhtml)
- 结论依据:摘录中关于拓扑地图将可通行关系抽成图的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:In order to plan a path, we need to represent the environment digitally. We differentiate between two complementary approaches: discrete and continuous approximations. In a discrete approximation, a map is sub-divided into sections of equal (e.g., a grid or hexagonal map) or differing sizes (e.g., rooms in a building). The latter maps are also known as topological maps or graph-based maps. Discrete maps lend themselves