Towards Simplified Optimal Sector Splitting Billy Josefsson - LFV - - PowerPoint PPT Presentation

towards simplified optimal sector splitting
SMART_READER_LITE
LIVE PREVIEW

Towards Simplified Optimal Sector Splitting Billy Josefsson - LFV - - PowerPoint PPT Presentation

Towards Simplified Optimal Sector Splitting Billy Josefsson - LFV Valentin Polishchuk, Leonid Sedov - Linkping University dynamic Demand Capacity Balancing (dCDB) Traffic density - changing Sectors - static 9:00 AM Controller A - A


slide-1
SLIDE 1

Towards Simplified Optimal Sector Splitting

Billy Josefsson - LFV Valentin Polishchuk, Leonid Sedov - Linköping University

slide-2
SLIDE 2

dynamic Demand Capacity Balancing (dCDB)

Traffic density - changing Sectors - static A B Controller A - Controller B - 9:00 AM Everyone is happy! For how long?

2

slide-3
SLIDE 3

dynamic Demand Capacity Balancing (dCDB)

Traffic density - changing Sectors - static A B Controller A - Controller B - 12:00 Solution?

3

slide-4
SLIDE 4

dynamic Demand Capacity Balancing (dCDB)

Traffic density - changing Sectors - static A B Controller A - Controller B - Controller C - 12:00 C Everyone is happy again

4

slide-5
SLIDE 5

dynamic Demand Capacity Balancing (dCDB)

Traffic density - changing Sectors - static A B Controller A - Controller B - Controller C - 14:00 C Do we need sector C?

5

$$$

slide-6
SLIDE 6

dynamic Demand Capacity Balancing (dCDB)

Traffic density - changing Sectors - static A B Controller A - Controller B - Controller C - 14:00 C Do we need sector C?

6

slide-7
SLIDE 7

dynamic Demand Capacity Balancing (dCDB)

Traffic density - changing Sectors - static A B Controller A - Controller B - 14:00

7

slide-8
SLIDE 8

Gluing

[Kjellin ‘14] [Yousefi and Donohue ‘04]

8

slide-9
SLIDE 9

Cutting

[Gerdes et al., SID’16]

9

slide-10
SLIDE 10

Binary split

Split airspace into 2 parts Need more sectors? - Do recursive split.

10

slide-11
SLIDE 11

Convex boundaries

Line segment intersects convex region at most once

11

slide-12
SLIDE 12

Straightline cuts

Chord joins two points on boundary

12

slide-13
SLIDE 13

KPIs

Maximum imbalance - peak complexity Average imbalance - total complexity Maximum imbalance

13

slide-14
SLIDE 14

KPIs

Maximum imbalance - peak complexity Average imbalance - total complexity Average imbalance Balance max or avg?

  • We can both!

14

slide-15
SLIDE 15

Input

  • Region P
  • Set S of straightline flight segments

○ Segment start and end coordinates ○ Times when aircraft enters and leaves segment

15

slide-16
SLIDE 16

Сritical points

16

slide-17
SLIDE 17

Сritical points

17

slide-18
SLIDE 18

Сritical points

18

slide-19
SLIDE 19

Сritical points

19

slide-20
SLIDE 20

Сritical points

20

slide-21
SLIDE 21

Сritical points

21

slide-22
SLIDE 22

Сritical points

22

slide-23
SLIDE 23

Ham sandwich theorem

23

http://www.etudes.ru/en/etudes/ham-sandwich-theorem/

slide-24
SLIDE 24

Proof: avg = 0 split exists for each point

24

slide-25
SLIDE 25

Proof: avg = 0 split exists for each point

25

1

slide-26
SLIDE 26

Proof: avg = 0 split exists for each point

26

1

slide-27
SLIDE 27

Proof: avg = 0 split exists for each point

27

1

slide-28
SLIDE 28

Proof: avg = 0 split exists for each point

28

0.1 0.9

slide-29
SLIDE 29

Proof: avg = 0 split exists for each point

29

0.6 0.4

slide-30
SLIDE 30

Proof: avg = 0 split exists for each point

30

0.5 0.5

slide-31
SLIDE 31

Proof: exists max & avg = 0 split

31

slide-32
SLIDE 32

Proof: exists max & avg = 0 split

32

avg = 0 max > 0

B A

ML(AB) = 3 MR(AB) = 2

slide-33
SLIDE 33

Proof: exists max & avg = 0 split

33

B A

avg = 0 max > 0 ML(AB) = 3 MR(AB) = 2

slide-34
SLIDE 34

Proof: exists max & avg = 0 split

34

avg = 0 max > 0

B A

ML(AB) = 4 MR(AB) = 2

slide-35
SLIDE 35

Proof: exists max & avg = 0 split

35

A B

avg = 0 max < 0 ML(AB) = 2 MR(AB) = 3

slide-36
SLIDE 36

Proof: exists max & avg = 0 split

36

avg = 0 max > 0

B A

ML(AB) = 3 MR(AB) = 2

slide-37
SLIDE 37

1: Find critical points

37

slide-38
SLIDE 38

2: Lines through all pairs of critical points

38

slide-39
SLIDE 39

2: Lines through all pairs of critical points

39

slide-40
SLIDE 40

2: Lines through all pairs of critical points

40

slide-41
SLIDE 41

3: Find pairs of intervals with 0 M-imbalance

41

slide-42
SLIDE 42

3: Find pairs of intervals with 0 M-imbalance

42

slide-43
SLIDE 43

3: Find pairs of intervals with 0 M-imbalance

43

slide-44
SLIDE 44

3: Find pairs of intervals with 0 M-imbalance

44

slide-45
SLIDE 45

3: Find pairs of intervals with 0 M-imbalance

45

slide-46
SLIDE 46

4: Look for avg-balanced splits

46

slide-47
SLIDE 47

4: Look for avg-balanced splits

47

slide-48
SLIDE 48

Artificial example

48

slide-49
SLIDE 49

M-imbalance changes

49

slide-50
SLIDE 50

Rectangular boundary

50

slide-51
SLIDE 51

Straightline flight segments

51

slide-52
SLIDE 52

Optimal cut

52

slide-53
SLIDE 53

All optimal cuts

53

slide-54
SLIDE 54

Second cut

54

slide-55
SLIDE 55

Second cut

55

slide-56
SLIDE 56

Further research

  • Multiple sectors
  • Directions of flights
  • Interaction between flights and boundaries
  • Choose between optimal cuts (KPI?)

56

slide-57
SLIDE 57

Further research

  • Multiple sectors
  • Directions of flights
  • Interaction between flights and boundaries
  • Choose between optimal cuts (KPI?)

57

THANK YOU!