Finding optimal flight path in a segmented airspace

1
Finding optimal flight path in a segmented
airspace

• Wojciech KULAS
• Dariusz PIERZCHALA
• Zbigniew TARAPATA
• Tomasz TARNAWSKI

Military Communications and Information Systems
Conference, Kraków, 23-24.09.2008
2
MAIN POINTS

• PURPOSE
• Finding optimal route between two points
• Observing airspace segmentation (mandatory and
  forbidden areas, corridors)
• Other constraints fuel consumption, time etc.
• ALGORITHM
• Constructing graph to represent airspace
  segmentation
• Nodes characteristic points
• Edges connect nodes that see each other
• Separate consideration for air corridors
• Finding shortest path in the graph (Dijkstra or
  A algorithm)
• IMPLEMENTATION
• Java programming language
• Part of a system of military decision support
• Presentation utilizes OpenMapTM packages.

3
ILUSTRATION FOR THE ALGORITHM

• Nodes ? visibility edges ? corridors ? flight
  path

4
THANK YOU VERY MUCH FOR YOUR ATTENTION
Wojciech KULAS Dariusz PIERZCHALA Zbigniew
TARAPATA Tomasz TARNAWSKI
Military Communications and Information Systems
Conference, Kraków, 23-24.09.2008