| 1. |
- Patrinopoulou, N., et al.
(författare)
-
Metropolis II: Investigating the Future Shape of Air Traffic Control in Highly Dense Urban Airspace
- 2022
-
Ingår i: 2022 30TH MEDITERRANEAN CONFERENCE ON CONTROL AND AUTOMATION (MED). - : IEEE. - 9781665406734 ; , s. 649-655
-
Konferensbidrag (refereegranskat)abstract
- Metropolis II aims to provide insights in what is needed to enable high-density urban air operations. It does this by investigating the foundation for U-space U3/U4 services. The final goal is to provide a unified approach for strategic deconfliction, tactical deconfliction, and dynamic capacity management. Highly-dense operations in constrained urban airspace will likely require a degree of complexity that does not exist in modern-day air traffic management. The expected high traffic demand will require a shared use of the airspace instead of assigning exclusive use of blocks of the airspace to some flights. A unified approach for traffic management is needed because at high-densities, airspace design, flight planning, and separation management become increasingly interdependent. Metropolis II builds upon the results of the first Metropolis project. Three concepts with a varying degree of centralisation will be compared using simulations. (1) The centralised concept will take a global approach for separation management. (2) The decentralised concept aims to give the individual agents separation responsibility. (3) The hybrid concept tries to combine a centralised strategic planning agent with a robust tactical separation strategy.
|
|
| 2. |
- Kevin A., Buchin, et al.
(författare)
-
Geometric secluded paths and planar satisfiability
- 2020
-
Ingår i: 36th International Symposium on Computational Geometry (SoCG 2020). - Dagstuhl, Germany. ; , s. 24:1-24:15
-
Konferensbidrag (refereegranskat)abstract
- We consider paths with low exposure to a 2D polygonal domain, i.e., paths which are seen as little as possible; we differentiate between integral exposure (when we care about how long the path sees every point of the domain) and 0/1 exposure (just counting whether a point is seen by the path or not). For the integral exposure, we give a PTAS for finding the minimum-exposure path between two given points in the domain; for the 0/1 version, we prove that in a simple polygon the shortest path has the minimum exposure, while in domains with holes the problem becomes NP-hard. We also highlight connections of the problem to minimum satisfiability and settle hardness of variants of planar min- and max-SAT.
|
|
