Sign in to follow this  

Pathfinding in pseudo-isometry

Recommended Posts

Greetings to all.

I'm looking for an advice or directions for my pathfinding problem.
Game has a continuos space with static and dynamic obstacles.

Link for image -

Red color is used for static obstacles, and green for dynamic ones.
Game agent path should should be calculated without collisions with colored rectangles that are representing obstacles.

There is no need to find shortest path to target.
Amount of dynamic obstacles, i.e. agents, would be equal or greater (30+) than amount of static ones.

Looking for an advice, hint for an feasible algoritm or some direction, there i should look to solve this problem.

Share this post

Link to post
Share on other sites
I'd agree with steering behaviors as far as avoiding dynamic obstacles, but since I assume that the dynamic obstacles are what you are moving through the map, I'd use Greedy Best First Search for the static obstacles.

Share this post

Link to post
Share on other sites
Thanks for answers.
I learned about presented paths to complete the task, and chosen to go with potential field method (got pointed to it at another forum).

It solved all pressing issues with movement and presented nice side bonuses as a reward. If someone interested he can learn it here -

Peace to all.

Share this post

Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

Sign in to follow this