Stefan Edelkamp

Learn More
Heuristic search planning effectively finds solutions for large planning problems, but since the estimates are either not admissible or too weak, optimal solutions are found in rare cases only. In contrast, heuristic pattern databases are known to significantly improve lower bound estimates for optimally solving challenging single-agent problems like the(More)
This document de nes the language to be used in the classical part of the th International Planning Competition IPC The language comprises all of PDDL levels and as de ned by Maria Fox and Derek Long in parts of this document have been copied from that source On top of this language for IPC derived predicates are re introduced and timed initial literals are(More)
We provide an overview of the organization and results of the deterministic part of the 4th International Planning Competition, i.e., of the part concerned with evaluating systems doing deterministic planning. IPC-4 attracted even more competing systems than its already large predecessors, and the competition event was revised in several important respects.(More)
We present the explicit state model checker HSF-SPIN which is based on the model checker SPIN and its Promela modeling language. HSF-SPIN incorporates directed search algorithms for checking safety and a large class of LTL-specified liveness properties. We start off from the A* algorithm and define heuristics to accelerate the search into the direction of a(More)
The success of model checking is largely based on its ability to efficiently locate errors in software designs. If an error is found, a model checker produces a trail that shows how the error state can be reached, which greatly facilitates debugging. However, while current model checkers find error states efficiently, the counterexamples are often(More)
Navigation systems assist almost any kind of motion in the physical world including sailing, flying, hiking, driving and cycling. On the other hand, traces supplied by global positioning systems (GPS) can track actual time and absolute coordinates of the moving objects. Consequently, this paper addresses efficient algorithms and data structures for the(More)
The use of a lower bound estimate in the search has a tremendous impact on the size of the resulting search trees, whereas OBDDs can be used to e ciently describe sets of states based on their binary encoding. This paper combines these two ideas to a new algorithm BDDA . It challenges both, the breadthrst search using OBDDs and the traditional A algorithm.(More)