Uh oh!
There was an error while loading. Please reload this page.
Adaptive Pathfinding in Partially Observable Dynamic Environments - #114
Closed
Avanatiker wants to merge 43 commits into
Closed
Adaptive Pathfinding in Partially Observable Dynamic Environments#114Avanatiker wants to merge 43 commits into
Avanatiker wants to merge 43 commits into
Conversation
Uh oh!
There was an error while loading. Please reload this page.
Comment on lines
+95
to
+96
| // cost == Double.POSITIVE_INFINITY -> BreakMove(checkingPos, hCost, nodeType, currentFeetY, cost) | ||
| // (currentFeetY - origin.feetY) > player.stepHeight -> ParkourMove(checkingPos, hCost, nodeType, currentFeetY, cost) |
There was a problem hiding this comment.
[nitpick] There is commented-out code for handling special move cases (e.g. BreakMove and ParkourMove). If these are no longer needed, consider removing them to improve code clarity.
Suggested change
| // cost == Double.POSITIVE_INFINITY -> BreakMove(checkingPos, hCost, nodeType, currentFeetY, cost) | |
| // (currentFeetY - origin.feetY) > player.stepHeight -> ParkourMove(checkingPos, hCost, nodeType, currentFeetY, cost) |
Introduce extensive path consistency tests for scenarios with different graph connectivities and blocked nodes using D* Lite. Add graph pruning logic to exclude nodes marked as blocked and enhance debugging utilities for path validation.
Abstracted grid connectivity into reusable methods for cleaner and more flexible code. Enhanced block update listener to skip redundant updates and improved logging clarity. Simplified pathfinding and traversal checks for better maintainability.
Avanatikerforce-pushed
the
feature/pathfinder
branch
from
May 2, 2025 21:04
30dd2c6 to
63bc635Compare
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for freeto join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Introducing an algorithm solving adaptive pathfinding in partially observable dynamic environments using spatial partitioning, iterative pathing using Lazy D* Lite and clearance based path refining using Lazy θ* and Catmull Rom splines.
ToDo: