Presentation 1996/1/18
Weighted Realtime Search
Toru Ishida, Masashi Shimbo,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We discuss how the realtime search algorithm LRTA* is affected by inadmissible initial heuristic function. The proof is presented that when heuristic function overestimates the actual cost by at most a factor of 1 + ε, the cost of the paths traversed by LRTA* after convergence will not be worse than the optimal one by a factor greater than 1 + ε.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Realtime search / learning / heuristic evaluation function / problem solving
Paper # AI95-43
Date of Issue

Conference Information
Committee AI
Conference Date 1996/1/18(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Vice Chair

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) Weighted Realtime Search
Sub Title (in English)
Keyword(1) Realtime search
Keyword(2) learning
Keyword(3) heuristic evaluation function
Keyword(4) problem solving
1st Author's Name Toru Ishida
1st Author's Affiliation Department of Information Science, Kyoto University()
2nd Author's Name Masashi Shimbo
2nd Author's Affiliation Department of Information Science, Kyoto University
Date 1996/1/18
Paper # AI95-43
Volume (vol) vol.95
Number (no) 460
Page pp.pp.-
#Pages 8
Date of Issue