{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:01:38Z","timestamp":1725534098480},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022692"},{"type":"electronic","value":"9783642022708"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02270-8_28","type":"book-chapter","created":{"date-parts":[[2009,6,19]],"date-time":"2009-06-19T05:17:47Z","timestamp":1245388667000},"page":"271-282","source":"Crossref","is-referenced-by-count":4,"title":["The BDD-Based Dynamic A* Algorithm for Real-Time Replanning"],"prefix":"10.1007","author":[{"given":"Yanyan","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiya","family":"Yue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaile","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"28_CR1","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 paths trees. Journal of Algorithms\u00a034(2), 251\u2013281 (2000)","journal-title":"Journal of Algorithms"},{"key":"28_CR2","volume-title":"Heuristics: Intelligent Search Strtegies for Computer Problem Sloving","author":"J. Pearl","year":"1984","unstructured":"Pearl, J.: Heuristics: Intelligent Search Strtegies for Computer Problem Sloving. Addison-Wesley Longman Publishing Co., Inc., Boston (1984)"},{"issue":"1-2","key":"28_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.artint.2003.12.001","volume":"155","author":"S. Koenig","year":"2004","unstructured":"Koenig, S., Likhachev, M., Furcy, D.: Lifelong Planning A*. Artificial Intelligence Journal\u00a0155(1-2), 93\u2013146 (2004)","journal-title":"Artificial Intelligence Journal"},{"key":"28_CR4","first-page":"476","volume-title":"Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence. AAAI 2002","author":"S. Koenig","year":"2002","unstructured":"Koenig, S., Likhachev, M.: D* Lite. In: Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence. AAAI 2002, pp. 476\u2013483. AAAI Press, Menlo Park (2002)"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Ferguson, D., Stentz, A.: The Delayed D* algorithm for Efficient Path Replanning. In: Proceedings of the IEEE International Conference on Robotics and Automation, pp. 2045\u20132050 (2005)","DOI":"10.1109\/ROBOT.2005.1570414"},{"key":"28_CR6","unstructured":"Ayorkor Mills-Tettey, G.: Anthony Stentz and M. Bernardine Dias: DD* Lite: Efficient Incremental Search with State Dominance. In: Proceedings of the twenty-first national conference on Artificial intelligence (AAAI 2006), pp. 1032\u20131038 (2006)"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Yue, W., Xu, Y., Su, K.: BDDRPA*: An Efficient BDD-Based Incremental Heuristic Search Algorithm for Replanning. In: Australian Conference on Artificial Intelligence, pp. 627\u2013636 (2006)","DOI":"10.1007\/11941439_67"},{"key":"28_CR8","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":"28_CR9","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.artint.2007.05.009","volume":"172","author":"R.M. Jensen","year":"2008","unstructured":"Jensen, R.M., Veloso, M.M., Bryant, R.E.: State-Set branching: leveraging BDDs for heuristic search. Artificial Intelligence\u00a0172, 103\u2013139 (2008)","journal-title":"Artificial Intelligence"},{"key":"28_CR10","first-page":"1652","volume-title":"Proceddings of the International Joint Conference on Artificial Intelligence. IJCAI","author":"A. Stentz","year":"1995","unstructured":"Stentz, A.: The Focussed D* Algorithm for Real-Time Replanning. In: Proceddings of the International Joint Conference on Artificial Intelligence. IJCAI, pp. 1652\u20131659. Morgan Kanfmann Publishers Inc., San Fransisco (1995)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02270-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T22:07:45Z","timestamp":1552082865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02270-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022692","9783642022708"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02270-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}