forbiditerative 1.1.3

Forbid-Iterative (FI) Planner is an Automated PDDL based planner that includes planners for top-k, top-quality, and diverse computational tasks.

Forbid-Iterative (FI) Planner is an Automated PDDL based planner that includes planners for top-k, top-quality, and diverse computational tasks.

The codebase consists of multiple planners, for multiple computational problems, roughly divided into three categories:

1. Top-k planning
2. Top-quality planning
   2.1. Top-quality planning
   2.2. Unordered top-quality planning
   2.3. Sub(multi)set top-quality planning
3. Diverse planning
   3.1. Satisficing/Agile diverse planning

The planners are based on the idea of obtaining multiple solutions by iteratively reformulating planning tasks to restrict the set of valid plans, forbidding previously found ones. Thus, the planners can be referred to as FI-top-k, FI-top-quality, FI-unordered-top-quality, FI-diverse-agl.

The codebase also includes multiple useful utilities:

1. Getting the landmarks of a planning problem
2. Constructing a graph from plans
3. Constructing graph representations of a planning task 3.1 Problem Description Graph (PDG) 3.2 Abstract Structure Graph (ASG)

Installation

pip install forbiditerative 

Running

from forbiditerative import planners
from pathlib import Path

domain_file = Path("your/path/domain.pddl")
problem_file = Path("your/path/problem.pddl")

# Example: FI-unordered-top-quality
plans = planners.plan_unordered_topq(domain_file=domain_file, problem_file=problem_file, quality_bound=1.0, number_of_plans_bound=100, timeout=20)
print(plans)

# Example: FI-submultisets-top-quality
plans = planners.plan_submultisets_topq(domain_file=domain_file, problem_file=problem_file, quality_bound=1.0, number_of_plans_bound=None)
print(plans)

# Example: FI-subsets-top-quality
plans = planners.plan_subsets_topq(domain_file=domain_file, problem_file=problem_file, quality_bound=1.0, number_of_plans_bound=None)
print(plans)

# Example: FI-topk
plans = planners.plan_topk(domain_file=domain_file, problem_file=problem_file, number_of_plans_bound=100)
print(plans)

# Example: FI-diverse-agl
plans = planners.plan_diverse_agl(domain_file=domain_file, problem_file=problem_file, number_of_plans_bound=100)
print(plans)

# Example: getting landmarks (default method 'rhw')
landmarks = planners.get_landmarks(domain_file=domain_file, problem_file=problem_file)
print(landmarks)

# Example: getting exhaustive landmarks (https://www.fast-downward.org/Doc/LandmarkFactory) 
landmarks = planners.get_landmarks(domain_file=domain_file, problem_file=problem_file, method = 'exhaust')
print(landmarks)

# Example: create a dot graph out of plans
import graphviz
dot_txt = planners.get_dot(domain_file=domain_file, problem_file=problem_file, plans = plans)
src = graphviz.Source(dot_txt)
src.render('plans.gv', view=True)

# Example: get a problem description graph (PDG) in dot format
import graphviz
dot_txt = planners.get_PDG(domain_file=domain_file, problem_file=problem_file)
src = graphviz.Source(dot_txt)
src.render('PDG.gv', view=True)

# Example: get an abstract structure graph (ASG) in dot format
import graphviz
dot_txt = planners.get_ASG(domain_file=domain_file, problem_file=problem_file)
src = graphviz.Source(dot_txt)
src.render('ASG.gv', view=True)

Citing

Top-k planning

@InProceedings{katz-et-al-icaps2018,
  title =        "A Novel Iterative Approach to Top-k Planning",
  author =       "Michael Katz and Shirin Sohrabi and Octavian Udrea and Dominik Winterer",
  booktitle =    "Proceedings of the Twenty-Eighth International Conference on
                  Automated Planning and Scheduling (ICAPS 2018)",
  publisher =    "{AAAI} Press",
  pages =        "132--140",
  year =         "2018"
}

Top-quality planning

@InProceedings{katz-et-al-aaai2020,
  author =       "Michael Katz and Shirin Sohrabi and Octavian Udrea",
  title =        "Top-Quality Planning: Finding Practically Useful Sets of Best Plans",
  booktitle =    "Proceedings of the Thirty-Fourth {AAAI} Conference on
                  Artificial Intelligence ({AAAI} 2020)",
  publisher =    "{AAAI} Press",
  pages =        "9900--9907",
  year =         "2020"
}

@InProceedings{katz-sohrabi-icaps2022,
  author =       "Michael Katz and Shirin Sohrabi",
  title =        "Who Needs These Operators Anyway: Top Quality Planning with Operator Subset Criteria",
  booktitle =    "Proceedings of the Thirty-Second International Conference on
                  Automated Planning and Scheduling (ICAPS 2022)",
  publisher =    "{AAAI} Press",
  year =         "2022"
}

Diverse planning

@InProceedings{katz-sohrabi-aaai2020,
  title =        "Reshaping diverse planning",
  author =       "Michael Katz and Shirin Sohrabi",
  booktitle =    "Proceedings of the Thirty-Fourth {AAAI} Conference on
                  Artificial Intelligence ({AAAI} 2020)",
  publisher =    "{AAAI} Press",
  pages =        "9892--9899",
  year =         "2020"
}

