search

vss2sn / path_planning

This repository contains path planning algorithms in C++ for a grid based search.
https://vss2sn.github.io/path_planning/
BSD 3-Clause "New" or "Revised" License
388 stars 97 forks source link

Grid size & obstacle probability #4

Closed kidist-123 closed 1 year ago

kidist-123 commented 1 year ago

Hey, this is kidist , I want to run the algorithms on the large grid size and the obstacle probability is 1/n .So, does it mean the number of obstacles will decrease as we increase the grid size n ? Thank you !

vss2sn commented 1 year ago

No, as the number of points on the grid scales by n*n. The grid might look sparser as the ratio of the number of obstacles to points on the grid will decrease with an increasing n.