Dynamic Programming / Flood Fill Algorithm

preview_player
Показать описание
Рекомендации по теме
Комментарии
Автор

Hi there
This algorithm is only good when the robot "knows" the target destination position. In real life it is a different case. The Robot knows only what it can "see" in real life and does not know the distance, nor does it know the destination position.

HeinrichChristiansen
Автор

Good explanation! One correction, that's not a flood fill but the A* Pathfinding algorithm. It's the best algorithm you could use to solve a problem of this nature

balorprice
Автор

dynamic programming is actually something else... but you can use dynamic programming to implement flood fill

camdenparsons
Автор

How to implement this in arduino? Where is the next video?

muhammadateebaslam
Автор

IDK why but the way you put the numbers reminds me of MINESWEEPER LOL

mannacharya
Автор

Thanks a lot. Came here Wondering about Micromouse

apontutul
Автор

Start with the target cell??? Im so confused

peaceforwhat
Автор

Isn't this just the breadth-first search algorithm?

gast
Автор

THiS is not dp, this is BFS in tabulation,

utsavkumar
Автор

This method is Awesome, thanks a lot dude!!

BR

vinaciotm
Автор

Isnt this what backtracking algorithm does?

derciferreira
Автор

Isn’t this just like the A* search algorithm, I don’t really understand the difference between this algorithm and A*. If anyone knows the difference, I’d appreciate it if you told me it.

hecticfn
Автор

U easily mark from end but robot do from beginning, confused!?

pc-knkt
Автор

This was pretty useless. If you do t know something why wasting others time?

abdolreza