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)

Full work available at URL https://doi.org/10.3233/AIC-160704

zbMATH Keywords

bidirectional searchheuristic searchpermutation sorting

Mathematics Subject Classification ID

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

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)

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

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)