Computer chess meets planning

被引：0

作者：

Brockington, M ^{[1
]}

机构：

[1] BioWare Corp, Edmonton, AB T6E 6H2, Canada

来源：

ICGA JOURNAL | 2000年 / 23卷 / 02期

关键词：

D O I：

10.3233/ICG-2000-23204

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Recently many papers have been published on how to improve the A* planning algorithm. A number of these papers are from ex-computer-chess practitioners. This paper attempts to summarize some of the enhancements to A*, and shows why a "computer chess"-style A* approach may be considered to be profitable when implementing A*.

引用

页码：85 / 93

页数：9

共 19 条

[1]

[Anonymous], THESIS U ALBERTA

[2] A solution to the GHI problem for best-first search [J].

Breuker, DM ;

van den Herik, HJ ;

Uiterwijk, JWHM ;

Allis, LV .

COMPUTERS AND GAMES, 1999, 1558 :25-49

[3] Replacement schemes and two-level tables [J].

Breuker, DM ;

Uiterwijk, JWHM ;

vandenHerik, HJ .

ICCA JOURNAL, 1996, 19 (03) :175-180

[4]

Greenblatt R, 1967, P AFIPS FALL JOINT C, V31, P801, DOI DOI 10.1145/1465611.1465715

[5] A FORMAL BASIS FOR HEURISTIC DETERMINATION OF MINIMUM COST PATHS [J].

HART, PE ;

NILSSON, NJ ;

RAPHAEL, B .

IEEE TRANSACTIONS ON SYSTEMS SCIENCE AND CYBERNETICS, 1968, SSC4 (02) :100-+

[6]

HART PE, 2000, IEEE T SYST SCI CYB, V4, P139

[7] ANALYSIS OF ALPHA-BETA PRUNING [J].

KNUTH, DE ;

MOORE, RW .

ARTIFICIAL INTELLIGENCE, 1975, 6 (04) :293-326

[8] DEPTH-1ST ITERATIVE-DEEPENING - AN OPTIMAL ADMISSIBLE TREE-SEARCH [J].

KORF, RE .

ARTIFICIAL INTELLIGENCE, 1985, 27 (01) :97-109

[9]

Nilsson N. J., 1971, Problem -solving methods in artificial intelligence

[10]

PLAAT A, 1996, AAAI NAT C, V1, P234

← 1 2 →