Maklink Graph in Conflict-Free Airline Network Designing

DOI

10.2991/icmmita-16.2016.180How to use a DOI?

Keywords

Maklink graph; airline network; obstacle avoidance; Dijkstra algorithm

Abstract

This paper focuses on the issue of designing of conflict-free airline network Based on the free connecting lines and undirected graph structured by Maklink Graph method, a free airspace model was established, which provided alternative air passages for restricted airspace of airline network. Take the impact of restricted airspace on airline network into consideration, a fast airspace conflict detection algorithm was proposed to realize the whole airspace conflict detection for airline network, and invoked the Dijkstra algorithm for path replanning of airlines to structure the drivable airline network with the consideration of restricted airspaces.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yi-Ye Zhou
AU  - Deng-Kai Yao
AU  - Qian-Rui Sun
AU  - Qi-Ke Wu
PY  - 2017/01
DA  - 2017/01
TI  - Maklink Graph in Conflict-Free Airline Network Designing
BT  - Proceedings of the 2016 4th International Conference on Machinery, Materials and Information Technology Applications
PB  - Atlantis Press
SP  - 975
EP  - 979
SN  - 2352-538X
UR  - https://doi.org/10.2991/icmmita-16.2016.180
DO  - 10.2991/icmmita-16.2016.180
ID  - Zhou2017/01
ER  -