Skip to content

This repository converts 2D occupancy grid into a quad tree and implements planning algorithms for mobile robots using quad tree. Planning works much faster on these because each square represents an area with free space and these neighbouring squares are already connected in a graph. This allows for planning paths in large maps.

Notifications You must be signed in to change notification settings

Nisarg236/path_planning_with_quad_trees

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

25 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

path_planning_with_quad_trees

This repository converts 2D occupancy grid into a quad tree and implements planning algorithms for mobile robots using the generated quad tree. Planning works much faster on these because each square represents an area with free space so we can directly trace the path without checking for obstacles inside a square, and the neighbouring squares are already connected in a graph.

below image shows an occupancy grid converted to a quad tree:

image

image

Currently only the graph generation part is made, I will build other functionalities to use the generated path with move_base and update here.

Fork, star, and contribute if you feel it might be useful! 🚀🌟🤖...

About

This repository converts 2D occupancy grid into a quad tree and implements planning algorithms for mobile robots using quad tree. Planning works much faster on these because each square represents an area with free space and these neighbouring squares are already connected in a graph. This allows for planning paths in large maps.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages