{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:58:37Z","timestamp":1725472717643},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540497875"},{"type":"electronic","value":"9783540497882"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11941439_67","type":"book-chapter","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T04:53:05Z","timestamp":1163739185000},"page":"627-636","source":"Crossref","is-referenced-by-count":3,"title":["BDDRPA*: An Efficient BDD-Based Incremental Heuristic Search Algorithm for Replanning"],"prefix":"10.1007","author":[{"given":"Weiya","family":"Yue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanyan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaile","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"67_CR1","first-page":"13","volume":"20","author":"M. Jardins des","year":"1999","unstructured":"des Jardins, M., Durfee, E., Ortiz, C., Wolverton, M.: A survey of research in distributed, continual planning. Artificial Intelligence Magazine\u00a020(4), 13\u201322 (1999)","journal-title":"Artificial Intelligence Magazine"},{"issue":"8","key":"67_CR2","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulations. IEEE Transactions on Computers\u00a0C-35(8), 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"key":"67_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking","author":"K.L. McMillan","year":"1993","unstructured":"McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Publishers, Dordrecht (1993)"},{"key":"67_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BFb0095430","volume-title":"KI-98: Advances in Artificial Intelligence","author":"S. Edelkamp","year":"1998","unstructured":"Edelkamp, S., Reffel, F.: OBDDs in heuristic search. In: Herzog, O. (ed.) KI 1998. LNCS, vol.\u00a01504, pp. 81\u201392. Springer, Heidelberg (1998)"},{"key":"67_CR5","first-page":"668","volume-title":"Proceddings of AAAI 2002","author":"R.M. Jensen","year":"2002","unstructured":"Jensen, R.M., Bryant, R.E., Veloso, M.M.: SetA*: An efficient BDD-Based Heuristic Search Algorithm. In: Proceddings of AAAI 2002, pp. 668\u2013673. AAAI Press, Menlo Park (2002)"},{"issue":"2","key":"67_CR6","first-page":"99","volume":"25","author":"S. Koenig","year":"2004","unstructured":"Koenig, S., Likhachev, M., Liu, Y., Furcy, D.: Incremental Heuristic Search in Artificial Intelligence. Artificial Intelligence Magazine\u00a025(2), 99\u2013112 (2004)","journal-title":"Artificial Intelligence Magazine"},{"key":"67_CR7","unstructured":"Koenig, S., Furcy, D., Bauer, C.: Heuristic search-based replanning. In: Proceedings of the International Conference on Aritficial Intelligence Planning and Scheduling, pp. 294\u2013301 (2002)"},{"key":"67_CR8","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jagm.1996.0046","volume":"21","author":"G. Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.: An incremental algorithm for a generalization of the shortest-path problem. Journal of Algorithms\u00a021, 267\u2013305 (1996a)","journal-title":"Journal of Algorithms"},{"key":"67_CR9","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/net.3230140208","volume":"14","author":"N. Deo","year":"1984","unstructured":"Deo, N., Pang, C.: Shortest-path algorithms: Taxonomy and annotation. Networks\u00a014, 275\u2013323 (1984)","journal-title":"Networks"},{"issue":"4","key":"67_CR10","first-page":"470","volume":"13","author":"C. Lin","year":"1990","unstructured":"Lin, C., Chang, R.: On the dynamic shortest path problem. Journal of Information Processing\u00a013(4), 470\u2013476 (1990)","journal-title":"Journal of Information Processing"},{"issue":"3","key":"67_CR11","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/PL00009224","volume":"22","author":"D. Frigioni","year":"1998","unstructured":"Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Semidynamic algorithms for maintaining single source shortest path trees. Algorithmica\u00a022(3), 250\u2013274 (1998)","journal-title":"Algorithmica"},{"issue":"2","key":"67_CR12","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1006\/jagm.1999.1048","volume":"34","author":"D. Frigioni","year":"2000","unstructured":"Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Fully dynamic algorithms for maintaining shortest pahts trees. Journal of Algorithms\u00a034(2), 251\u2013281 (2000)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","AI 2006: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11941439_67.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:51:29Z","timestamp":1619495489000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11941439_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540497875","9783540497882"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11941439_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}