原书出处
Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)
Let 𝒢⊂𝒳 be a d−dimensional sphere in the state space that is considered to be the goal, max_dist the longest permissible edge length, t the allowed time, k the maximum number of vertices to allow in the tree, and goal_bias the percentage of the time the algorithm should try to connect to a goal state. An RRT planner would follow this pseudo-code:
原书定位详情
来源: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