Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[WIP] Astar pathfinding #552

Open
wants to merge 19 commits into
base: master
Choose a base branch
from
Open

Conversation

stefanhendriks
Copy link
Owner

Work in Progress for improving path finder.

- still does not work properly though
- do not look for neighbours by memory address, but using isAt() function (location based)
- does not seem to 'overwrite' neighbour yet, but it does find the "closed set" one???
- stop evaluating neighbours when they get too far away
- remember closest found best node; for cases where we can't go closer (due to goal being on an unreachable place)
…in value for x and y

- this way we can get the nearest/best cell close to the "invalid" coordinate
- this yields better results
- also remember 'cell' value so we don't need to re-calculate it everytime
- speeds up some parts times 2, but still too slow for multiple units
- make sure creation of profiler is not done within profiler itself, as it takes 40ms to open file and such
- is faster
- based on OneLoneCoder's implementation
- check for visibility to determine blocked or not
- set cost values before pushing into priority_queue
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant