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.

Sign up for GitHub

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

Jump to bottom

Evaluate diffrent Fast Downward Heuristics #16

Open
lotu opened this issue Mar 31, 2012 · 1 comment
Open

Evaluate diffrent Fast Downward Heuristics #16

lotu opened this issue Mar 31, 2012 · 1 comment
Labels
enhancement todo

Comments

@lotu
Copy link
Member

lotu commented Mar 31, 2012

It is necessarily to evaluate the different search methods and heuristics we can use with fast downward to improve our search. Currently astar(blind()) is used but this should be improved upon. This should involve some metric to determine which technique is best.
@lotu
Copy link
Member Author

lotu commented Apr 4, 2012

The Snaking Ice Trail level in large.dat show cases this problem. It is very simple but our planner can't solve it. As it requires over 20GB of memory to run the astar(blind()) search. If we move the exit closer it is able to solve it, very easily.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement todo
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@lotu