CPCES - It is a conformant planner based on the idea of using a counterexample guided refinement abstraction procedure. This planner handles limited observability in the initial state computing plans which are conformant, i.e. work for every possible initial state. Here you can get access to the executable and benchmarks updated with the AIJ 2020 version of CPCES. The code of the planner is accessible open source from bitbucket. Send me an email for any problem.
JAIR 2020 Planner and Benchmarks
SpringRoll - An SMT (Satisfiability Modulo Theory) based planner for numeric planning, derived variable, and complex global constraints developed arount the idea of rolling-up infinite sequence of action repetition.
ENHSP - Expressive Numeric Heuristic Search Planner. This is an expressive classical, linear and non linear numeric planner. It reads PDDL problems and synthesises (time stamped) sequence of actions to achieve goals starting from some description of the initial state of the system. It can also manage autonomous processes, global constraints and many fancy stuff:)
A set of test cases used for testing two mechanisms of plan repair based on the notion of numeric kernels: KernelCasi. Both mechanisms are explained in Numeric Kernel for Reasoning About Plans Involving Numeric Fluents appeared in LNCS 8249 and presented in Turin (Italy) during the AIxIA 2013 conference (a preliminary version of this paper has been presented as position paper in ICAART 2013)
Additional experimental analysis for the FLEX-RR system described in a paper by Scala, Micalizio and Torasso submitted for AICOM journal: Experiments
MICOP A knowledge engineering tool for the generation, management and visualization of numeric PDDL plans
FASTRP A framework for fast replanning, exploiting numeric kernel, macro actions and other external PDDL numeric solvers
JoPA A PDDL based prototype for assisting the user in multi-modal journey organization. The approach is described in a recent paper A Numeric PDDL Based Approach for Temporally Constrained Journey Problems which will appear in ICTAI-2014 proceedings. Click herefor a snapshot of the computational cost for several multi-modal journey tasks using the Colin planning system over different combinations of constraints