Presentation 1998/3/26
The Completeness of Moving-Target Search When Heuristics Overestimate(Preliminary Report)
Masashi Shimbo, Toru Ishida,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We report the following discoveries which we made by extending the completeness proof of the Moving-Target Search developed by Ishida and Korf. ・On updating the heuristic values, there is no need to compare(and take the maximum of)the current value with the one computed from the adjacent states. ・The completeness is not affected by the use of overestimated(or inadmissible)heuristics.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Real-time search / moving target / completeness / heuristics / problemsolving
Paper #
Date of Issue

Conference Information
Committee AI
Conference Date 1998/3/26(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) The Completeness of Moving-Target Search When Heuristics Overestimate(Preliminary Report)
Sub Title (in English)
Keyword(1) Real-time search
Keyword(2) moving target
Keyword(3) completeness
Keyword(4) heuristics
Keyword(5) problemsolving
1st Author's Name Masashi Shimbo
1st Author's Affiliation Center for Information and Multimedia Studies Kyoto University()
2nd Author's Name Toru Ishida
2nd Author's Affiliation Department of Information Science Kyoto University
Date 1998/3/26
Paper #
Volume (vol) vol.97
Number (no) 631
Page pp.pp.-
#Pages 8
Date of Issue