Software Open Access
Code from the ICAPS 2020 paper "Incremental Search for Counterexample-Guided Cartesian Abstraction Refinement"
Seipp, Jendrik;
von Allmen, Samuel;
Helmert, Malte
The zipfile contains an extended version of the Fast Downward planning system (http://fast-downward.org). The code for CEGAR can be found in the "src/search/cegar" directory.
Please see http://www.fast-downward.org for instructions on how to compile the planner.
The following configuration computes a single Cartesian abstraction in at most 1000 seconds and uses incremental search to find abstract solutions in the refinement loop:
--search "astar(cegar([original()], max_states=infinity, max_transitions=infinity, max_time=1000, memory_padding=100, h_update=dijkstra_from_unconnected_orphans))"We actively maintain the code at https://github.com/jendrikseipp/scorpion.
Files
(832.4 kB)
| Name | Size | |
|---|---|---|
|
seipp-et-al-icaps2020-code.zip
md5:885cf2406915c75b842cfa55ead28726 |
832.4 kB | Download |
55
8
views
downloads
| All versions | This version | |
|---|---|---|
| Views | 55 | 55 |
| Downloads | 8 | 8 |
| Data volume | 6.7 MB | 6.7 MB |
| Unique views | 51 | 51 |
| Unique downloads | 8 | 8 |
Indexed in
- Publication date:
- February 4, 2020
- DOI:
-
- Meeting:
- ICAPS 2020
- Communities:
- License (for files):
- GNU General Public License v3.0 or later