AND/OR graph heuristic search methods
From MaRDI portal
Recommendations
- A general heuristic bottom-up procedure for searching AND/OR graphs
- Multiobjective Heuristic Search in AND/OR Graphs
- Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search
- A general best first search algorithm in AND/OR graphs
- scientific article; zbMATH DE number 139778
- Heuristic and metaheuristic methods for computing graph treewidth
- Search problems on graphs
- scientific article; zbMATH DE number 1538872
- Graph abstraction in real-time heuristic search
- Heuristic Search for the Analysis of Graph Transition Systems
Cited in
(22)- Admissibility of \(AO^ *\) when heuristics overestimate
- Generalized best first search using single and multiple heuristics
- Backward fuzzy heuristic search algorithm FBHAO\(^*\) for fuzzy general and/or graph
- Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search
- An efficient algorithm for searching implicit AND/OR graphs with cycles
- Algorithms and conditional lower bounds for planning problems
- Optimization problems involving collections of dependent objects
- Strong planning under partial observability
- A general heuristic bottom-up procedure for searching AND/OR graphs
- Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
- scientific article; zbMATH DE number 4162292 (Why is no real title available?)
- scientific article; zbMATH DE number 4164175 (Why is no real title available?)
- Games with Opacity Condition
- Three approaches to heuristic search in networks
- A general best first search algorithm in AND/OR graphs
- Multiobjective Heuristic Search in AND/OR Graphs
- ANALYZING VULNERABILITIES OF CRITICAL INFRASTRUCTURES USING FLOWS AND CRITICAL VERTICES IN AND/OR GRAPHS
- scientific article; zbMATH DE number 2219699 (Why is no real title available?)
- An \(O(n^2)\) time algorithm for alternating Büchi games
- The \(PN^{*}\)-search algorithm: Application to tsume-shogi
- Graphical method of representing variable sets for solving search problems
- Bulk search for optimally solving two variants of anonymous multi-agent pathfinding
This page was built for publication: AND/OR graph heuristic search methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3771665)