Results over 30 seeds
Every route was planned once per seed with each planner. Click a row to watch it above. Each dot is one RRT* run. The yellow line is A*, which is the same in every run.
| Route | A* (m) | RRT* mean (m) | RRT* best / worst (m) | All runs | Median time, A* / RRT* (ms) |
|---|
What I found
A* found the shorter path on average on every route, and it found the same path every time. RRT* was less predictable. From the kitchen to the bedroom it took the short hallway in only of 30 runs and drove around through the bathroom in the rest. That hallway is narrow and has a bend, so random points rarely land inside it before the trees meet another way.
A* is not always shortest. From the bathroom to the bedroom the best RRT* run ( m) beat A* ( m), because A* can only step between neighbouring grid cells while RRT* can connect points at any angle.
RRT* was usually faster here, but that is mostly the grid. Most of A*'s time goes into building the grid, not into the search. In a small house that is cheap. In a large map, or one that changes often, the grid has to be rebuilt every time and that cost grows.
Limits
This is one small 2D world with a round robot that drives along the path at constant speed. The robots do not sense anything. When the hallway closes they are told about it and plan again from scratch. The RRT* in PyRoboSim stops as soon as its trees connect, so it does not keep improving its path with extra time the way RRT* can. Times were measured on one laptop and change from machine to machine. Path lengths do not.