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

Issue937 #87

Merged
merged 10 commits into from Feb 10, 2022
Merged

Issue937 #87

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
10 commits
Select commit Hold shift + click to select a range
253b1c0
[issue937] Clear first achievers of landmarks in cycle of natural ord…
ClemensBuechner Feb 1, 2022
af8a738
[issue937] Make acyclic even when detecting cycle of natural orderings.
ClemensBuechner Feb 2, 2022
6c07a42
[issue937] Setup experiment.
ClemensBuechner Feb 2, 2022
252785f
[issue937] Remove TODOs.
ClemensBuechner Feb 2, 2022
5d4d680
[issue937] Add all comparisons to report.
ClemensBuechner Feb 3, 2022
bafc6fa
[issue937] Extend documentation and remove comments.
ClemensBuechner Feb 3, 2022
214c97e
[issue937] Add changelog entry.
ClemensBuechner Feb 4, 2022
6f30544
[issue937] Assert that achievers are calculated before mk_acyclic.
ClemensBuechner Feb 8, 2022
d26c600
[issue937] Replace assert with assignment.
ClemensBuechner Feb 10, 2022
8444e43
[issue937] Change http to https.
ClemensBuechner Feb 10, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
9 changes: 7 additions & 2 deletions CHANGES.md
View file
Open in desktop
Expand Up @@ -153,12 +153,17 @@ after the corresponding tracker issues.
framework. The constraints defined by Imai and Fukunaga (JAIR 2015) encode
different relaxations of the delete-relaxation heuristic.
For details, see our documentation.
<http://www.fast-downward.org/Doc/ConstraintGenerator#Delete_relaxation_constraints>
<https://www.fast-downward.org/Doc/ConstraintGenerator#Delete_relaxation_constraints>
Additionally, we fixed a bug which induced inadmissible
heuristic values when using CPLEX for optimal planning with large action
costs and/or long plans (only operator-counting heuristics with integer
variables and tasks with total costs starting from 10'000 were affected).
<http://issues.fast-downward.org/issue983>
<https://issues.fast-downward.org/issue983>

- The landmark factories can handle cycles of natural orderings without
crashing. Since the planning task is unsolvable in these cases, they
signal this by clearing the first achievers of the involved landmarks.
<https://issues.fast-downward.org/issue937>


## Fast Downward 20.06
Expand Down