search

jvirdi2 / A_star_and_Hybrid_A_star

Given a graph, A* finds the optimal path, if it exists, joining the start node to the goal node. Hybrid A* takes vehicle dynamics into consideration and generates a smoother path which the vehicle can follow. Both the implementations are optimized using dictionaries & heaps
23 stars 5 forks source link

about the map #1

Closed allenhsu6 closed 4 years ago

allenhsu6 commented 4 years ago

How is a complex obstacle created? For example the case2,3,4.png. Is it manually set the obstacle points in the program? Whether there is a program to randomly generate a map of complex obstacles?

jvirdi2 commented 4 years ago

Yes, so the version that I put up on GitHub, there you have to manually enter how obstacles are shaped.

The obstacles in the case images that I have shown were provided to us separately to test the algorithms

Jasvir

On Mon, Apr 20, 2020, 9:43 AM allenhsu notifications@github.com wrote:

How is a complex obstacle created? For example the case2,3,4.png. Is it manually set the obstacle points in the program? Whether there is a program to randomly generate a map of complex obstacles?

— You are receiving this because you are subscribed to this thread. Reply to this email directly, view it on GitHub https://github.com/jvirdi2/A_star_and_Hybrid_A_star/issues/1, or unsubscribe https://github.com/notifications/unsubscribe-auth/AKTTOXNIO6G3WKGWRNKWSXTRNRNPLANCNFSM4MMP6K2A .