{"title":"Influence of Heuristic Functions on Real-Time Heuristic Search Methods","authors":"I. Ismail, N. N. Agwu","doi":"10.1109/ICECCO.2018.8634782","DOIUrl":null,"url":null,"abstract":"In this paper we determine if heuristic function properties affect traditional and real-time heuristic search methods differently. The extent to which heuristic functions affect search method properties is measured by comparing traditional and real-time heuristic search methods. Problems of concern are observable, deterministic problems whose solution is a sequence of actions. Research is limited to influence of heuristic functions in real-time search domain only. It is shown that LSS-LRTA* produce higher wall times with a middle value heuristic and that solution cost is linear with heuristic value in IDA*. The same is not the case in LSS-LRTA*. Furthermore, the behaviour of LSS-LRTA* nodes expansion is similar to that of IDA*: a downward slope relative to heuristic value increase. The solution time decreases for LSS-LRTA* but is almost constant for IDA*.","PeriodicalId":399326,"journal":{"name":"2018 14th International Conference on Electronics Computer and Computation (ICECCO)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 14th International Conference on Electronics Computer and Computation (ICECCO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECCO.2018.8634782","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
In this paper we determine if heuristic function properties affect traditional and real-time heuristic search methods differently. The extent to which heuristic functions affect search method properties is measured by comparing traditional and real-time heuristic search methods. Problems of concern are observable, deterministic problems whose solution is a sequence of actions. Research is limited to influence of heuristic functions in real-time search domain only. It is shown that LSS-LRTA* produce higher wall times with a middle value heuristic and that solution cost is linear with heuristic value in IDA*. The same is not the case in LSS-LRTA*. Furthermore, the behaviour of LSS-LRTA* nodes expansion is similar to that of IDA*: a downward slope relative to heuristic value increase. The solution time decreases for LSS-LRTA* but is almost constant for IDA*.