Download presentation

Presentation is loading. Please wait.

Published byMaximilian Reed Modified over 2 years ago

1
On the Optimal Conflict Resolution for Air Traffic Control Dept. Of Electrical Systems and Automation Pisa University Laboratory of Information and Decision Systems MIT Lucia Pallottino Eric Feron Antonio Bicchi JUP Meeting January 18-19, 2001

2
Introduction ä Formulation as Optimal Control Problem (OCP): ä Extremal solution (PMP): â Unconstrained path; â Constrained path of zero length; â Constrained path of non-zero length; ä Conflict Resolution Algorithm; ä Formulation as a Mixed Integer Programming (MIP)

3
Model of OCP Motion of aircraft subject to some constraint: u linear velocity parallel to a fixed axis on the vehicle u constant non negative linear velocities u bounded steering radius u Minimum distance between aircraft GOAL: given an initial and a final configuration for each aircraft, find the collision free paths of minimum total time.

4
The OCP collision constraint :

5
Unconstrained Optimal Solution for OCP Optimal solution will consist of concatenations of free and constrained arcs, e.g. Unconstrained Constrained

6
u Extremal unconstrained path are concatenation of F s egment F Arc of a circle Unconstrained paths for OCP Type S Type C

7
Extremal free paths of type CSC

8
Extremal free paths of type CCC

9
Velocities are parallel and the line joining the two aircraft can only translate Velocities are symmetric respect to the line joining the two aircraft Contact Configuration

10
Conflict Resolution Algorithm

12
Model of MIP Motion of aircraft subject to some constraint: u linear velocity parallel to a fixed axis on the vehicle u constant non negative linear velocities u Minimum distance between aircraft u Maneuver: heading angle instantaneous change GOAL: given an initial and a final configuration for each aircraft, find a single “minimum” maneuver to avoid all possible conflict.

13
Configuration after maneuver: Maneuvre scenario for MIP A C B Initial Configuration:

14
Nonintersecting direction of motion Constraints that are function of and are linear in

15
Intersecting direction of motion A B B Constraints that are function of and are linear in

16
are linear function in Linear constraint for MIP “big” positive number Boolean variables

17
Minimum deviation problem: Aircraft variables constraints u The MIP problem

18
CPLEX Solutions

24
n (Aircraft) Time (sec.) Length (nm) Delta (nm) 5 0.34 120 0.25 7 1.18 120 0.55 10 5.91 200 0.45 11 10.4 200 0.79 CPLEX Simulation

Similar presentations

OK

An Iterated Method to the Dubins Vehicle Travelling Salesman Problem OBJECTIVES Develop an algorithm to compute near optimal solutions to the Travelling.

An Iterated Method to the Dubins Vehicle Travelling Salesman Problem OBJECTIVES Develop an algorithm to compute near optimal solutions to the Travelling.

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on disaster management act 2005 Ppt on strings in c language Viewer ppt online ticket Ppt on world book day dress Financial management books free download ppt on pollution Ppt on brand marketing job Ppt on network theory pdf Ppt on physical layer of osi model Ppt on summary writing powerpoint Ppt on group development in education