{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T16:24:23Z","timestamp":1754151863973,"version":"3.41.2"},"reference-count":0,"publisher":"Association for the Advancement of Artificial Intelligence (AAAI)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SOCS"],"abstract":"<jats:p>Planning under time pressure arises in many situations.  Real-time heuristic search, in which an agent must compute its next action within a prespecified time bound, has proven to be a useful model of real-time planning.  However, it is laborious to prove the completeness of new real-time search algorithms.  In this paper, we provide a general proof of the completeness of a standard real-time heuristic search algorithm in any problem domain that obeys the axioms of a cost algebra.  The proof includes additional detail on how h values change as the algorithm learns.  This foundation clarifies the dependence of the proof on domain and algorithm properties and will ease future applications of real-time planning.<\/jats:p>","DOI":"10.1609\/socs.v18i1.35988","type":"journal-article","created":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T06:05:49Z","timestamp":1753077949000},"page":"162-170","source":"Crossref","is-referenced-by-count":0,"title":["Real-time Cost-algebraic Heuristic Search"],"prefix":"10.1609","volume":"18","author":[{"given":"Devin","family":"Wild Thomas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wheeler","family":"Ruml","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"9382","published-online":{"date-parts":[[2025,7,19]]},"container-title":["Proceedings of the International Symposium on Combinatorial Search"],"original-title":[],"link":[{"URL":"https:\/\/ojs.aaai.org\/index.php\/SOCS\/article\/download\/35988\/38143","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/ojs.aaai.org\/index.php\/SOCS\/article\/download\/35988\/38143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T06:05:49Z","timestamp":1753077949000},"score":1,"resource":{"primary":{"URL":"https:\/\/ojs.aaai.org\/index.php\/SOCS\/article\/view\/35988"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,19]]},"references-count":0,"URL":"https:\/\/doi.org\/10.1609\/socs.v18i1.35988","relation":{},"ISSN":["2832-9163","2832-9171"],"issn-type":[{"type":"electronic","value":"2832-9163"},{"type":"print","value":"2832-9171"}],"subject":[],"published":{"date-parts":[[2025,7,19]]}}}