{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T14:27:01Z","timestamp":1787063221542,"version":"build-2736575974"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,1,30]],"date-time":"2017-01-30T00:00:00Z","timestamp":1485734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,30]],"date-time":"2017-01-30T00:00:00Z","timestamp":1485734400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["FT120100832"],"award-info":[{"award-number":["FT120100832"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP130104587"],"award-info":[{"award-number":["DP130104587"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s00778-017-0455-8","type":"journal-article","created":{"date-parts":[[2017,1,30]],"date-time":"2017-01-30T06:28:19Z","timestamp":1485757699000},"page":"373-397","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Finding lowest-cost paths in settings with safe and preferred zones"],"prefix":"10.1007","volume":"26","author":[{"given":"Saad","family":"Aljubayrin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianzhong","family":"Qi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian S.","family":"Jensen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhen","family":"He","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuan","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,1,30]]},"reference":[{"key":"455_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A hub-based labeling algorithm for shortest paths in road networks. In: SEA, pp. 230\u2013241 (2011)","DOI":"10.1007\/978-3-642-20662-7_20"},{"key":"455_CR2","doi-asserted-by":"crossref","unstructured":"Aljubayrin, S., Qi, J., Jensen, C.S., Zhang, R., He, Z., Wen, Z.: The safest path via safe zones. In: ICDE, pp. 531\u2013542 (2015)","DOI":"10.1109\/ICDE.2015.7113312"},{"key":"455_CR3","doi-asserted-by":"crossref","unstructured":"Bast, H., Delling, D., Goldberg, A., M\u00fcller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, R.F.: Route planning in transportation networks. In: Kliemann, L., Sanders, P. (eds.) Algorithm Engineering, vol. 9220, pp. 19\u201380. Springer (2016)","DOI":"10.1007\/978-3-319-49487-6_2"},{"key":"455_CR4","doi-asserted-by":"crossref","unstructured":"Berg, J., Overmars, M.: Planning the shortest safe path amidst unpredictably moving obstacles. In: Algorithmic Foundation of Robotics VII, pp. 103\u2013118 (2008)","DOI":"10.1007\/978-3-540-68405-3_7"},{"key":"455_CR5","doi-asserted-by":"crossref","unstructured":"Bortoff, S.A.: Path planning for UAVs. In: American Control Conference, pp. 364\u2013368 (2000)","DOI":"10.1109\/ACC.2000.878915"},{"key":"455_CR6","unstructured":"Dehn, E.: Algebraic equations: an introduction to the theories of Lagrange and Galois. Courier Corporation (2012)"},{"key":"455_CR7","unstructured":"Delling, D., Goldberg, A.V., Nowatzyk, A., Werneck, R.F.: PHAST: Hardware-accelerated shortest path trees. J. Paral. Distrib. Comput. 73(7), 940\u2013952 (2013)"},{"key":"455_CR8","doi-asserted-by":"crossref","unstructured":"Efentakis, A., Pfoser, D.: ReHub: Extending hub labels for reverse k-nearest neighbor queries on large-scale networks. J. Exp. Alg. 21(1), 1\u201313 (2016)","DOI":"10.1145\/2990192"},{"key":"455_CR9","doi-asserted-by":"crossref","unstructured":"Eunus\u00a0Ali, M., Zhang, R., Tanin, E., Kulik, L.: A motion-aware approach to continuous retrieval of 3d objects. In: ICDE, pp. 843\u2013852 (2008)","DOI":"10.1109\/ICDE.2008.4497493"},{"issue":"6","key":"455_CR10","first-page":"345","volume":"5","author":"WF Robert","year":"1962","unstructured":"Robert, W.F.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)","journal-title":"Commun. ACM"},{"key":"455_CR11","doi-asserted-by":"crossref","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: SEA, pp. 319\u2013333 (2008)","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"455_CR12","volume-title":"Modern differential geometry of curves and surfaces with mathematica","author":"A Gray","year":"2006","unstructured":"Gray, A., Abbena, E., Salamon, S.: Modern differential geometry of curves and surfaces with mathematica. Chapman and Hall\/CRC, London (2006)"},{"issue":"2","key":"455_CR13","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1006\/dspr.2001.0391","volume":"11","author":"C Hallam","year":"2001","unstructured":"Hallam, C., Harrison, K.J., Ward, J.A.: A multiobjective optimal path algorithm. Dig. Signal Process. 11(2), 133\u2013143 (2001)","journal-title":"Dig. Signal Process."},{"key":"455_CR14","unstructured":"Helgason, R.V., Kennington, J.L., Lewis, K.H.: Shortest path algorithms on grid graphs with applications to strike planning. Technical report, DTIC Document (1997)"},{"issue":"2","key":"455_CR15","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"HV Jagadish","year":"2005","unstructured":"Jagadish, H.V., Ooi, B.C., Tan, K.-L., Yu, C., Zhang, R.: iDistance: An adaptive B+-tree based indexing method for nearest neighbor search. TODS 30(2), 364\u2013397 (2005)","journal-title":"TODS"},{"issue":"4","key":"455_CR16","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10462-010-9157-y","volume":"33","author":"R Kala","year":"2010","unstructured":"Kala, R., Shukla, A., Tiwari, R.: Fusion of probabilistic A* algorithm and fuzzy inference system for robotic path planning. Artif. Intell. Rev. 33(4), 307\u2013327 (2010)","journal-title":"Artif. Intell. Rev."},{"key":"455_CR17","doi-asserted-by":"crossref","unstructured":"Koudas, N., Ooi, B.C., Tan, K.-L., Zhang, R.: Approximate NN queries on streams with guaranteed error\/performance bounds. In: VLDB, pp. 804\u2013815, (2004)","DOI":"10.1016\/B978-012088469-8.50071-1"},{"key":"455_CR18","doi-asserted-by":"crossref","unstructured":"Lambert, A., Bouaziz, S., Reynaud, R.: Shortest safe path planning for vehicles. In: Intelligent Vehicles Symposium, pp. 282\u2013286 (2003)","DOI":"10.1109\/IVS.2003.1212923"},{"key":"455_CR19","first-page":"4185","volume":"3","author":"A Lambert","year":"2003","unstructured":"Lambert, A., Gruyer, D.: Safe path planning in an uncertain-configuration space. Robot. Autom. 3, 4185\u20134190 (2003)","journal-title":"Robot. Autom."},{"issue":"1","key":"455_CR20","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1201\/b12690-17","volume":"9","author":"L Leenen","year":"2012","unstructured":"Leenen, L., Terlunen, A., Le Roux, H.: A constraint programming solution for the military unit path finding problem. Mob. Intell. Auto. Syst. 9(1), 225\u2013240 (2012)","journal-title":"Mob. Intell. Auto. Syst."},{"key":"455_CR21","doi-asserted-by":"crossref","unstructured":"Li, C., Gu, Y., Qi, J., Yu, G., Zhang, R., Deng, Q.: INSQ: an influential neighbor set based moving knn query processing system. In: ICDE, pp. 1338\u20131341 (2016)","DOI":"10.1109\/ICDE.2016.7498339"},{"key":"455_CR22","doi-asserted-by":"crossref","unstructured":"Lu, Y., Shahabi, C.: An arc orienteering algorithm to find the most scenic path on a large-scale road network. In: SIGSPATIAL, pp. 46:1\u201346:10 (2015)","DOI":"10.1145\/2820783.2820835"},{"issue":"1","key":"455_CR23","first-page":"3195","volume":"7","author":"S Mittal","year":"2007","unstructured":"Mittal, S., Deb, K.: Three-dimensional offline path planning for UAVs using multiobjective evolutionary algorithms. Congr. Evolut. Comput. 7(1), 3195\u20133202 (2007)","journal-title":"Congr. Evolut. Comput."},{"key":"455_CR24","doi-asserted-by":"crossref","unstructured":"Mora, A.M., Merelo, J.J., Millan, C., Torrecillas, J., Laredo, J.L.J., Castillo, P.A.: Enhancing a MOACO for solving the bi-criteria pathfinding problem for a military unit in a realistic battlefield. In: Applications of Evolutionary Computing, pp. 712\u2013721 (2007)","DOI":"10.1007\/978-3-540-71805-5_77"},{"issue":"1","key":"455_CR25","first-page":"1095","volume":"1","author":"S Nutanong","year":"2008","unstructured":"Nutanong, S., Zhang, R., Tanin, E., Kulik, L.: The V*-diagram: a query-dependent approach to moving KNN queries. PVLDB 1(1), 1095\u20131106 (2008)","journal-title":"PVLDB"},{"issue":"2","key":"455_CR26","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/356924.356930","volume":"16","author":"H Samet","year":"1984","unstructured":"Samet, H.: The quadtree and related hierarchical data structures. ACM Comput. Surv. 16(2), 187\u2013260 (1984)","journal-title":"ACM Comput. Surv."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-017-0455-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-017-0455-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-017-0455-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T17:35:41Z","timestamp":1749922541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-017-0455-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,30]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["455"],"URL":"https:\/\/doi.org\/10.1007\/s00778-017-0455-8","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,30]]},"assertion":[{"value":"6 April 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2017","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2017","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}