Type System Based Rational Lazy IDA

Oded Betzalel, Ariel Felner, Solomon Eyal Shimony

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

Meta-reasoning can improve numerous search algorithms, but necessitates collection of statistics to be used as probability distributions, and involves restrictive meta-reasoning assumptions. The recently suggested scheme of type systems in search algorithms is used in this paper for collecting these statistics. The statistics are then used to better estimate the unknown quantity of expected regret of computing a heuristic in Rational Lazy IDA* (RLIDA*), and also facilitate a second improvement due to relaxing one of the unrealistic meta-reasoning assumptions in RLIDA*.

Original languageEnglish
Title of host publicationProceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015
EditorsLevi Lelis, Roni Stern
PublisherAAAI press
Pages151-155
Number of pages5
ISBN (Electronic)9781577357322
StatePublished - 2015
Externally publishedYes
Event8th Annual Symposium on Combinatorial Search, SoCS 2015 - Ein Gedi, Israel
Duration: 11 Jun 201513 Jun 2015

Publication series

NameProceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015
Volume2015-January

Conference

Conference8th Annual Symposium on Combinatorial Search, SoCS 2015
Country/TerritoryIsrael
CityEin Gedi
Period11/06/1513/06/15

Bibliographical note

Publisher Copyright:
Copyright © 2015, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Fingerprint

Dive into the research topics of 'Type System Based Rational Lazy IDA'. Together they form a unique fingerprint.

Cite this