http://www.colloquiam.com/wd/index.php?action=history&feed=atom&title=Gianazza_2019aGianazza 2019a - Revision history2026-05-15T21:25:59ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10http://www.colloquiam.com/wd/index.php?title=Gianazza_2019a&diff=207198&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 930286370 to Gianazza 2019a2021-02-03T18:29:58Z<p>Scipediacontent moved page <a href="/public/Draft_Content_930286370" class="mw-redirect" title="Draft Content 930286370">Draft Content 930286370</a> to <a href="/public/Gianazza_2019a" title="Gianazza 2019a">Gianazza 2019a</a></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<tr style='vertical-align: top;' lang='en'>
<td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 18:29, 3 February 2021</td>
</tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Scipediacontenthttp://www.colloquiam.com/wd/index.php?title=Gianazza_2019a&diff=207197&oldid=prevScipediacontent: Created page with " == Abstract == International audience; In this paper, we introduce exact tree search algorithms which explore all the possible sequences of airspace partitions , taking into..."2021-02-03T18:29:55Z<p>Created page with " == Abstract == International audience; In this paper, we introduce exact tree search algorithms which explore all the possible sequences of airspace partitions , taking into..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
International audience; In this paper, we introduce exact tree search algorithms which explore all the possible sequences of airspace partitions , taking into account some constraints on the transitions between two successive airspace configurations. The transitions should be simple enough to allow air traffic controllers to maintain their situation awareness during the airspace configuration changes. For the same reason, once a sector is opened it should remain so for a minimum duration. The proposed method is a sequential A * algorithm with a rolling horizon. It finds a sequence of airspace configurations minimizing a cost related to the workload and the usage of manpower resources, while satisfying the transition constraints. This approach shows good results on 9 months of data from the french ATCC Aix (East), when compared with two baseline methods, one with a greedy approach and the other with no transition constraints.<br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [https://hal-enac.archives-ouvertes.fr/hal-02178437 https://hal-enac.archives-ouvertes.fr/hal-02178437],<br />
: [https://hal-enac.archives-ouvertes.fr/hal-02178437/document https://hal-enac.archives-ouvertes.fr/hal-02178437/document],<br />
: [https://hal-enac.archives-ouvertes.fr/hal-02178437/file/ATM_Seminar_2019_paper_29.pdf https://hal-enac.archives-ouvertes.fr/hal-02178437/file/ATM_Seminar_2019_paper_29.pdf]</div>Scipediacontent