{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:02:28Z","timestamp":1725552148854},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540308485"},{"type":"electronic","value":"9783540324232"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11599289_14","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T09:53:05Z","timestamp":1132739585000},"page":"155-167","source":"Crossref","is-referenced-by-count":1,"title":["Adaptive Path Finding for Moving Objects"],"prefix":"10.1007","author":[{"given":"Qiang","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Tay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Huang, B., Li, H.G.: Developing Location-aware Navigation Guides That Use Mobile Geographic Information Systems. Transportation Research Record, 108\u2013113 (2004)","DOI":"10.3141\/1879-13"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: A Note on Two Problems in Connection with Graphs. Numerische Math., 269\u2013271 (1959)","DOI":"10.1007\/BF01386390"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics, 100\u2013107 (1968)","DOI":"10.1109\/TSSC.1968.300136"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Koenig, S., Likhachev, M., Furcy, D.: Lifelong planning A*. Artificial Intelligence, 1\u20132 (2004)","DOI":"10.1016\/j.artint.2003.12.001"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Chabini, I.: A New Algorithm for Shortest Paths in Discrete Dynamic Networks. In: 8th IFAC\/IFIP\/IFORS Symposium on transportation systems, Tech. Univ. Crete, Greece, pp. 16\u201318 (1997)","DOI":"10.1016\/S1474-6670(17)43876-6"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Cooke, K.L., Hasley, E.: The Shortest Route through a Network with Time-dependent Intermodal Transit Times. Journal of Mathematical Analysis and Applications, 493\u2013498 (1996)","DOI":"10.1016\/0022-247X(66)90009-6"},{"key":"14_CR7","unstructured":"Koenig, S., Likhachev, M.: Incremental A*, Georgia Institute of Technology, Atlanta, GA 30312-0280 (2001)"},{"key":"14_CR8","unstructured":"Djidjev, H.N.: Improved Algorithms for Dynamic Shortest Paths, Computer Science Department, Rice University (1996)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/11535331_11","volume-title":"Advances in Spatial and Temporal Databases","author":"M. Terrovitis","year":"2005","unstructured":"Terrovitis, M., Bakiras, S., Papadias, D., Mouratidis, K.: Constrained shortest path computation. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol.\u00a03633, pp. 181\u2013199. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Web and Wireless Geographical Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11599289_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:57:58Z","timestamp":1619506678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11599289_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540308485","9783540324232"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11599289_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}