An emergency refuelling problem over a dynamically changing environment in the context of Unmanned Aerial Vehicles
暂无分享,去创建一个
A. Tsourdos | J.T. Economou | K. Knowles | B.A. White | G.P. Kladis | A. Tsourdos | B. White | K. Knowles | J. Economou | G. Kladis
[1] Giorgio Gallo,et al. Reoptimization procedures in shortest path problem , 1980 .
[2] Gilbert Laporte,et al. OBJECTIVES IN LOCATION PROBLEMS. , 1995 .
[3] K. Cooke,et al. The shortest route through a network with time-dependent internodal transit times , 1966 .
[4] Ariel Orda,et al. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.
[5] Emil Klafszky,et al. Determination of shortest path in a network with time-dependent edge-lengths 1 , 1972 .
[6] Robert L. Smith,et al. Fastest Paths in Time-dependent Networks for Intelligent Vehicle-Highway Systems Application , 1993, J. Intell. Transp. Syst..
[7] Horst A. Eiselt,et al. Location analysis: A synthesis and survey , 2005, Eur. J. Oper. Res..
[8] Jon Crowcroft,et al. Analysis of shortest-path routing algorithms in a dynamic network environment , 1992, CCRV.
[9] B. A. White,et al. UAV optimum energy assignment using Dijkstra's Algorithm , 2007, 2007 European Control Conference (ECC).
[10] Xiaoyu Ji,et al. New models for shortest path problem with fuzzy arc lengths , 2007 .
[11] George B. Dantzig,et al. ALL SHORTEST ROUTES IN A GRAPH , 1966 .
[12] K. Nachtigall. Time depending shortest-path problems with applications to railway networks , 1995 .
[13] A. Tsourdos,et al. Optimality and Reachability - Pseudo Boolean Power Flows for multi-sourced Vehicle Topologies , 2007, 2007 IEEE Vehicle Power and Propulsion Conference.
[14] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..
[15] Shimon Even,et al. Updating distances in dynamic graphs , 1985 .
[16] Said Salhi,et al. Facility Location: A Survey of Applications and Methods , 1996 .
[17] Chak-Kuen Wong,et al. Time-varying shortest path problems with constraints , 1997, Networks.
[18] Mihalis Yannakakis,et al. Shortest Paths Without a Map , 1989, Theor. Comput. Sci..
[19] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[20] Rajeev Motwani,et al. Computing shortest paths with uncertainty , 2007, J. Algorithms.
[21] Shimon Even,et al. How to keep a dynamic distributive directed graph acyclic and yet grant all requests of edge additions , 1990, Proceedings of the 5th Jerusalem Conference on Information Technology, 1990. 'Next Decade in Information Technology'.
[22] E. Kay,et al. Graph Theory. An Algorithmic Approach , 1975 .
[23] M. Brandeau,et al. An overview of representative problems in location research , 1989 .
[24] Antonios Tsourdos,et al. A node-to-node composite graph and pseudo-Boolean modelling: An unmanned aerial vehicle energy application , 2007 .