An efficient algorithm for searching implicit AND/OR graphs with cycles

DOI10.1016/S0004-3702(00)00063-1zbMath0957.68034OpenAlexW2073628093WikidataQ126851480 ScholiaQ126851480MaRDI QIDQ1589573

P. Jiménez, Carme Torras

Publication date: 12 December 2000

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(00)00063-1

zbMATH Keywords

heuristic searchcyclic graphsAND/OR graphsassembly/disassembly problems

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Strong planning under partial observability ⋮ State space search nogood learning: online refinement of critical-path dead-end detectors in planning ⋮ LAO*: A heuristic search algorithm that finds solutions with loops

Cites Work

• Unnamed Item
• Admissible heuristic search in AND/OR graphs
• Admissibility of \(AO^ *\) when heuristics overestimate
• An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
• Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search
• An admissible and optimal algorithm for searching AND/OR graphs
• A general heuristic bottom-up procedure for searching AND/OR graphs
• AND/OR graph heuristic search methods
• Optimizing decision trees through heuristically guided search
• Best First Search Algorithm in AND/OR Graphs with Cycles
• Intractability of assembly sequencing: Unit disks in the plane