Python reproduction of the CP-QRRT* constrained path planning algorithm for hyper-redundant manipulators, with 5 baseline RRT-family planners benchmarked against the original paper's Tables 2 & 3.
The visualiser makes these differences immediately obvious. A* finds the optimal path in milliseconds. RRT may need multiple attempts on the same maze but demonstrates probabilistic completeness — ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results