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