原书出处
Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)
Intuitively, the new point q_rand should be connected to the closest point already in the tree or to the goal. This requires iterating over all nodes in the tree and calculating their distance to the candidate point q_rand, which is a computationally expensive process; the resulting point q_nearest is the one with the shortest distance. The selection of the right data structure for storing the
原书定位详情
来源: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