Looking for someone to expand my 3D a* pathfinding algorithm with Jump Point Search
$200 USD
Πληρώθηκε κατά την παράδοση
Hello, I'm a game developer working on a 3D sci-fi game in lua. In this game I have a uniform grid of cells. I'm in need of an extremely fast pathfinding algorithm that can find the shortest path between two cells.
I've already implemented a rather small a* pathfinder using a priority heap for open set insertion, but it's just not quite fast enough.
I'm looking for someone to take my existing code and expand upon it with Jump Point Search for optimization. The code I have is small and easy to read and work with.
This shows the massive speed up that can be made by properly implementing JPS into a*
A*: [login to view URL]
A* + JPS: [login to view URL]
This is what I'm wanting.
We'd also be in contact so I can clarify any questions regarding API in the environment I'm working in or other questions.
Below I'll attach the files I've made so far that you'll be working with
Ταυτότητα Εργασίας: #20049804
Σχετικά με την εργασία
4 freelancers κάνουν προσφορές κατά μέσο όρο $244 για αυτή τη δουλειά
Hi wintergreen develops more projects in optimal routing path. suggestion: 1. did you use dijikstra algorithm. it's easy and get better result. I have already check in 2d routing. if you need any clarification Περισσότερα
I have worked on A* algorithm for path planning in 3D workspace for robotics releated project. I may help in this aspect. We can discuss about this in details. We can use other path planning algorithm which are the st Περισσότερα
i am an experienced software engineer would love to assist you ,pay only after you are satisfied with my work you can find my work on play store by searching vivek birana
