← 返回刚才阅读的位置

知识卡片

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

按最小总代价扩展节点

理解等级:中级

维护每节点从起点的最佳已知代价,取未确定节点中最小者扩展并松弛相邻边。适用于非负边权,目标被最小代价弹出确定时可停止;不是一发现连到目标的边就已证明最优。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      One of the earliest and simplest algorithms for path planning is Dijkstra’s algorithm (Dijkstra 1959). Given a graph, Dijkstra is an iterative process where, starting from the “start” vertex, the algorithm marks all its direct neighbors with the cost to reach them. It then proceeds to inspect the neighboring vertex with the lowest cost and all its adjacent vertices and marks them with the cost

    参考来源

    - 位置:《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) - 结论依据:摘录中关于按最小总代价扩展节点的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:One of the earliest and simplest algorithms for path planning is Dijkstra’s algorithm (Dijkstra 1959). Given a graph, Dijkstra is an iterative process where, starting from the “start” vertex, the algorithm marks all its direct neighbors with the cost to reach them. It then proceeds to inspect the neighboring vertex with the lowest cost and all its adjacent vertices and marks them with the cost