Student_example.py doesn't seem to be very effective

1

Hello,
I have been trying to debug my own motion planner implementation based on Astar search and ended up running some tests comparing the provided example (student_example.py) with the simple Greedy Best First motion planner. I was surprised to see that gbfs solves 19/30 random scenarios, whereas student_example only 3/30. Is the performance of the example really that much poorer compared to its parent motion planner, or do i have to increase the time out time to see some better results.
Thanks so much in advance,
Stella

1 Like
2

Hi Stella,

the provided example planner was randomly chosen from the work of a previous student. The performance can drop if the adopted heuristic function is misleading the search : )

1 Like