Welcome to the page of K* planner -- a state of the art Top-k planner integrating the K* algorithm into Fast Downward.
./build.py
# ./fast-downward.py <domain_file> <problem_file> --search "kstar(heuristic,k=<number-of-plans>)"
./fast-downward.py examples/gripper/domain.pddl examples/gripper/prob01.pddl --search "kstar(blind(),k=100)"
- heurisitic: any heuristic provided by Fast Downward
(http://www.fast-downward.org/Doc/Heuristic).
Disclaimer: Optimality of K* is only guaranteed with an admissible and consistent heuristic.
Michael Katz, Shirin Sohrabi, Octavian Udrea and Dominik Winterer
A Novel Iterative Approach to Top-k Planning [pdf] [bib]
In ICAPS 2018
For questions and comments please get in touch with Michael Katz (michael.katz1@ibm.com).