File size: 31,333 Bytes
04dae2a
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621

	
	
		
I. IntroductionThe airspace of the future is expected to support Unmanned Aircraft Systems (UAS) aircraft operations that are orders of magnitude higher than conventional aviation traffic the National Airspace System (NAS) handles today [1][2][3].An important question is if there is a traffic density at which the airspace becomes too complex to operate.This paper presents an approach to estimate the complexity of a given UAS traffic scenario with an associated traffic density.The availability of airspace to meet traffic demand in a safe and efficient manner is central to airspace operations both today and in the future with increasing number of unmanned and manned vehicles sharing the airspace with commercial air traffic.Measures of airspace complexity are used by air traffic management to schedule flights and resolve conflicts.New measures of airspace complexity are needed to make traffic flow decisions as controller workload limitations are enhanced or removed in certain parts of the airspace by increased automation.In conventional aviation, air traffic complexity is evaluated from controller and pilot workload [4][5][6][7].Monitor Alert Parameter (MAP) [8], the maximum number of aircraft an Air Traffic Control (ATC) controller can simultaneously handle, is an example.Another example is Dynamic Density (DD) [9,10], a weighted summation of factors that affect the air traffic complexity.The complexity metrics are defined based on an assumption of a structured airspace and Air Traffic Management (ATM) that includes controller displays, sectors and airways [11][12][13].Fast-time and real-time simulation methods [14] are then used to evaluate a given traffic scenario.Intrinsic metrics have also been developed to estimate complexity in a sector independent of controller workload.Delahaye et.al. [15,16] proposed a geometrical approach based on the properties of relative positions and relative speeds of aircraft in a sector to obtain time histories of traffic divergence, convergence, and sensitivity.They also developed entropy based velocity vector field methods [16,17] to compute complexity maps for given traffic scenario snapshots.Future UAS traffic and its management would differ from conventional traffic in several ways.First, the high number of proposed operations suggests a need to shift from a human to an automated controller, negating the use of cognitive measures.Second, future operations may be free flight by nature i.e. using a predefined on-board conflict resolution model, they may prefer responsibility for determining their course independent of a global plan or system [2,18].Furthermore, a good and quick approximation of UAS traffic complexity, without the need for a full-scale simulation, would support a real-time assessment of traffic scenarios [19], re-planning of flight routes and schedules to alleviate traffic bottlenecks, and mitigation of operation risk.A set of different complexity metrics can together also help classification of traffic scenarios for traffic management studies.This paper extends an earlier approach by Xue [20] that introduced a scenario complexity metric based on the number of potential conflicts weighted by the associated conflict resolution cost.In this work, an impedance-based complexity metric is proposed.When the number of conflicts is high, a scenario is expected to be complex.However, it may not necessarily be so if those conflicts are isolated.The pattern of traffic flow also contributes to the complexity of the scenario, if the aircraft begin to impede the conflict resolutions of others in the airspace.The proposed impedance metric therefore accounts both for the number of conflicts and the free space available around aircraft in conflict.Furthermore, it simplifies the complexity computation process.First, the metric is tuned for a given type of aircraft and conflict resolution method, using high-fidelity simulation data as baseline.Then the impedance for new scenarios can be computed assuming the aircraft as point masses, without having to simulate the vehicle dynamics or actual conflict resolution maneuvers for each of the scenarios.A high-fidelity fast-time simulator, Fe 3 [21], was used to simulate over a thousand randomly generated scenarios and measure the baseline for complexity.The impedance metric was then evaluated separately for the same scenarios and compared against the baseline data and the metric from previous study.The results showed that the correlation between the proposed impedance metric is better than the previous metric.It also produces impedance maps showing regions of high complexity which provides better spatial information for managing air traffic.The rest of the paper is organized in the following way.The test scenario description, and the metric and its evaluation in detail are presented in Section II.Detailed results and discussion are presented in Section III.Summary of the paper, as well as identification of directions for further research is presented in Section IV.
II. MethodologyIn this paper, the focus is on estimating the complexity of operations in a two-dimensional horizontal portion of airspace that has no constraints such as controlled airspace, temporary flight restrictions, geo-fences or terrain.In the next two sections, the test scenarios and the evaluation of the impedance metric are described in detail.
A. Test ScenariosThe test scenario generation remains the same as used in [20].To evaluate the complexity metrics, random scenarios with a large variety of complexities were generated.Then the metric referred to as "number of resolution maneuvers" was evaluated in the Fe 3 [21] simulator.The high-fidelity simulator uses dynamic models of aircraft and a pairwise conflict resolution method that employs a combination of speed and direction changes to simulate the trajectories and encounters of aircraft typical to a real scenario.The aircraft are therefore actually diverting during close encounters instead of a prescribed course change.Using the simulation-generated measurements as the baseline for the complexity of the scenario, the proposed complexity metric, Impedance (I), was then analyzed and compared using statistical methods.Note, the number of conflict resolution maneuvers measures the resolution moves issued during the simulation.Since the time step size in Fe 3 is 0.5 seconds, the number of conflict resolution maneuvers also reflects the resolution duration.For the generated scenarios, several criteria were used to ensure high traffic intensity and comparability in scenarios.First, a 1.3x1.3nautical mile region was defined (shown as the red box in Fig. 1), and all flights were required to go through the predefined region with origin and destination outside of the region.Second, at most one turning point was allowed other than the origin and destination in a flight plan.Third, all flights were set to depart within a five-minute window.Lastly, this study focused on low-altitude small UAS traffic.Hence, the target ground speeds of all flights were set in the range of 5 meters per second to 20 meters per second.Fig. 1 shows a sample scenario with 30 vehicles, where the circle, cross, and diamond markers represent origins, destinations, and mid-points, respectively.In [20], the number of aircraft in these scenarios was varied from 5 to 50 (or in density from 3 to 30 vehicles/nmi 2 ).Fig. 2 shows the percentage of scenarios with and without conflicts during the process of generating scenarios.When the traffic density increases, the likelihood of having conflicts increases and reaches 100 % at approximately 15 Fig. 1 A Sample Scenario with 30 flights vehicles/nmi 2 .Additionally, scenarios with aircraft densities from 50 to 100 were also generated in increments of 2. Consequently, a total of 1045 scenarios were created and used.From 5 to 50, 20 scenarios were generated at each level of density and from 52 to 100, 5 scenarios were generated at every alternate level of density.Scenarios without conflicts are defined as having zero scenario complexity based on the proposed metric.Therefore, only the scenarios with potential conflicts are used in experiments.
Fig. 2 Likelihood of Conflicts at Different Density Levels
B. The Impedance Metric and Its EvaluationTo evaluate the complexity of a scenario, first a notion of conflict is defined.Two aircraft are assumed to be in conflict at a given time if they are within a distance h sep = k.D wc of each other, where D wc is the well-clear distance (arbitrarily chosen at 50 feet or 15.24 meters) and k is a rational number (≥ 1) multiplication factor.h sep is referred to as Conflict Distance in this paper.This approach is used to calibrate the Impedance evaluation to the region of influence of the conflict resolution method that would have been used in an actual traffic simulation.For a given scenario, the Impedance metric is computed as follows:Let R be the pre-defined region of interest in two-dimensional Euclidean space, i.e.R ∈ R 2 .Grid the region into square cells C xy with a side length l, where x is the row number and y is the column number.Each cell has n adjacent cells C axy , where n ∈ [3,5,8] depending on the location of the cell (corner, edge, interior) in the grid.The letter a is used to denote adjacent.At each instant of time t i in the entire duration of the scenario, compute the aircraft occupancy graph/map O t i =[O xy,t i ], where O xy,t i is the number of aircraft in a cell at that time.Also, at each t i , compute the aircraft conflict graph/map C t i ,c =[C xy,t i ,c ], the set of all cells that have at least one conflict in them.For each C xy,t i ,c , let m of the adjacent cells C axy,t i ,c have at least one aircraft in them over the next dt seconds.This can be obtained for each adjacent cell by summing its occupancy, O xy,t j for t j ∈ [t i + 1,t i + dt].The Impedance of a Cell in space (location xy) at time t i , I xy,t i = m/n.Thus at each time instant t i , there is a colored grid/map produced, called the Impedance MapI t i =[I xy,t i ],where the color of a cell indicates its impedance I xy,t i ∈ [0, 1].Now, to get a single snapshot of the region, the time slices need to be collapsed over the entire period of the scenario.This produces the Impedance graph/map of the Scenario I xy .An example is shown in Fig. 3.This can be done by either taking the time mean or a percentile value of each cell's impedance.To understand the severity of impedance in each cell over the entire scenario, in this study, the p th percentile value of I xy,t is used to collapse the graphs in time.Finally, to get a single impedance number for the whole scenario, both the space and time dimensions need to be collapsed.To do this, compute the percentage of cells in the time collapsed map with I xy ≥ P , where P is the chosen impedance threshold.This gives the Impedance, I for the entire scenario.For example, suppose choosing the 99 th percentile value for time collapse and an impedance threshold, P = 20%, results in an impedance value of 0.3 for a scenario.This can be interpreted as -30% of the region has conflicts that are impeded by nearby aircraft in one-fifth (20%) of the vicinity, 1% of the time.In other words, conflicts in almost one-third of the region are impeded in the scenario.The metric computation uses two parameters: the conflict distance parameter k and the time window parameter dt.A set of traffic scenario complexities evaluated in a high-fidelity simulator like Fe 3 , with a given conflict resolution model, is used to tune the impedance metric parameters to achieve the maximum correlation.Then, the tuned parameters can be used to evaluate the complexity for any new scenario (comprising the same type of aircraft and the same conflict resolution model) without the need for high-fidelity simulations.The metric captures the effect of aircraft dynamics and resolution models in its parameters.For example, an aircraft with low maneuverability will need more space and the conflict resolution method will have a high conflict distance when evaluating the baseline data in Fe 3 .That in turn means the Impedance metric tuned for that type of aircraft and conflict resolution method will have a different value of k and dt where it is most correlated with the baseline data.In other words, the tuning of the Impedance metric parameters is tied to the type of aircraft and conflict resolution method that will be used in the real scenarios.
C. AssumptionsIn addition to the scenario assumptions stated earlier, the chosen values of different parameters are defined as follows:-The cell edge length l = 100m (0.054nmi).-For each scenario, impedance is computed by varying the k value between 1 and 5, to ensure that the conflict distance is less than the cell edge length.-The time window dt is varied between 3 seconds and 17 seconds with 2-second increments.Since each aircraft flies at a speed between 5 to 20 meters per second, an aircraft will leave a cell anytime between the next time step to 20 seconds at most.Hence, time window values are chosen between those numbers, ignoring the smallest and largest values.On average it will take about 5 seconds to reach an adjacent cell.-The percentile number p = 99.9.This is done to capture the worst impedances observed at every cell over the entire duration of the scenario.-The impedance threshold P is varied from 10% to 80%.In other words, if 10% impedance is considered bad, having a third aircraft in the vicinity is considered bad and every moderate to bad cell will contribute to the scenario complexity.This is typically what might be considered bad in a realistic scenario today.On the other hand, if only 80% or more impedance is considered bad, only the worst of the bad cells will contribute.This could be the case for a highly futuristic scenario where multi-aircraft conflicts are operationally acceptable.-Since this study focuses on scenario intrinsic complexity, uncertainties on wind, communication, navigation, and surveillance were not included in the simulations.After the impedance metric for each scenario is evaluated, the Pearson method is used to compute the correlation between the impedance measures and the number of resolution maneuvers (baseline) for each scenario.This varies as a function of the chosen k, P and dt values and is discussed under results.Furthermore, since the Pearson method is designed for checking linear correlations, a maximal correlation method [22] is also used to capture any non-linear association, and the Alternative Conditional Expections (ACE) method implemented in Matlab is used to compute such maximal correlations.
III. ResultsImpedance maps were generated for each scenario at different conflict distances and time windows.For any given time window, two common trends were observed.For a fixed conflict distance, h sep , as the traffic density was increased, the spread and value of the impedance increased (the cells became yellower/brighter) (Fig. 4).For a fixed traffic density, as the conflict distance was increased, again the spread and value of impedance increased (Fig. 5).However, the effect was less pronounced.This indicates that the metric is more sensitive to the traffic density than the conflict distance.For computing the final impedance number for each scenario, the cell impedance threshold was varied from 10% to 80%.This was repeated at different conflict distances.For each time window, to determine the best combination of conflict distance and cell impedance threshold, correlations were computed between the impedance numbers and the baseline data.In general, as the conflict distance was increased, the peak correlation was observed at higher impedance thresholds.It was found that a conflict distance, h sep of 75 feet and a threshold, P of 10% had the best correlation coefficient when compared with the number of resolution maneuvers from the actual simulation, irrespective of the time window.As the time window was increased, the correlation improved up to a time window of 9 seconds, and then deteriorated.The best Pearson correlation observed was 0.9207 for the 9-second time window (Fig. 6).The correlation obtained for the same using the ACE method was 0.9325.The corresponding best correlation coefficients for the weighted conflict complexity metric from our earlier work were 0.9 and 0.913, respectively [20].The impedance metric therefore performed better.
A. DiscussionThe impedance metric serves two purposes.First, the space and time collapsed impedance of a scenario provides a single complexity number in the usual sense of measuring airspace complexity.It captures the impact of both number of conflicts, and the relative spatial distribution of aircraft in conflict with respect to other aircraft in vicinity, which could impede the performance of the conflict resolution strategy.Second purpose is the impedance map, which provides visual information to identify the hot spots: regions with limited conflict resolution capability in the scenario.This is useful in not only flagging a scenario as too complex but also pin-pointing where the problem is.Consequently, more informed air traffic management decisions can be taken.Suppose an arbiter runs a scenario and the impedance is above a threshold, then the maps show her where the hot spots are, and she could either deny the whole scenario, or just the flights which go through that area, or provide a reroute to flights going through hot spots, and so on.
IV. ConclusionsIn this paper, an impedance-based metric was introduced to represent the complexity of a given unmanned aircraft system traffic scenario.There were 1045 scenarios analyzed, and their impedance metric was computed and compared against the baseline data produced from high-fidelity simulation.The metric was evaluated for varying conflict distances and traffic scenarios.It was found that the proposed metric had a high correlation of 0.92 (Pearson) and 0.9325(ACE) Additionally, the metric provides a way to account for both the number of aircraft and the traffic flow pattern.The impedance maps produced as part of the impedance computation process identified areas of concern in a given scenario.Such information may be helpful for developing traffic management strategies such as adjusting and re-planning only flights that pass through the most impeded areas.The air traffic services in a UAM environment may be provided by one or more operators.Each operator needs real-time tools to assess the safety and efficiency of operations and make adjustments to changing traffic demands.The impedance metric provides a tool to identify hot spots, regions with limited conflict resolution capability, in the airspace operations.It can therefore also be used to assess if and how the hot spots vary with uncertainties like sudden changes in demand, wind speed variations and low visibility.Similarly, it could be used to reallocate demand to maintain safety.The results presented in this paper investigated the top 0.1% impedances in each cell for a scenario.In other words, the metric is only studying the worst 1 minute for every 1000 minutes in an area.Other levels of impedance can be explored further and tested against the baseline.Also, for this analysis, a fixed grid cell edge length was assumed.Grids with varying edge lengths could also be explored.Finally, this work extends our earlier work that introduced a weighted conflict-based scenario complexity metric.The impedance metric performed marginally better than the weighted conflict metric.This is part of an extended effort to develop complexity metrics that can be computed in real time without the need for scenario simulation.This therefore can be used for jointly classifying a scenario as acceptable, unacceptable or acceptable with changes made to flight plans that pass through high complexity regions and then applying necessary air traffic management strategies.Fig. 33Fig. 3 The Impedance Map of the Sample Scenario with 30 flights at conflict distance, h sep = 60.96m, for a time window, dt = 5 sec
Fig. 44Fig. 4 Impedance maps with varying traffic density and fixed conflict distance, h sep = 45.72m for a time window, dt = 9 sec
Fig. 55Fig. 5 Impedance maps with varying conflict distance, h sep and fixed traffic density for a time window, dt = 9 sec
Fig. 66Fig. 6 Correlation between Impedance and Number of Resolution Maneuvers (baseline) as a function of conflict distance and impedance threshold at dt = 9 sec


		
		
			

				


	
		A ground-delay-based approach to reduce impedance-based airspace complexity
		
			VishwanathBulusu
		
		
			RSengupta
		
		
			ZLiu
		
		10.2514/6.2021-2340
	
	
		AIAA AVIATION 2021 FORUM
		
			American Institute of Aeronautics and Astronautics
			2016
		
	
	Bulusu, V., Sengupta, R., and Liu, Z., "Unmanned Aviation: To Be Free or Not To Be Free? A Complexity Based Approach," 7th International Conference on Research in Air Transportation, 2016.



	
		A threshold based airspace capacity estimation method for UAS traffic management
		
			VishwanathBulusu
		
		
			ValentinPolishchuk
		
		10.1109/syscon.2017.7934758
	
	
		2017 Annual IEEE International Systems Conference (SysCon)
		
			IEEE
			2017
			
		
	
	Bulusu, V., and Polishchuk, V., "A threshold based airspace capacity estimation method for UAS traffic management," 2017 Annual IEEE International Systems Conference (SysCon), IEEE, 2017, pp. 1-7.



	
		Capacity Estimation for Low Altitude Airspace
		
			VishwanathBulusu
		
		
			ValentinPolishchuk
		
		
			RajaSengupta
		
		
			LeonidSedov
		
		10.2514/6.2017-4266
	
	
		17th AIAA Aviation Technology, Integration, and Operations Conference
		
			American Institute of Aeronautics and Astronautics
			2017
			4266
		
	
	Bulusu, V., Polishchuk, V., Sengupta, R., and Sedov, L., "Capacity estimation for low altitude airspace," 17th AIAA Aviation Technology, Integration, and Operations Conference, 2017, p. 4266.



	
		Estimation of European Airspace Capacity from a Model of Controller Workload
		
			ArnabMajumdar
		
		
			WashingtonOchieng
		
		
			JohnPolak
		
		10.1017/s037346330200190x
	
	
		Journal of Navigation
		J. Navigation
		0373-4633
		1469-7785
		
			55
			3
			
			2002
			Cambridge University Press (CUP)
		
	
	Majumdar, A., Ochieng, W., and Polak, J., "Estimation of European airspace capacity from a model of controller workload," Journal of Navigation, Vol. 55, No. 03, 2002, pp. 381-403.



	
		En-route sector capacity estimation methodologies: An international survey
		
			ArnabMajumdar
		
		
			WashingtonYottoOchieng
		
		
			JamesBentham
		
		
			MartynRichards
		
		10.1016/j.jairtraman.2005.05.002
	
	
		Journal of Air Transport Management
		Journal of Air Transport Management
		0969-6997
		
			11
			6
			
			2005
			Elsevier BV
		
	
	Majumdar, A., Ochieng, W. Y., Bentham, J., and Richards, M., "En-route sector capacity estimation methodologies: An international survey," Journal of Air Transport Management, Vol. 11, No. 6, 2005, pp. 375-387.



	
		Airspace capacity estimation using flows and Weather-Impacted Traffic Index
		
			AlexanderKlein
		
		
			LaraCook
		
		
			BryanWood
		
		
			DavidSimenauer
		
		10.1109/icnsurv.2008.4559188
	
	
		2008 Integrated Communications, Navigation and Surveillance Conference
		
			IEEE
			2008
			
		
	
	Klein, A., Cook, L., Wood, B., and Simenauer, D., "Airspace capacity estimation using flows and weather-impacted traffic index," 2008 Integrated Communications, Navigation and Surveillance Conference, IEEE, 2008, pp. 1-12.



	
		Capacity Estimation for Airspaces with Convective Weather Constraints
		
			JimmyKrozel
		
		
			JosephMitchell
		
		
			ValentinPolishchuk
		
		
			JosephPrete
		
		10.2514/6.2007-6451
	
	
		AIAA Guidance, Navigation and Control Conference and Exhibit
		
			American Institute of Aeronautics and Astronautics
			2007
		
	
	Krozel, J., Mitchell, J., Polishchuk, V., and Prete, J., "Airspace capacity estimation with convective weather constraints," AIAA Guidance, Navigation, and Control Conference, 2007.



	
		Applications of a Macroscopic Model for En Route Sector Capacity
		
			JerryWelch
		
		
			JohnAndrews
		
		
			BrianMartin
		
		
			EricShank
		
		10.2514/6.2008-7221
	
	
		AIAA Guidance, Navigation and Control Conference and Exhibit
		Barcelona, Spain
		
			American Institute of Aeronautics and Astronautics
			2007
			138
		
	
	Welch, J. D., Andrews, J. W., Martin, B. D., and Sridhar, B., "Macroscopic workload model for estimating en route sector capacity," Proc. of 7th USA/Europe ATM Research and Development Seminar, Barcelona, Spain, 2007, p. 138.



	
		AIR TRAFFIC MANAGEMENT
		
			IVLaudeman
		
		
			SShelden
		
		
			RBranstrom
		
		
			CBrasil
		
		10.1201/9781482267952-27
	
	
		Contemporary Ergonomics 1998
		
			CRC Press
			1998
			
		
	
	Laudeman, I. V., Shelden, S., Branstrom, R., and Brasil, C., "Dynamic density: An air traffic management metric," 1998.



	
		Airspace complexity and its application in air traffic management
		
			BSridhar
		
		
			KSSheth
		
		
			SGrabbe
		
	
	
		Europe Air Traffic Management R&D Seminar
		
			
			1998
		
	
	2nd USA/
	Sridhar, B., Sheth, K. S., and Grabbe, S., "Airspace complexity and its application in air traffic management," 2nd USA/Europe Air Traffic Management R&D Seminar, 1998, pp. 1-6.



	
		The Complexity Construct in Air Traffic Control: A Review and Synthesis of the Literature
		
			RHMogford
		
		
			JGuttman
		
		
			SMorrow
		
		
			PKopardekar
		
		
			1995
		
	
	Tech. rep., DTIC Document
	Mogford, R. H., Guttman, J., Morrow, S., and Kopardekar, P., "The Complexity Construct in Air Traffic Control: A Review and Synthesis of the Literature." Tech. rep., DTIC Document, 1995.



	
		Practice for Application of Federal Aviation Administration (FAA) Federal Aviation Regulations Part 21 Requirements to Unmanned Aircraft Systems (UAS)
		
			PKopardekar
		
		10.1520/f2505-07
	
	
		Federal Aviation Administration
		
			ASTM International
			2000
		
	
	Dynamic density: A review of proposed variables
	Kopardekar, P., "Dynamic density: A review of proposed variables," FAA internal document. overall conclusions and recommendations, Federal Aviation Administration, 2000.



	
		Airspace complexity measurement: An air traffic control simulation analysis
		
			PHKopardekar
		
		
			ASchwartz
		
		
			SMagyarits
		
		
			JRhodes
		
	
	
		International Journal of Industrial Engineering: Theory, Applications and Practice
		
			16
			1
			
			2009
		
	
	Kopardekar, P. H., Schwartz, A., Magyarits, S., and Rhodes, J., "Airspace complexity measurement: An air traffic control simulation analysis," International Journal of Industrial Engineering: Theory, Applications and Practice, Vol. 16, No. 1, 2009, pp. 61-70.



	
		Air traffic predictability framework – Development, performance evaluation and application
		
			GonzaloTobaruela
		
		
			PeterFransen
		
		
			WolfgangSchuster
		
		
			WashingtonYOchieng
		
		
			ArnabMajumdar
		
		10.1016/j.jairtraman.2014.04.001
	
	
		Journal of Air Transport Management
		Journal of Air Transport Management
		0969-6997
		
			39
			
			2012
			Elsevier BV
		
	
	Tobaruela, G., Majumdar, A., and Ochieng, W. Y., "Identifying Airspace Capacity Factors in the Air Traffic Management System," Proceedings of the 2nd International Conference on Application and Theory of Automation in Command and Control Systems, 2012, pp. 219-224.



	
		Airspace Congestion Metrics
		
			DanielDelahaye
		
		
			StéphanePuechmorel
		
		10.1002/9781118743805.ch7
	
	
		Modeling and Optimization of Air Traffic
		Napoli, Italy
		
			John Wiley & Sons, Inc.
			2000
			
		
	
	3rd USA/
	Delahaye, D., and Puechmorel, S., "Airspace Complexity: Towards Intrinsic Metrics," 3rd USA/Europe Air Traffic Management R&D Seminar, Napoli, Italy, 2000.



	
		Air Traffic Complexity Map based on Non Linear Dynamical Systems
		
			DanielDelahaye
		
		
			StephanePuechmorel
		
		
			JohnHansman
		
		
			JonathanHiston
		
		10.2514/atcq.12.4.367
	
	
		Air Traffic Control Quarterly
		Air Traffic Control Quarterly
		1064-3818
		2472-5757
		
			12
			4
			
			2004
			American Institute of Aeronautics and Astronautics (AIAA)
		
	
	Delahaye, D., Puechmorel, S., Hansman, J., and Histon, J., "Air Traffic Complexity based on Non Linear Dynamical Systems," Air Traffic Control Quarterly, Vol. 12, No. 4, 2004, pp. 367-388.



	
		Describing Air Traffic Complexity Using Mathematical Programming
		
			MariyaIshutkina
		
		
			EricFeron
		
		
			KarlBilimoria
		
		10.2514/6.2005-7453
	
	
		AIAA 5th ATIO and16th Lighter-Than-Air Sys Tech. and Balloon Systems Conferences
		
			American Institute of Aeronautics and Astronautics
			2005
		
	
	Ishutkina, M. A., and Feron, E., "Describing Air Traffic Complexity Using Mathematical Programming," AIAA 5th Aviation, Technology, Integration, and Operations Conference (ATIO), 2005.



	
		Cooperative and non-cooperative UAS traffic volumes
		
			VishwanathBulusu
		
		
			RajaSengupta
		
		
			ValentinPolishchuk
		
		
			LeonidSedov
		
		10.1109/icuas.2017.7991506
	
	
		2017 International Conference on Unmanned Aircraft Systems (ICUAS)
		
			IEEE
			2017
		
	
	Bulusu, V., Sengupta, R., Sedov, L., and Polishchuk, V., "Cooperative and Non-Cooperative UAS Traffic Volumes," International Conference on Unmanned Aircraft Systems ICUAS, 2017.



	
		A Throughput Based Capacity Metric for Low-Altitude Airspace
		
			VishwanathBulusu
		
		
			RajaSengupta
		
		
			EricRMueller
		
		
			MinXue
		
		10.2514/6.2018-3032
	
	
		2018 Aviation Technology, Integration, and Operations Conference
		Atlanta, GA
		
			American Institute of Aeronautics and Astronautics
			2018
		
	
	Bulusu, V., Sengupta, R., Mueller, E. R., and Xue, M., "A Throughput-Based Capacity Metric for Low-altitude Airspace," AIAA Aviation Forum, Atlanta, GA., 2018.



	
		Scenario Complexity for Unmanned Aircraft System Traffic
		
			MinXue
		
		
			MinhDo
		
		10.2514/6.2019-3513
	
	
		AIAA Aviation 2019 Forum
		
			American Institute of Aeronautics and Astronautics
			2019
			3513
		
	
	Xue, M., and Do, M., "Scenario Complexity for Unmanned Aircraft System Traffic," AIAA Aviation 2019 Forum, 2019, p. 3513.



	
		Fe<sup>3</sup>: An Evaluation Tool for Low-Altitude Air Traffic Operations
		
			MinXue
		
		
			JosephRios
		
		
			JosephSilva
		
		
			ZhifanZhu
		
		
			AbrahamKIshihara
		
		10.2514/6.2018-3848
	
	
		2018 Aviation Technology, Integration, and Operations Conference
		Atlanta, GA
		
			American Institute of Aeronautics and Astronautics
			2018
		
	
	Xue, M., Rios, J., Silva, J., Ishihara, A., and Zhu, Z., "Fe3: An Evaluation Tool for Low-Altitude Air Traffic Operations," AIAA Aviation Forum, Atlanta, GA., 2018.



	
		Estimating Optimal Transformations for Multiple Regression and Correlation
		
			LeoBreiman
		
		
			JeromeHFriedman
		
		10.1080/01621459.1985.10478157
	
	
		Journal of the American Statistical Association
		Journal of the American Statistical Association
		0162-1459
		1537-274X
		
			80
			391
			
			1985
			Informa UK Limited
		
	
	Breiman, L., and Friedman, J. H., "Estimating optimal transformations for multiple regression and correlation," Journal of the American statistical Association, Vol. 80, No. 391, 1985, pp. 580-598.