Skip to content

This project showcases a tank robot that can autonomously navigate a 5x5 grid, avoid obstacles, and determine the most optimal path using two different search algorithms.

Notifications You must be signed in to change notification settings

nnamanx/tank-robot-pathfinding-using-a-star-and-greedy-search

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Tank Robot Pathfinding Using A* and Greedy Best-First Search

Project Overview

This project showcases a tank robot that can autonomously navigate a 5x5 grid, avoid obstacles, and determine the most optimal path using two different search algorithms:

  • A Algorithm* – Balances actual movement cost and heuristic estimates to find the shortest path.
  • Greedy Best-First Search – Focuses solely on the heuristic, making fast but sometimes suboptimal decisions.

From just an Arduino, a gyroscope, and a handful of wires, we built this smart navigation system from scratch!


Features

✔️ Autonomous Pathfinding – The tank finds its way from start to goal.
✔️ Algorithm Comparison – Tests A* vs. Greedy Best-First Search for efficiency.
✔️ Arduino-Controlled – Powered by an Arduino Uno and sensors.


🛠️ Components Used

Component Purpose
Arduino Uno Main controller for the robot.
Gyroscope (IMU Sensor) Tracks orientation and movement.
Motor Driver Controls the tank wheels.
LiPo Battery Powers the system.
Wheels & Chassis Forms the base of the tank.

📖 Lessons Learned

Pathfinding isn’t just about speed—heuristics can sometimes mislead.

Hardware debugging is a test of patience. 🛠

Exploring AI in robotics is incredibly fun.

About

This project showcases a tank robot that can autonomously navigate a 5x5 grid, avoid obstacles, and determine the most optimal path using two different search algorithms.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages