原书出处
Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)
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
原书定位详情
来源: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
EPUB SHA-256:e922df804e4bed095a1b85e46ce7c83343b1af42a95fdc39ac9ab4a47b42acb1