原书出处
Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)
Figure 13.4 Finding a shortest path from “S” to “G” assuming the robot can only travel laterally (not diagonally) with cost one per grid cell using the A* algorithm. Much like Dijkstra, A* evaluates only the cell with the lowest cost but takes an estimate of the remaining distance into account.
原书定位详情
来源: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