Heuristic Variants for A* Search in 3D Flight Planning

Autor: Knudsen, Anders Nicolai, Chiarandini, Marco, Larsen, Kim Skak

Publikováno v: Knudsen, A N, Chiarandini, M & Larsen, K S 2018, Heuristic Variants for A* Search in 3D Flight Planning . in W-J van Hoeve (ed.), Integration of Constraint Programming, Artificial Intelligence, and Operations Research : 15th International Conference, CPAIOR 2018, Delft, The Netherlands, June 26–29, 2018, Proceedings . 1 edn, Springer, Lecture Notes in Computer Science, vol. 10848, pp. 361-376, 15th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, Delft, Netherlands, 26/06/2018 . https://doi.org/10.1007/978-3-319-93031-2_26

A crucial component of a flight plan to be submitted for approval to a control authority in the pre-flight phase is the prescription of a sequence of airways and airway points in the sky that an aircraft has to follow to cover a given route. The gene

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______3062::5f76ea5b6870216ed4af252e59dc4f8d
https://findresearcher.sdu.dk:8443/ws/files/153046944/Heuristic_Variants_for_A_Search_in_3D_Flight_Planning.pdf

Relaxing the Irrevocability Requirement for Online Graph Algorithms

Autor: Boyar, Joan, Favrholdt, Lene Monrad, Kotrbcik, Michal, Larsen, Kim Skak

Publikováno v: Boyar, J, Favrholdt, L M, Kotrbcik, M & Larsen, K S 2017, Relaxing the Irrevocability Requirement for Online Graph Algorithms . in F Ellen, A Kolokolova & J-R Sack (eds), Algorithms and Data Structures : Proceedings of the 15th International Symposium on Algorithms and Data Structures . Springer, Lecture Notes in Computer Science, vol. 10389, pp. 217-228, 15th International Algorithms and Data Structures Symposium 2017, St. John's, Newfoundland and Labrador, Canada, 30/07/2017 . https://doi.org/10.1007/978-3-319-62127-2_19

Online graph problems are considered in models where the irrevocability requirement is relaxed. Motivated by practical examples where, for example, there is a cost associated with building a facility and no extra cost associated with doing it later,

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______3062::ba9c675ac9682f016f890fdd5e401440
https://findresearcher.sdu.dk:8443/ws/files/141252467/Relaxing_the_Irrevocability_Requirement_for_Online_Graph_Algorithms.pdf

Flight Planning in Free Route Airspaces

Autor: Kehlet Jensen, Casper, Chiarandini, Marco, Larsen, Kim Skak

Publikováno v: Kehlet Jensen, C, Chiarandini, M & Larsen, K S 2017, Flight Planning in Free Route Airspaces . in G D'Angelo & T Dollevoet (eds), 17th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems . Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, OpenAccess Series in Informatics, vol. 59, pp. 14:1-14:14, 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, Vienna, Austria, 04/09/2017 . https://doi.org/10.4230/OASIcs.ATMOS.2017.14

We consider the problem of finding cheapest flight routes through free route airspaces in a 2D setting. We subdivide the airspace into regions determined by a Voronoi subdivision around the points from a weather forecast. This gives rise to a regular

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8e4cbb9bf8ea36d4f6844a179c2ce1c

Batch Coloring of Graphs

Autor: Boyar, Joan, Epstein, Leah, Favrholdt, Lene Monrad, Larsen, Kim Skak, Levin, Asaf

Publikováno v: Boyar, J, Epstein, L, Favrholdt, L M, Larsen, K S & Levin, A 2017, Batch Coloring of Graphs . in M Mastrolilli & K Jansen (eds), Approximation and Online Algorithms : 14th International Workshop on Approximation and Online Algorithms, WAOA 2016 . Springer, Lecture Notes in Computer Science, vol. 10138, pp. 52-64, 14th International Workshop on Approximation and Online Algorithms, Aarhus, Denmark, 25/08/2016 . https://doi.org/10.1007/978-3-319-51741-4_5

In graph coloring problems, the goal is to assign a positive integer color to each vertex of an input graph such that adjacent vertices do not receive the same color assignment. For classic graph coloring, the goal is to minimize the maximum color us

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______3062::8665b34008da832418461222eeeb41c2
https://arxiv.org/pdf/1610.02997.pdf

Online Bounded Analysis

Autor: Boyar, Joan, Epstein, Leah, Favrholdt, Lene Monrad, Larsen, Kim Skak, Levin, Asaf

Publikováno v: Boyar, J, Epstein, L, Favrholdt, L M, Larsen, K S & Levin, A 2016, Online Bounded Analysis . in A S Kulikov & G J Woeginger (eds), Computer Science – Theory and Applications : 11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings . Springer, Lecture Notes in Computer Science, vol. 9691, pp. 131-145, 11th International Computer Science Symposium in Russia, St. Petersburg, Russian Federation, 09/06/2016 . https://doi.org/10.1007/978-3-319-34171-2_10

Though competitive analysis is often a very good tool for the analysis of online algorithms, sometimes it does not give any insight and sometimes it gives counter-intuitive results. Much work has gone into exploring other performance measures, in par

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______3062::8f9eff5b0564984dc93bbed086a41664
https://portal.findresearcher.sdu.dk/da/publications/1696205a-7b53-4653-b380-089c79a4fba5