Skip to content

Solving maze using several state-of-the-art (SOTA) maze-solving approaches, implemented in ROS-Noetic.

Notifications You must be signed in to change notification settings

jordanperrin/maze_solver

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

43 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Maze Solving in ROS

Solving maze using several state-of-the-art (SOTA) maze-solving approaches: Breadth-first search, Depth-first search, Dijkstra's algorithm, A* search algorithm and Wall-follower algorithm.

I uploaded my work from my internship on: Feb 7, 2023.

Environment

  • Ubuntu 20.04.2LTS 64bit
  • ROS-Noetic
  • Gazebo 11
  • Python 3

To Run

  1. Clone this repository
git clone https://github.com/joewong00/maze_solver.git
  1. Create catkin workspace
mkdir -p catkin_ws/src
  1. Link the respective package to your workspace
sudo ln -fs /path_to_this_repo ~/catkin_ws/src
  1. ROS Setup
cd ~/catkin_ws
catkin_make
source ~/catkin_ws/devel/setup.bash
  1. Make main python file executable
chmod a+x ~/catkin_ws/src/maze_solver/scripts/main.py
  1. Launch python file package for different mazes, change the map config in main.py accordingly (map1.yaml)
roslaunch maze_solver maze1.launch

Demo Video

Maze-Solving in ROS


Creating Own Maze

Create and edit the maze in gazebo, save the maze model in path and change accordingly in world and launch files. To create map, one can use Gazebo plugin like the one in https://github.com/marinaKollmitz/gazebo_ros_2Dmap_plugin.git or any other mapping methods. If the map is not too large, one can hard code the grid value (1 for wall and 0 for passage), convert into pgm and create the map yaml file.

About

Solving maze using several state-of-the-art (SOTA) maze-solving approaches, implemented in ROS-Noetic.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Python 86.5%
  • CMake 13.5%