Shortest Path algorithm (A*Path)

Grasshopper
1

Guys, I want to optimace the path from a start point to an end point. the surface is irregular and have some “obstacles” which are the “webs” (curves) that I need to avoid. I wanted to use the shortest walk plug-in, but I’m having troubles constructing an appropriate grid and how to implement the obstacles, I was thinking in a way to “took out” the points on the grid that are close or on the obstacles to then just have a “walkable” grid.

I also try with python but is hard to me. I found a lot of tutorials applied to regular python but none for grasshopper python.

0724_Pathfinding.gh (22.8 KB)

2

Hi,

it seems there is nothing internalized in your file.

Using a graph you would just not construct the edges or flag them in a bool array as unwalkable.

3

Ohh i’m sorry, now is internalized

4

its not really accurate:

grafik
grafik1535×651 78.5 KB

0724_Pathfinding_r.gh (17.1 KB)

5

Thanks anyways, I would have a look at it

6

Missed the part with the webs, blame the heat and the beer,hehe.
Also I am sure there is a better way, anyway, have a look at this:

grafik
grafik1635×611 88.2 KB

0724_Pathfinding_r2.gh (20.3 KB)

1 Like
7

Use collision component

Pathfinding2.gh (20.5 KB)

image
image1762×763 106 KB

4 Likes