An emergency refuelling problem over a dynamically changing environment in the context of unmanned aerial vehicles

2008 Mediterranean Conference on Control and Automation - Conference Proceedings, MED'08

Volumn , Issue , 2008, Pages 703-708

  Kladis, G P ^a   Economou, J T ^a   Tsourdos, A ^a   White, B A ^a   Knowles, K ^a  

^a CRANFIELD UNIVERSITY   (United Kingdom)

Author keywords

Dynamically changing environment; Energy conservation; Energy cost matrix; Graph theory; Location theory; Re fueling station; Shortest path; UAV

Indexed keywords

ENERGY CONSERVATION; GRAPH THEORY; INDUSTRIAL ENGINEERING; MILITARY APPLICATIONS; STATIC ANALYSIS; TOPOLOGY; UNMANNED VEHICLES; VEHICLE ROUTING; VEHICLES;

APPLICATION DOMAINS; CHANGING ENVIRONMENTS; CONTROL AND AUTOMATION; DYNAMICALLY CHANGING ENVIRONMENT; ENERGY COST MATRIX; ENERGY REQUIREMENTS; ENERGY RESERVES; LOCATION THEORY; RE-FUELING STATION; REAL-WORLD; ROUTING PROBLEMS; SHORTEST PATH; SHORTEST-PATH ALGORITHMS; SIMULATION EXAMPLE; UAV; UNMANNED AERIAL VEHICLES;

UNMANNED AERIAL VEHICLES (UAV);

EID: 52949127576     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MED.2008.4602182     Document Type: Conference Paper

References (23)

1. J. Economou, G. P. Kladis, A. Tsourdos, and B. White, "A node-to-node composite graph and pseudo-boolean modeling: A uav energy application." In Journal of Aerospace Engineering. Proceedings of the Institution of Mechanical Engineering, vol. 221, no. 5, pp. 815-830, October 2007.
2. S. Even and H. Gazit, "Updating distances in dynamic graphs," Meth. Oper. Res., vol. 49, pp. 371-387, 1985.
3. G. Gallo, "Reoptimization procedures in shortest path problem," Decisions in Economics and Finance, vol. 3, no. 1, pp. 3-13, March 1980.
4. K. L. Cooke and E. Halsey, "The shortest route through a netwozk with time-dependent inter- nodal transit times," J. Math. Anal. and Appl., vol. 14, pp. 493-498, 1966.
5. E. Klafszky, "Determination of shortest path in a network with time-dependent edge-lengths." Math. Oper. Stat., vol. 3, pp. 255-257, 1972.
6. A. Orda and R. Rom, "Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length," Journal of the ACM, vol. 37, no. 3, pp. 607-625, July 1990.
7. E. W. Dijkstra, "A note on two problems in connexion, with graphs." In Numerische Math., vol. 1, pp. 269-271, 1959.
8. Z. Wang and J. Crowcroft, "Analysis of shortest-path routing algorithms in a dynamic network environment," ACM SIGCOMM Computer Communication Review, pp. 63-71, 1992.
9. C. H. Papadimitriou and M. Yannakakis, "Shortest paths without a map," Theoretical Computer Science, vol. 84(Issue 1), pp. 127-150, July 1991.
10. K. Nachtigall, "Time depending shortest-path problems with applications to railway networks." European Journal of Operational Research, vol. 83, pp. 154-166, 1995.
11. D. E. Kaufman and R. L. Smith, "Fastest paths in time-dependent networks for intelligent vehicle-highway systems application," Journal of Intelligent Transportation Systems, vol. 1, no. 1, pp. 1-11, 1993.
12. X. Cai, T. Kloks, and W. C. K., "Time-varying shortest path problems with constraints," Networks, no. John Wiley and Sons, Inc, pp. 141-149, 1997.
13. T. Feder, R. Motwani, L. O. Callaghan, C. Olston, and R. Panigrahy, "Computing shortest paths with uncertainty," Journal of Algorithms., vol. 62, pp. 1-18, 2007.
14. X. Ji, K. Iwamura, and Z. Shao, "New models for shortest path problem with fuzzy arc lengths," Applied Mathematical Modelling, 2007 - Elsevier, vol. 31, pp. 259-269, 2007.
15. H. Eiselt and G. Laporte, "Objectives in location problems." In Drezner, Z. (Ed.), Facility Location: A Survey of Applications and Methods. Springer-Verlag, Berlin, pp. 151-180, 1995.
16. M. L. Brandeau and S. S. Chiu, "An overview of representative problems in. location research," Management Science, vol. 35, pp. 645-674, 1989.
17. C. S. ReVelle and H. A. Eiselt, "Location analysis: A synthesis and survey," European Journal of Operations Research, vol. 165, pp. 1-19, 2005.
18. G. P. Kladis, J. Economou, A. Tsourdos, and B. White, "Optimality and reachability - pseudo boolean power flows for a milti-sourced vehicle topologies," In IEEE 2007 Vehicle Power and Propulsion Conference, VPPC 2007, 9-12 Sept. Arlinghton, Texas, USA, 2007.
19. E. Dreyfus, "An appraisal of some shortest-path algorithms," Operations Research, vol. 17, no. 3, pp. 395-412, May - Jun. 1968.
20. R. W. Floyd, "Algorithm 97: Shortest path algorithm." In Journal of ACM, vol. 5, no. 6, p. 345, 1962.
21. G. B. Dantzig, "All shortest routes in a graph," Proceeding of International Symbosiwn, Operational Research, Rome, pp. 91-92, July 1966.
22. N. Christofides, Graph theory an algorithmic Approach. Acadamic Press INC. (London) LTD, 1975.
23. J. Economou, G. P. Kladis, A. Tsourdos, and B. White, "Uav optimum energy assignment using dijkstra algorithm." European Control Conference , ECC 2007, Kos, Greece, 2-5 July 2007.