Jump to content
  • Advertisement
Sign in to follow this  
rrlangly

3d shortest path algorithm

This topic is 813 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

I'm familiar with A* and have worked it on a 2D problem (cars). I am now looking to learn about shortest path problems for a 3D space (working with flying a drone) and was hoping someone could tell me what algorithms (simplest) to look at.

 

I'm wanting to take off, fly to an ordered number of way points, and return.
 

thanks,

Share this post


Link to post
Share on other sites
Advertisement

Like someone has said A* works in whatever domain as long as you can represent the data in a way that is compatible with running the A* algorithm on it, if you split your 3D volume into a 3D grid of nodes instead of a 2D grid of nodes that you have used before it will work.

Share this post


Link to post
Share on other sites
Note that depending on your needs there are almost certainly more efficient ways to represent a 3D navigable volume than using a grid of voxels.

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!