A GENERAL BEST 1ST SEARCH ALGORITHM IN AND OR GRAPHS

被引：4

作者：

CHAKRABARTI, PP ^{[1
]}

GHOSE, S ^{[1
]}

机构：

[1] INDIAN INST TECHNOL,DEPT COMP SCI & ENGN,KHARAGPUR 721302,W BENGAL,INDIA

来源：

JOURNAL OF ALGORITHMS | 1992年 / 13卷 / 02期

关键词：

D O I：

10.1016/0196-6774(92)90014-4

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A general formulation of best first search in the setting of AND/OR graphs has been considered where both minimization and maximization occur together. This leads to the development of an AND/OR graph search algorithm called GEN-AO* which works with two types of OR nodes, MIN and MAX, and uses both upper and lower bound estimates. It is shown that this algorithm generates optimal cost solutions. The worst case set of nodes expanded is examined. Such an algorithm generalizes other known algorithms. Pruning conditions for the depth-first variation is examined. © 1992.

引用

页码：177 / 187

页数：11

共 8 条

[1] B-STAR TREE SEARCH ALGORITHM - BEST-1ST PROOF PROCEDURE [J].

BERLINER, H .

ARTIFICIAL INTELLIGENCE, 1979, 12 (01) :23-40

[2]

Chakrabarti P., 1988, ARTIF INTELL, V34, P97

[3]

CHAKRABARTI PP, 1990, ARTIF INTELL, V41, P197

[4]

IBARAKI T, 1987, DISCRETE ALGORITHMS, P185

[5]

IBARAKI T, 1983, THEORET COMPUT SCI, V29, P207

[6] AND OR GRAPH HEURISTIC-SEARCH METHODS [J].

MAHANTI, A ;

BAGCHI, A .

JOURNAL OF THE ACM, 1985, 32 (01) :28-51

[7]

Nilsson N.J., 1980, PRINCIPLES ARTIFICIA

[8]

[No title captured]

← 1 →