{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T20:31:23Z","timestamp":1776112283865,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IRI-8801939"],"award-info":[{"award-number":["IRI-8801939"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004316","name":"International Business Machines Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004316","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1990,3]]},"DOI":"10.1016\/0004-3702(90)90054-4","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T08:02:52Z","timestamp":1047628972000},"page":"189-211","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":461,"title":["Real-time heuristic search"],"prefix":"10.1016","volume":"42","author":[{"given":"Richard E.","family":"Korf","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(90)90054-4_BIB1","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"10.1016\/0004-3702(90)90054-4_BIB2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","article-title":"Depth-first iterative-deepening: An optimal admissible tree search","volume":"27","author":"Korf","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(90)90054-4_BIB3","series-title":"The Sciences of the Artificial","author":"Simon","year":"1981"},{"key":"10.1016\/0004-3702(90)90054-4_BIB4","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1080\/14786445008521796","article-title":"Programming a computer for playing chess","volume":"41","author":"Shannon","year":"1950","journal-title":"Philos. Mag."},{"key":"10.1016\/0004-3702(90)90054-4_BIB5","article-title":"The alpha-beta heuristic","author":"Hart","year":"1963","journal-title":"MIT Artificial Intelligence Project Memo, MA"},{"key":"10.1016\/0004-3702(90)90054-4_BIB6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(89)90056-8","article-title":"Pattern knowledge and search: The SUPREM architecture","volume":"38","author":"Berliner","year":"1989","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(90)90054-4_BIB7","series-title":"Proceedings AAAI-87","first-page":"133","article-title":"Real-time heuristic search: First results","author":"Korf","year":"1987"},{"key":"10.1016\/0004-3702(90)90054-4_BIB8","series-title":"Proceedings AAAI-88","first-page":"139","article-title":"Real-time heuristic search: New results","author":"Korf","year":"1988"},{"key":"10.1016\/0004-3702(90)90054-4_BIB9","series-title":"Heuristics","author":"Pearl","year":"1984"},{"key":"10.1016\/0004-3702(90)90054-4_BIB10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0004-3702(83)80006-X","article-title":"Searching for an optimal path in a tree with random costs","volume":"21","author":"Karp","year":"1983","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(90)90054-4_BIB11","series-title":"The Theory of Branching Processes","author":"Harris","year":"1963"},{"issue":"4","key":"10.1016\/0004-3702(90)90054-4_BIB12","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/01969727208545856","article-title":"Look-ahead and one-person games","volume":"2","author":"Rosenberg","year":"1972","journal-title":"J. Cybern."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370290900544?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370290900544?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T06:34:06Z","timestamp":1762065246000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370290900544"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":12,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["0004370290900544"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(90)90054-4","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1990,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Real-time heuristic search","name":"articletitle","label":"Article Title"},{"value":"Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0004-3702(90)90054-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}