{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,18]],"date-time":"2026-10-18T09:00:22Z","timestamp":1792314022292,"version":"4.4.0"},"reference-count":8,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[1968,1,1]],"date-time":"1968-01-01T00:00:00Z","timestamp":-63158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Syst. Sci. Cyber."],"published-print":{"date-parts":[[1968]]},"DOI":"10.1109\/tssc.1968.300136","type":"journal-article","created":{"date-parts":[[2008,7,18]],"date-time":"2008-07-18T14:53:58Z","timestamp":1216392838000},"page":"100-107","source":"Crossref","is-referenced-by-count":9995,"title":["A Formal Basis for the Heuristic Determination of Minimum Cost Paths"],"prefix":"10.1109","volume":"4","author":[{"given":"Peter","family":"Hart","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nils","family":"Nilsson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bertram","family":"Raphael","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.8.2.224"},{"key":"ref2","article-title":"3","volume-title":"Finite Graphs and Networks: An Introduction with Applications","author":"Busacker","year":"1965"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1515\/9781400874651","volume-title":"Applied Dynamic Programming","author":"Bellman","year":"1962"},{"key":"ref4","article-title":"Realization of a geometry-theorem proving machine","volume-title":"Computers and Thought","author":"Gelernter","year":"1963"},{"key":"ref5","article-title":"Some studies in machine learning using the game of checkers","volume-title":"Computers and Thought","author":"Samuel","year":"1963"},{"key":"ref6","article-title":"The shortest path through a maze","volume-title":"Proc. Internat\u2019l Symp. on Theory of Switching","author":"Moore"},{"key":"ref7","volume-title":"The Annals of the Computation Laboratory of Harvard University","volume":"30","year":"1959"},{"key":"ref8","volume-title":"Computers and Thought","author":"Feigenbaum","year":"1963"}],"container-title":["IEEE Transactions on Systems Science and Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4082035\/4082123\/04082128.pdf?arnumber=4082128","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,23]],"date-time":"2024-01-23T17:11:17Z","timestamp":1706029877000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4082128\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1968]]},"references-count":8,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tssc.1968.300136","relation":{},"ISSN":["0536-1567"],"issn-type":[{"value":"0536-1567","type":"print"}],"subject":[],"published":{"date-parts":[[1968]]}}}