PDG (this modified version, for original see Pochter et al AAAI 2011)

@InProceedings{shleyfman-et-al-aaai2015,
  title =        "Heuristics and Symmetries in Classical Planning",
  author =       "Alexander Shleyfman and Michael Katz and Malte Helmert and Silvan Sievers and Martin Wehrle",
  booktitle =    "Proceedings of the Twenty-Ninth {AAAI} Conference on
                  Artificial Intelligence ({AAAI} 2015)",
  publisher =    "{AAAI} Press",
  pages =        "3371--3377",
  year =         "2015"
}

ASG

@InProceedings{sievers-et-al-icaps2019,
  title =        "Theoretical Foundations for Structural Symmetries of Lifted {PDDL} Tasks",
  author =       "Silvan Sievers and Gabriele R{\"o}ger and Martin Wehrle and Michael Katz",
  booktitle =    "Proceedings of the Twenty-Ninth International Conference on
                  Automated Planning and Scheduling (ICAPS 2019)",
  publisher =    "{AAAI} Press",
  pages =        "446--454",
  year =         "2019"
}

Licensing

Forbid-Iterative (FI) Planner is an Automated PDDL based planner that includes planners for top-k, top-quality, and diverse computational tasks. Copyright (C) 2019 Michael Katz, IBM Research, USA. The code extends the Fast Downward planning system. The license for the extension is specified in the LICENSE file.

Fast Downward

Fast Downward is a domain-independent classical planning system.

Copyright 2003-2022 Fast Downward contributors (see below).

For further information:

• Fast Downward website: https://www.fast-downward.org
• Report a bug or file an issue: https://issues.fast-downward.org
• Fast Downward mailing list: https://groups.google.com/forum/#!forum/fast-downward
• Fast Downward main repository: https://github.com/aibasel/downward

Tested software versions

This version of Fast Downward has been tested with the following software versions:

OS	Python	C++ compiler	CMake
Ubuntu 20.04	3.8	GCC 9, GCC 10, Clang 10, Clang 11	3.16
Ubuntu 18.04	3.6	GCC 7, Clang 6	3.10
macOS 10.15	3.6	AppleClang 12	3.19
Windows 10	3.6	Visual Studio Enterprise 2017 (MSVC 19.16) and 2019 (MSVC 19.28)	3.19

We test LP support with CPLEX 12.9, SoPlex 3.1.1 and Osi 0.107.9. On Ubuntu, we test both CPLEX and SoPlex. On Windows, we currently only test CPLEX, and on macOS, we do not test LP solvers (yet).

Contributors

The following list includes all people that actively contributed to Fast Downward, i.e. all people that appear in some commits in Fast Downward's history (see below for a history on how Fast Downward emerged) or people that influenced the development of such commits. Currently, this list is sorted by the last year the person has been active, and in case of ties, by the earliest year the person started contributing, and finally by last name.

• 2003-2022 Malte Helmert
• 2008-2016, 2018-2022 Gabriele Roeger
• 2010-2022 Jendrik Seipp
• 2010-2011, 2013-2022 Silvan Sievers
• 2012-2022 Florian Pommerening
• 2013, 2015-2022 Salomé Eriksson
• 2018-2022 Patrick Ferber
• 2021-2022 Clemens Büchner
• 2021-2022 Dominik Drexler
• 2022 Remo Christen
• 2015, 2021 Thomas Keller
• 2016-2020 Cedric Geissmann
• 2017-2020 Guillem Francès
• 2018-2020 Augusto B. Corrêa
• 2020 Rik de Graaff
• 2015-2019 Manuel Heusner
• 2017 Daniel Killenberger
• 2016 Yusra Alkhazraji
• 2016 Martin Wehrle
• 2014-2015 Patrick von Reth
• 2009-2014 Erez Karpas
• 2014 Robert P. Goldman
• 2010-2012 Andrew Coles
• 2010, 2012 Patrik Haslum
• 2003-2011 Silvia Richter
• 2009-2011 Emil Keyder
• 2010-2011 Moritz Gronbach
• 2010-2011 Manuela Ortlieb
• 2011 Vidal Alcázar Saiz
• 2011 Michael Katz
• 2011 Raz Nissim
• 2010 Moritz Goebelbecker
• 2007-2009 Matthias Westphal
• 2009 Christian Muise

History

The current version of Fast Downward is the merger of three different projects:

• the original version of Fast Downward developed by Malte Helmert and Silvia Richter
• LAMA, developed by Silvia Richter and Matthias Westphal based on the original Fast Downward
• FD-Tech, a modified version of Fast Downward developed by Erez Karpas and Michael Katz based on the original code

In addition to these three main sources, the codebase incorporates code and features from numerous branches of the Fast Downward codebase developed for various research papers. The main contributors to these branches are Malte Helmert, Gabi Röger and Silvia Richter.

License

The following directory is not part of Fast Downward as covered by this license:

• ./src/search/ext

For the rest, the following license applies:

Fast Downward is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or (at
your option) any later version.

Fast Downward is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.