迭代深化等代价启发式搜索

Symposium on Combinatorial Search Pub Date : 2022-07-17 DOI:10.1609/socs.v15i1.21748

Zhaoxing Bu, R. Korf

{"title":"迭代深化等代价启发式搜索","authors":"Zhaoxing Bu, R. Korf","doi":"10.1609/socs.v15i1.21748","DOIUrl":null,"url":null,"abstract":"Breadth-first heuristic search (BFHS) is a classic algorithm for optimally solving heuristic search and planning problems. BFHS is slower than A* but requires less memory. However, BFHS only works on unit-cost domains. We propose a new algorithm that extends BFHS to domains with different edge costs, which we call uniform-cost heuristic search (UCHS). Experimental results show that the iterative-deepening version of UCHS, IDUCHS, is slower than A* but requires less memory on a variety of planning domains.","PeriodicalId":425645,"journal":{"name":"Symposium on Combinatorial Search","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Iterative-Deepening Uniform-Cost Heuristic Search\",\"authors\":\"Zhaoxing Bu, R. Korf\",\"doi\":\"10.1609/socs.v15i1.21748\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Breadth-first heuristic search (BFHS) is a classic algorithm for optimally solving heuristic search and planning problems. BFHS is slower than A* but requires less memory. However, BFHS only works on unit-cost domains. We propose a new algorithm that extends BFHS to domains with different edge costs, which we call uniform-cost heuristic search (UCHS). Experimental results show that the iterative-deepening version of UCHS, IDUCHS, is slower than A* but requires less memory on a variety of planning domains.\",\"PeriodicalId\":425645,\"journal\":{\"name\":\"Symposium on Combinatorial Search\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-07-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Symposium on Combinatorial Search\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1609/socs.v15i1.21748\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symposium on Combinatorial Search","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1609/socs.v15i1.21748","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

广度优先启发式搜索(BFHS)是求解启发式搜索和规划问题的经典算法。BFHS比A*慢，但需要更少的内存。然而，BFHS只适用于单位成本域。我们提出了一种新的算法，将BFHS扩展到具有不同边缘代价的域，我们称之为均匀代价启发式搜索(UCHS)。实验结果表明，迭代深化版本的UCHS (IDUCHS)比A*慢，但在各种规划域上需要更少的内存。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Iterative-Deepening Uniform-Cost Heuristic Search

Breadth-first heuristic search (BFHS) is a classic algorithm for optimally solving heuristic search and planning problems. BFHS is slower than A* but requires less memory. However, BFHS only works on unit-cost domains. We propose a new algorithm that extends BFHS to domains with different edge costs, which we call uniform-cost heuristic search (UCHS). Experimental results show that the iterative-deepening version of UCHS, IDUCHS, is slower than A* but requires less memory on a variety of planning domains.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Symposium on Combinatorial Search

自引率

0.00%

发文量