Zobrazeno 1 - 10
of 63
pro vyhledávání: '"Chiarandini, Marco."'
Given the counters of vehicles that traverse the roads of a traffic network, we reconstruct the travel demand that generated them expressed in terms of the number of origin-destination trips made by users. We model the problem as a bi-level optimizat
Externí odkaz:
http://arxiv.org/abs/2202.00099
Autor:
Andersen, Nicklas Sindlev, Chiarandini, Marco, Jänicke, Stefan, Tampakis, Panagiotis, Zimek, Arthur
Wandering is a problematic behavior in people with dementia that can lead to dangerous situations. To alleviate this problem we design an approach for the real-time automatic detection of wandering leading to getting lost. The approach relies on GPS
Externí odkaz:
http://arxiv.org/abs/2110.13128
We describe the architecture of Sammen Om Demens (SOD), an application for portable devices aiming at helping persons with dementia when wandering and getting lost through the involvement of caregivers, family members, and ordinary citizens who volun
Externí odkaz:
http://arxiv.org/abs/2103.06777
Publikováno v:
In Computers and Operations Research February 2012 39(2):269-282
Autor:
Chiarandini, Marco1 marco@imada.sdu.dk, Fagerberg, Rolf1 rolf@imada.sdu.dk, Gualandi, Stefano2 stefano.gualandi@unipv.it
Publikováno v:
Annals of Operations Research. Apr2019, Vol. 275 Issue 1, p39-78. 40p.
Publikováno v:
AI and Ethics; 20230101, Issue: Preprints p1-27, 27p
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
https://findresearcher.sdu.dk:8443/ws/files/153046944/Heuristic_Variants_for_A_Search_in_3D_Flight_Planning.pdf
Publikováno v:
Knudsen, A N, Chiarandini, M & Larsen, K S 2017, Constraint Handling in Flight Planning . in J Christopher Beck (ed.), 23rd International Conference on Principles and Practice of Constraint Programming . Springer, Lecture Notes in Computer Science, vol. 10416, pp. 354-369, 23rd International Conference on Principles and Practice of Constraint Programming, Melbourne, Victoria, Australia, 28/08/2017 . https://doi.org/10.1007/978-3-319-66158-2_23
Flight routes are paths in a network, the nodes of which represent waypoints in a 3D space. A common approach to route planning is first to calculate a cheapest path in a 2D space, and then to optimize the flight cost in the third dimension. We focus
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3062::69969a3597abf48f2da83cf6802091bf
https://portal.findresearcher.sdu.dk/da/publications/d6b95d2c-7759-4c29-b9f9-4c0ba8acda08
https://portal.findresearcher.sdu.dk/da/publications/d6b95d2c-7759-4c29-b9f9-4c0ba8acda08
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