Presentation 1998/1/22
Introducing n-State Commitment Method Into Heuristic Searche Algorithms
Tomohisa MIYAJI, Yasuhiko KITAMURA, Makoto YOKOO, Shoji TATSUMI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) To improve heuristic searche algorithms for semi-optimal solutions, we introduce n-state commitment method which limits the number of candidate states to be expanded to n. We apply the method to Weighted A^* (WA^*) algorithm and Real-Time A^* (RTA^*) algorithm which can be viewed as 1-state commitment and all-state commitment algrothms respectively, and show the effects through theoretical analysis using a binary tree and empirical analysis using maze and n-puzzle problems.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) heuristic search / commitment / semi-optimal solution
Paper # AI97-58
Date of Issue

Conference Information
Committee AI
Conference Date 1998/1/22(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Artificial Intelligence and Knowledge-Based Processing (AI)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Introducing n-State Commitment Method Into Heuristic Searche Algorithms
Sub Title (in English)
Keyword(1) heuristic search
Keyword(2) commitment
Keyword(3) semi-optimal solution
1st Author's Name Tomohisa MIYAJI
1st Author's Affiliation Dept. of Information and Communication Engineering, Faculty of Engineering, Osaka City University()
2nd Author's Name Yasuhiko KITAMURA
2nd Author's Affiliation Dept. of Information and Communication Engineering, Faculty of Engineering, Osaka City University
3rd Author's Name Makoto YOKOO
3rd Author's Affiliation NTT Communication Science Laboratories
4th Author's Name Shoji TATSUMI
4th Author's Affiliation Dept. of Information and Communication Engineering, Faculty of Engineering, Osaka City University
Date 1998/1/22
Paper # AI97-58
Volume (vol) vol.97
Number (no) 498
Page pp.pp.-
#Pages 8
Date of Issue