Archive Post

A star search on a robot grid map: the cheapest path to the goal over the smaller set of cells it explored
mechatronics.abhishek 0 comments

A* Search Algorithm Explained: f = g + h, Heuristics and Python Code

A* search is the path planner you will meet more…
Read More
Dijkstra algorithm on a robot grid map: the cheapest path around the mud over the cells it explored
mechatronics.abhishek 0 comments

Dijkstra’s Algorithm Explained: Cheapest Paths for Robots, with Python Code

In the first post of this series, breadth first search…
Read More
Breadth first search on a robot grid map: the BFS path from start to goal over the cells it explored
mechatronics.abhishek 0 comments

Breadth First Search (BFS) Explained: Shortest Paths for Robots, with Python Code

A robot that has just been switched on in a…
Read More

About Kritrim Intelligence

Practical articles and research on robotics, AI and data engineering by Abhishek Tyagi. More about me · Get in touch