Timeline for Path planning for robot car on grid
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 29, 2021 at 17:16 | comment | added | Chuck♦ |
@UjjawalM. - As I stated in the post, I haven't looked hard at your methods beyond the particular error, so I could be wrong here with my guidance, but it looks like you're iterating through all the entries in dist in the minDistance function, so I'm not sure what is going to happen on subsequent calls that would get you lower distances. You don't appear to be recalculating anything that I can see; you just remove an entry from queue and do the same thing over again. Hope this helps!
|
|
| Mar 29, 2021 at 14:47 | comment | added | UJM | thank you for your kind answer. I thought removing 'u' from the queue and saving it to the parent list might work. Cause once I have included that node in the path of the car, it's not necessary to iterate on it('u') again to get the new nodes with a minimum distance of current node. However, I will implement your advice to resolve the issue. Thanks! | |
| Mar 29, 2021 at 14:39 | vote | accept | UJM | ||
| Mar 29, 2021 at 14:23 | history | answered | Chuck♦ | CC BY-SA 4.0 |