Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
On the diameter of the pancake network
Journal of Algorithms
Maximizing over multiple pattern databases speeds up heuristic search
Artificial Intelligence
Duality in permutation state spaces and the dual search algorithm
Artificial Intelligence
An (18/11)n upper bound for sorting by prefix reversals
Theoretical Computer Science
Dual search in permutation state spaces
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Genome rearrangement and planning
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Large-scale parallel breadth-first search
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
A general theory of additive state space abstractions
Journal of Artificial Intelligence Research
Friends or foes? on planning as satisfiability and abstract CNF encodings
Journal of Artificial Intelligence Research
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Finding optimal solutions to the twenty-four puzzle
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Finding optimal solutions to Rubik's cube using pattern databases
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Hierarchical A *: searching abstraction hierarchies efficiently
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Hierarchical heuristic search revisited
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Inconsistent heuristics in theory and practice
Artificial Intelligence
Learning heuristic functions for large state spaces
Artificial Intelligence
Hi-index | 0.00 |
The pancake problem is a famous search problem where the objective is to sort a sequence of objects (pancakes) through a minimal number of prefix reversals (flips). The best approaches for the problem are based on heuristic search with abstraction (pattern database) heuristics. We present a new class of abstractions for the pancake problem called relative-order abstractions. Relative-order abstractions have three advantages over the object-location abstractions considered in previous work. First, they are size-independent, i.e., do not need to be tailored to a particular instance size of the pancake problem. Second, they are more compact in that they can represent a larger number of pancakes within abstractions of bounded size. Finally, they can exploit symmetries in the problem specification to allow multiple heuristic lookups, significantly improving search performance over a single lookup. Our experiments show that compared to object-location abstractions, our new techniques lead to an improvement of one order of magnitude in runtime and up to three orders of magnitude in the number of generated states.