T

The ENHSP Planner

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.

Name
Last commit
Last update
ecai2016_benchmarks Loading commit data...
examples Loading commit data...
ijcai16_benchmarks Loading commit data...
ijcai17_benchmarks/opt Loading commit data...
ijcai18_benchmarks Loading commit data...
libs Loading commit data...
src Loading commit data...
.gitignore Loading commit data...
COPYING.LESSER Loading commit data...
LICENCE Loading commit data...
README.md Loading commit data...
compile Loading commit data...
contributors.txt Loading commit data...
ijcai16_opt_results.csv Loading commit data...
ijcai16_sat_results.csv Loading commit data...
install Loading commit data...