{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:56:46Z","timestamp":1750309006085,"version":"3.41.0"},"reference-count":1,"publisher":"Association for Computing Machinery (ACM)","issue":"78","license":[{"start":{"date-parts":[[1981,10,1]],"date-time":"1981-10-01T00:00:00Z","timestamp":370742400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGART Bull."],"published-print":{"date-parts":[[1981,10]]},"abstract":"<jats:p>\n            A+ algorithms are A algorithms (as studied by Nilsson) satisfying two additional constraints which magnify the breadth aspect of a graph search. Use of A+ algorithms is perhaps most plausible when it is desirable to generate alternative goal nodes on optimal paths. There are two principal results for A+ algorithms. First, if A\n            <jats:sub>1<\/jats:sub>\n            and A\n            <jats:sub>2<\/jats:sub>\n            are A+ algorithms and A\n            <jats:sub>2<\/jats:sub>\n            is as well informed as A\n            <jats:sub>1<\/jats:sub>\n            then A\n            <jats:sub>2<\/jats:sub>\n            expands no more nodes than A1 does. Second, if an A+ algorithm is modified so as to return a set of optimal paths and the monotone condition is satisfied, the A+ algorithm returns a set of solutions consisting of an optimal path to each goal node on an optimal path.\n          <\/jats:p>","DOI":"10.1145\/1056737.1056739","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"12-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Reasonable breadth-biased"],"prefix":"10.1145","author":[{"given":"Raymond D.","family":"Gumb","sequence":"first","affiliation":[{"name":"California State University, Northridge, Northridge, California"}]}],"member":"320","published-online":{"date-parts":[[1981,10]]},"reference":[{"volume-title":"Principles of Artificial Intelligence","year":"1980","author":"Nils J.","key":"e_1_2_1_1_1"}],"container-title":["ACM SIGART Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1056737.1056739","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1056737.1056739","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:41:38Z","timestamp":1750282898000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1056737.1056739"}},"subtitle":["A algorithms"],"short-title":[],"issued":{"date-parts":[[1981,10]]},"references-count":1,"journal-issue":{"issue":"78","published-print":{"date-parts":[[1981,10]]}},"alternative-id":["10.1145\/1056737.1056739"],"URL":"https:\/\/doi.org\/10.1145\/1056737.1056739","relation":{},"ISSN":["0163-5719"],"issn-type":[{"type":"print","value":"0163-5719"}],"subject":[],"published":{"date-parts":[[1981,10]]},"assertion":[{"value":"1981-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}