{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T17:17:04Z","timestamp":1782926224641,"version":"3.54.5"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"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., Man, Cybern. B"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1109\/tsmcb.2010.2089619","type":"journal-article","created":{"date-parts":[[2010,11,23]],"date-time":"2010-11-23T21:02:31Z","timestamp":1290546151000},"page":"725-735","source":"Crossref","is-referenced-by-count":12,"title":["&lt;formula formulatype=\"inline\"&gt;&lt;tex Notation=\"TeX\"&gt;$\\hbox{MAWA}^{\\ast}$&lt;\/tex&gt;&lt;\/formula&gt;\u2014A Memory-Bounded Anytime Heuristic-Search Algorithm"],"prefix":"10.1109","volume":"41","author":[{"given":"Satya Gautam","family":"Vadlamudi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sandip","family":"Aine","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Partha Pratim","family":"Chakrabarti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","first-page":"125","article-title":"Limited discrepancy beam search","author":"furcy","year":"2005","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref11","author":"hansen","year":"1997","journal-title":"Anytime heuristic search First results"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref13","first-page":"1359","article-title":"Memory-bounded bidirectional search","volume":"2","author":"kaindl","year":"1994","journal-title":"Proc 12th Nat Conf Artif Intell (AAAI)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/0470015721"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00092-3"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICVD.1995.512081"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1287\/opre.14.4.699"},{"key":"ref18","author":"likhachev","year":"2004","journal-title":"Advances in Neural Information Processing Systems 16"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(70)90007-X"},{"key":"ref28","author":"zilberstein","year":"1993","journal-title":"Operational rationality through compilation of anytime algorithms"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00108-4"},{"key":"ref27","first-page":"90","article-title":"Beam-stack search: Integrating backtracking with beam search","author":"zhou","year":"2005","journal-title":"Proc 15th ICAPS"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)90054-X"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICVD.1994.282726"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(89)90010-6"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007949918800"},{"key":"ref7","first-page":"49","article-title":"An analysis of time-dependent planning","author":"dean","year":"1988","journal-title":"Proc 6th Nat Conf Artif Intell (AAAI)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2455.2458"},{"key":"ref9","first-page":"21","article-title":"<ref_formula><tex Notation=\"TeX\">$\\hbox{ITSA}^{\\ast}$<\/tex><\/ref_formula>: Iterative tunneling search with <ref_formula><tex Notation=\"TeX\">$\\hbox{A}^{\\ast}$<\/tex><\/ref_formula>","author":"furcy","year":"2006","journal-title":"Proc AAAI Workshop Heuristic Search Memory-Based Heuristics Their Appl"},{"key":"ref1","first-page":"2250","article-title":"<ref_formula><tex Notation=\"TeX\">$\\hbox{AWA}^{\\ast}$<\/tex><\/ref_formula>\u2014A window constrained anytime heuristic search algorithm","author":"aine","year":"2007","journal-title":"Proc IJCAI"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"ref22","author":"stanojevic","year":"2005","journal-title":"Tutorials on Emerging Methodologies and Applications in Operations Research"},{"key":"ref21","first-page":"1","article-title":"Efficient memory-bounded search methods","author":"russell","year":"1992","journal-title":"Proc 10th Eur Conf Artif Intell"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007934310264"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1040.0077"},{"key":"ref26","first-page":"203","article-title":"Memory-bounded <ref_formula><tex Notation=\"TeX\">$\\hbox{A}^{\\ast}$<\/tex><\/ref_formula> graph search","author":"zhou","year":"2002","journal-title":"Proc 15th Int Florida Artif Intell Res Soc Conf"},{"key":"ref25","first-page":"425","article-title":"Complete anytime beam search","author":"zhang","year":"1998","journal-title":"Proc 14th Nat Conf Artif Intell (AAAI)"}],"container-title":["IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/3477\/5767816\/05640680.pdf?arnumber=5640680","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:47:30Z","timestamp":1633909650000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5640680\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":28,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tsmcb.2010.2089619","relation":{},"ISSN":["1083-4419","1941-0492"],"issn-type":[{"value":"1083-4419","type":"print"},{"value":"1941-0492","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6]]}}}