Optimally solving permutation sorting problems with efficient partial expansion bidirectional heuristic search

DOI10.3233/AIC-160704MaRDI QIDQ4589262zbMATH OpenDBLPWikidataFDO

Authors Marco Lippi, Marco Ernandes, Ariel Felner

Publication date 10 November 2017

Published in AI Communications (Search for Journal in Brave)

zbMATH Keywords

heuristic searchbidirectional searchpermutation sorting

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Searching and sorting (68P10)

Recommendations

• Two new bidirectional search algorithms
• Relative-order abstractions for the pancake problem
• Block sorting: a characterization and some heuristics
• \(\text{BIDA}^*\): An improved perimeter search algorithm
• On the problem of sorting burnt pancakes

Cited in

(5)

• MM: a bidirectional search algorithm that is guaranteed to meet in the middle
• A heuristic to accelerate in-situ permutation algorithms
• Relative-order abstractions for the pancake problem
• Duality in permutation state spaces and the dual search algorithm
• Optimal path discovery problem with homogeneous knowledge

This page was built for publication: Optimally solving permutation sorting problems with efficient partial expansion bidirectional heuristic search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589262)