search

udacity / sdc-issue-reports

29 stars 6 forks source link

Describe and explain the hybrid-A* algorithm #981

Closed fantauzzi closed 6 years ago

fantauzzi commented 7 years ago

With reference to Term 3, Lesson 5, please consider to provide a description of the (complete) hybrid-A* algorithm. That might include the algorithm in pseudo-code; see for instance the third page of this paper . Prof. Thrun's video clip slapped in there doesn't do: e.g. he starts updating the state without saying how to choose theta. In fact, from his presentation it looks like you do it for a fixed theta, while you do it multiple times, for different values of theta, and need to explain how you choose them. Then one needs to know ho to update the list of open and the list of closed states. And so on.

baumanab commented 7 years ago

We are looking into this. There may be some existing AIND content that could be re-purposed.

baumanab commented 7 years ago

It looks like we don't have content to repurpose so we will likely add some classroom notes to explain the algorithm. Here is a link that may be useful. http://blog.habrador.com/2015/11/explaining-hybrid-star-pathfinding.html

swwelch commented 7 years ago

I just added a solution for the quiz, but we can still add pseudocode before the quiz as well.

baumanab commented 7 years ago

@fantauzzi does this help resolve this issue?

swwelch commented 6 years ago

I've also added pseudocode here, so I'll close this issue. Please open another issue if further changes are necessary!