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

Issue1130 #203

Merged
merged 4 commits into from
Jul 10, 2024
Merged

Issue1130 #203

Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
3677d28
Use bounds of component algorithms in iterated search.
ClemensBuechner Jan 8, 2024
32d8798
Prettify unrelated code.
ClemensBuechner Jan 16, 2024
cf95dc5
Add document note.
ClemensBuechner Jan 22, 2024
d65e3db
Update documentation.
ClemensBuechner Jul 9, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 6 additions & 6 deletions src/search/search_algorithms/iterated_search.cc
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -47,9 +47,7 @@ shared_ptr<SearchAlgorithm> IteratedSearch::create_current_phase() {
this overrides continue_on_fail.
*/
if (repeat_last_phase && last_phase_found_solution) {
return get_search_algorithm(
algorithm_configs.size() -
1);
return get_search_algorithm(algorithm_configs.size() - 1);
} else {
return nullptr;
}
Expand All @@ -63,7 +61,7 @@ SearchStatus IteratedSearch::step() {
if (!current_search) {
return found_solution() ? SOLVED : FAILED;
}
if (pass_bound) {
if (pass_bound && best_bound < current_search->get_bound()) {
current_search->set_bound(best_bound);
}
++phase;
Expand Down Expand Up @@ -143,8 +141,10 @@ class IteratedSearchFeature
true);
add_option<bool>(
"pass_bound",
"use bound from previous search. The bound is the real cost "
"of the plan found before, regardless of the cost_type parameter.",
"use the bound of iterated search as a bound for its component "
"search algorithms, unless these already have a lower bound set. "
"The iterated search bound is tightened whenever a component finds "
"a cheaper plan.",
"true");
add_option<bool>(
"repeat_last",
Expand Down
Loading