知识卡片

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

最短路径以累积边代价为准

理解等级:中级

图中路径代价是各边代价之和,边可表示距离、时间或其他任务成本。最少节点数只有在等边权等条件下才等同最小代价;一条看起来直的路线也可能有更高风险或转向开销。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      The problem to find a “shortest” path from one vertex to another through a connected graph is of interest for multiple domains, most prominently network routing, where it is used to find an optimal route for an internet data packet. The term “shortest” here is defined as the minimum cumulative edge cost, which could be physical distance (in a robotic application), delay (in a networking

    参考来源

    - 位置:《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) - 结论依据:摘录中关于最短路径以累积边代价为准的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:The problem to find a “shortest” path from one vertex to another through a connected graph is of interest for multiple domains, most prominently network routing, where it is used to find an optimal route for an internet data packet. The term “shortest” here is defined as the minimum cumulative edge cost, which could be physical distance (in a robotic application), delay (in a networking