{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T14:12:18Z","timestamp":1785420738987,"version":"3.56.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,8,31]],"date-time":"2012-08-31T00:00:00Z","timestamp":1346371200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Robot Syst"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10846-012-9773-7","type":"journal-article","created":{"date-parts":[[2012,8,30]],"date-time":"2012-08-30T04:01:13Z","timestamp":1346299273000},"page":"255-269","source":"Crossref","is-referenced-by-count":33,"title":["Three-dimensional Route Planning for Unmanned Aerial Vehicles in a Risk Environment"],"prefix":"10.1007","volume":"71","author":[{"given":"Luitpold","family":"Babel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,8,31]]},"reference":[{"key":"9773_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, New York (1993)"},{"issue":"3","key":"9773_CR2","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s00186-011-0366-1","volume":"7","author":"L Babel","year":"2011","unstructured":"Babel, L.: Trajectory planning for unmanned aerial vehicles\u2014a network optimization approach. Math. Methods Oper. Res. 7(3), 343\u2013360 (2011)","journal-title":"Math. Methods Oper. Res."},{"issue":"4","key":"9773_CR3","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/net.3230190402","volume":"19","author":"J Beasley","year":"1989","unstructured":"Beasley, J., Christofides, N.: An algorithm for the resource constrained shortest path problem. Netw. 19(4), 379\u2013394 (1989)","journal-title":"Netw."},{"key":"9773_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"RE Bellman","year":"1958","unstructured":"Bellman, R.E.: On a routing problem. Q. Appl. Math. 16, 87\u201390 (1958)","journal-title":"Q. Appl. Math."},{"issue":"2","key":"9773_CR5","doi-asserted-by":"crossref","first-page":"193","DOI":"10.2514\/2.4231","volume":"21","author":"JT Betts","year":"1998","unstructured":"Betts, J.T.: Survey of numerical methods for trajectory optimization. J. Guid. Control Dyn. 21(2), 193\u2013207 (1998)","journal-title":"J. Guid. Control Dyn."},{"key":"9773_CR6","doi-asserted-by":"crossref","unstructured":"Bortoff, S.A.: Path planning for UAVs. In: Proc Am Control Conf, pp. 364\u2013368. Chicago, Illinois (2000)","DOI":"10.1109\/ACC.2000.878915"},{"issue":"3","key":"9773_CR7","first-page":"31","volume":"14","author":"WM Carlyle","year":"2009","unstructured":"Carlyle, W.M., Royset, J.O., Wood, R.K.: Routing military aircraft with a constrained shortest-path algorithm. Mil. Oper. Res. 14(3), 31\u201352 (2009)","journal-title":"Mil. Oper. Res."},{"key":"9773_CR8","volume-title":"Getting Started with Geographic Information Systems","author":"KC Clarke","year":"1997","unstructured":"Clarke, K.C.: Getting Started with Geographic Information Systems. Prentice Hall, Upper Saddle River, NJ (1997)"},{"key":"9773_CR9","volume-title":"Principles of Robot Motion: Theory, Algorithms, and Implementation","author":"H Choset","year":"2005","unstructured":"Choset, H., Burgard, W., Hutchinson, S., Kantor, G., Kavraki, L.E., Lynch, K., Thrun, S.: Principles of Robot Motion: Theory, Algorithms, and Implementation. MIT Press, Cambridge (2005)"},{"key":"9773_CR10","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2009)"},{"key":"9773_CR11","doi-asserted-by":"crossref","unstructured":"Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press (1962)","DOI":"10.7249\/R366"},{"key":"9773_CR12","doi-asserted-by":"crossref","unstructured":"De Filippis, L., Guglieri G.: Advanced graph search algorithms for path planning of flight vehicles. In: Agarwal, R.K. (ed.) Recent Advances in Aircraft Technology, pp. 159\u2013192. Intech (2012)","DOI":"10.5772\/37033"},{"key":"9773_CR13","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s10846-011-9568-2","volume":"65","author":"L Filippis De","year":"2012","unstructured":"De Filippis, L., Guglieri G., Quagliotti, F.: Path planning strategies for UAVs in 3D environments. J. Intell. Robot. Syst. 65, 247\u2013264 (2012)","journal-title":"J. Intell. Robot. Syst."},{"key":"9773_CR14","first-page":"117","volume-title":"Algorithmics LNCS, vol. 5515","author":"D Delling","year":"2009","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering route planning algorithms. In: Algorithmics LNCS, vol. 5515, pp. 117\u2013139. Springer, Berlin, Heidelberg (2009)"},{"key":"9773_CR15","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"3","key":"9773_CR16","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/net.10090","volume":"4","author":"I Dumitrescu","year":"2003","unstructured":"Dumitrescu, I., Boland, N.: Improved preprocessing, labeling and scaling algorithm for the weight-constrained shortest path problem. Netw. 4(3), 135\u2013153 (2003)","journal-title":"Netw."},{"issue":"6","key":"9773_CR17","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)","journal-title":"Commun. ACM"},{"key":"9773_CR18","volume-title":"Motion Planning in Dynamic Environments","author":"K Fujimura","year":"1992","unstructured":"Fujimura, K., Tunii, T.L.: Motion Planning in Dynamic Environments. Springer, Secaucus (1992)"},{"key":"9773_CR19","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)"},{"key":"9773_CR20","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10846-009-9383-1","volume":"57","author":"C Goerzen","year":"2010","unstructured":"Goerzen, C., Kong, Z., Mettler, B.: A survey of motion planning algorithms from the perspective of autonomous UAV guidance. J. Intell. Robot. Syst. 57, 65\u2013100 (2010)","journal-title":"J. Intell. Robot. Syst."},{"key":"9773_CR21","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: A* search meets graph theory. In: Proc 16th Annu ACM-SIAM Symp Discret Algorithms, pp. 156\u2013165 (2005)"},{"key":"9773_CR22","unstructured":"Halpern, M.E.: Optimal trajectories for aircraft terrain following and terrain avoidance\u2014a literature review update. Technical Report 5, DSTO Australia (1993)"},{"issue":"2","key":"9773_CR23","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"issue":"1","key":"9773_CR24","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R Hassin","year":"1992","unstructured":"Hassin, R.: Approximated schemes for the restricted shortest path problem. Math. Oper. Res. 17(1), 36\u201342 (1992)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"9773_CR25","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1023\/A:1011325912346","volume":"7","author":"RV Helgason","year":"2001","unstructured":"Helgason, R.V., Kennington, J.L., Lewis, K.R.: Cruise missile mission planning: a heuristic algorithm for automatic path generation. J. Heuristics 7(5), 473\u2013494 (2001)","journal-title":"J. Heuristics"},{"issue":"3","key":"9773_CR26","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1145\/136035.136037","volume":"24","author":"YK Hwang","year":"1992","unstructured":"Hwang, Y.K., Ahuja, N.: Gross motion planning\u2014a survey. ACM Comput. Surv. 24(3), 219\u2013291 (1992)","journal-title":"ACM Comput. Surv."},{"key":"9773_CR27","doi-asserted-by":"crossref","unstructured":"Jun, M., D\u2019Andrea, R.: Path planning for unmanned aerial vehicles in uncertain and adversarial environments. In: Cooperative Control: Models, Applications and Algorithms, Chapter 6, pp. 95\u2013111. Kluwer (2003)","DOI":"10.1007\/978-1-4757-3758-5_6"},{"key":"9773_CR28","doi-asserted-by":"crossref","unstructured":"Kothari, M., Postlethwaite, I., Gu, D.: Multi-UAV path planning in obstacle rich environments using rapidly-exploring random trees. In: Proc Joint 48th IEEE Conf Decision Control and 28th Chinese Control Conf, pp. 3069\u20133074 Shanghai, P.R. China (2009)","DOI":"10.1109\/CDC.2009.5400108"},{"issue":"5","key":"9773_CR29","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/MNET.2004.1337731","volume":"18","author":"FA Kuipers","year":"2004","unstructured":"Kuipers, F.A., Korkmaz, T., Krunz, M., Van Mieghem, P.: Performance evaluation of constraint-based path selection algorithms. IEEE Netw. 18(5), 16\u201323 (2004)","journal-title":"IEEE Netw."},{"key":"9773_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot Motion Planning","author":"JC Latombe","year":"1991","unstructured":"Latombe, J.C.: Robot Motion Planning. Kluwer Publishers, Boston (1991)"},{"key":"9773_CR31","doi-asserted-by":"crossref","unstructured":"LaValle, S.M.: Planning Algorithms. Cambridge University Press (2006)","DOI":"10.1017\/CBO9780511546877"},{"issue":"5","key":"9773_CR32","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0167-6377(01)00069-4","volume":"28","author":"DH Lorenz","year":"2001","unstructured":"Lorenz, D.H., Raz, D.: A simple efficient approximation scheme for the restricted shortest path problem. Oper. Res. Lett. 28(5), 213\u2013219 (2001)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"9773_CR33","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TAES.2007.357150","volume":"43","author":"SM Molarek","year":"2007","unstructured":"Molarek, S.M., Kosari, A.R.: Novel minimum time trajectory planning in terrain following flights. IEEE Trans. Aerosp. Electron. Syst. 43(1), 2\u201312 (2007)","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"issue":"2","key":"9773_CR34","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1109\/9.661081","volume":"43","author":"LC Polymenakos","year":"1998","unstructured":"Polymenakos, L.C., Bertsekas, D.P., Tsitsiklis, J.N.: Implementation of effcient algorithms for globally optimal trajectories. IEEE Trans. Automat. Contr. 43(2), 278\u2013283 (1998)","journal-title":"IEEE Trans. Automat. Contr."},{"issue":"4","key":"9773_CR35","doi-asserted-by":"crossref","first-page":"801","DOI":"10.2514\/1.7370","volume":"28","author":"E Rippel","year":"2005","unstructured":"Rippel, E., Bar-Gill, A., Shimkin, N.: Fast graph-search algorithms for general-aviation flight trajectory generation. J. Guid. Control Dyn. 28(4), 801\u2013811 (2005)","journal-title":"J. Guid. Control Dyn."},{"key":"9773_CR36","unstructured":"Sarris, Z.: Survey of UAV Applications in Civil Markets. STN ATLAS-3Sigma AE and Technical University of Crete, DPEM, 73100 Chania, Crete, Greece (2001)"},{"key":"9773_CR37","volume-title":"Geospatial analysis\u2014a comprehensive guide to principles","author":"M Smith de","year":"2009","unstructured":"de Smith, M., Longley, P., Goodchild, M.: Geospatial analysis\u2014a comprehensive guide to principles. Techniques and Software Tools. Leicester, UK (2009)"},{"issue":"9","key":"9773_CR38","doi-asserted-by":"crossref","first-page":"1528","DOI":"10.1109\/9.412624","volume":"40","author":"JN Tsitsiklis","year":"1995","unstructured":"Tsitsiklis, J.N.: Efficient algorithms for globally optimal trajectories. IEEE Trans. Automat. Contr. 40(9), 1528\u20131538 (1995)","journal-title":"IEEE Trans. Automat. Contr."},{"issue":"3","key":"9773_CR39","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1109\/48.107148","volume":"15","author":"CW Warren","year":"1990","unstructured":"Warren, C.W.: A technique for autonomous underwater vehicle route planning. IEEE J. Oceanic Eng. 15(3), 199\u2013204 (1990)","journal-title":"IEEE J. Oceanic Eng."},{"key":"9773_CR40","doi-asserted-by":"crossref","unstructured":"Zabarankin, M., Uryasev, S., Pardalos, P.: Optimal risk path algorithms. In: Murphey, R., Pardalos, P. (eds.) Cooperative Control and Optimization, pp. 271\u2013303. Kluwer, Dordrecht (2001)","DOI":"10.1007\/0-306-47536-7_13"},{"issue":"8","key":"9773_CR41","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1002\/nav.20165","volume":"53","author":"M Zabarankin","year":"2006","unstructured":"Zabarankin, M., Uryasev, S., Murphey, R.: Aircraft routing under the risk of detection. Nav. Res. Logist. 53(8), 728\u2013747 (2006)","journal-title":"Nav. Res. Logist."}],"container-title":["Journal of Intelligent & Robotic Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-012-9773-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10846-012-9773-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-012-9773-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T01:08:42Z","timestamp":1594602522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10846-012-9773-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,31]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["9773"],"URL":"https:\/\/doi.org\/10.1007\/s10846-012-9773-7","relation":{},"ISSN":["0921-0296","1573-0409"],"issn-type":[{"value":"0921-0296","type":"print"},{"value":"1573-0409","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,31]]}}}