A traffic complexity approach through cluster analysis

Slides:



Advertisements
Similar presentations
UNIVERSITY of GLASGOW A Comprehensive Approach to ATM Incorporating Autonomous Aircraft ATM Research Group University of Glasgow.
Advertisements

Page 1 CARE/ASAS Activity 3: ASM workshop Brétigny, 19 December 2001 Autonomous Aircraft OSED CARE-ASAS Activity 3: ASM Autonomous Aircraft OSED.
Complex Networks Advanced Computer Networks: Part1.
Complex Networks for Representation and Characterization of Images For CS790g Project Bingdong Li 9/23/2009.
Social network partition Presenter: Xiaofei Cao Partick Berg.
Weighted graphs Example Consider the following graph, where nodes represent cities, and edges show if there is a direct flight between each pair of cities.
1 Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces Dmitri Krioukov CAIDA/UCSD Joint work with F. Papadopoulos, M.
School of Information University of Michigan Network resilience Lecture 20.
Probabilistic Path Planner by Someshwar Marepalli Pratik Desai Ashutosh Sahu Gaurav jain.
A Robust Interference Model for Wireless Ad-Hoc Networks Pascal von Rickenbach Stefan Schmid Roger Wattenhofer Aaron Zollinger.
HCS Clustering Algorithm
Common Properties of Real Networks. Erdős-Rényi Random Graphs.
Sublinear time algorithms Ronitt Rubinfeld Blavatnik School of Computer Science Tel Aviv University TexPoint fonts used in EMF. Read the TexPoint manual.
Ant Colony Optimization Optimisation Methods. Overview.
New Algorithm DOM for Graph Coloring by Domination Covering
Triple Patterning Aware Detailed Placement With Constrained Pattern Assignment Haitong Tian, Yuelin Du, Hongbo Zhang, Zigang Xiao, Martin D.F. Wong.
MODEL FOR FLIGHT LEVEL ASSIGNMENT PROBLEM ICRAT International Conference on Research in Air Transportation Alfred Bashllari National & Kapodistrian.
1 Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment Infocom /12/20.
Space Indexed Flight Guidance along Air Streams Mastura Ab Wahid, Hakim Bouadi, Felix Mora-Camino MAIA/ENAC, Toulouse SITRAER20141.
Chapter 9 – Graphs A graph G=(V,E) – vertices and edges
Boundary Recognition in Sensor Networks by Topology Methods Yue Wang, Jie Gao Dept. of Computer Science Stony Brook University Stony Brook, NY Joseph S.B.
Graph Algorithms. Definitions and Representation An undirected graph G is a pair (V,E), where V is a finite set of points called vertices and E is a finite.
Science: Graph theory and networks Dr Andy Evans.
Télécom 2A – Algo Complexity (1) Time Complexity and the divide and conquer strategy Or : how to measure algorithm run-time And : design efficient algorithms.
Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006 How Much Independent Should Individual Contacts.
IFly project: Airborne Self Separation as basis for advanced en route ATM Henk A.P. Blom iFly coordinator National Aerospace Laboratory NLR
Algorithm Design for Crossing and Passing Applications John Anderson and Colin Goodchild University of Glasgow, UK Thierry Miquel DSNA, Toulouse, France.
MINISTRY OF EDUCATION AND SCIENCE OF UKRAINE NATIONAL AVIATION UNINVERSITY INSTITUTE OF AIR NAVIGATION AIR NAVIGATION SYSTEMS DEPARTMENT MASTER’S DEGREE.
ETH Zurich – Distributed Computing Group Stephan HolzerSODA Stephan Holzer Silvio Frischknecht Roger Wattenhofer Networks Cannot Compute Their Diameter.
Community Detection based on Distance Dynamics Reporter: Yi Liu Student ID: Department of Computer Science and Engineering Shanghai Jiao Tong.
Singularity-Robust Task Priority Redundancy Resolution for Real-time Kinematic Control of Robot Manipulators Stefano Chiaverini.
William Stallings Data and Computer Communications
Visualization in Process Mining
The NP class. NP-completeness
COmbining Probable TRAjectories — COPTRA
Shortest Paths.
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Groups of vertices and Core-periphery structure
Discrete ABC Based on Similarity for GCP
CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12
Computability and Complexity
CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12
Traffic Flow Optimisation Rapporteur: Nicolas Durand, CENA
Empirical analysis of Chinese airport network as a complex weighted network Methodology Section Presented by Di Li.
Clustering Uncertain Taxi data
Finding Communities by Clustering a Graph into Overlapping Subgraphs
CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12
Exploiting Graphical Structure in Decision-Making
Complexity 6-1 The Class P Complexity Andrei Bulatov.
Finding Fastest Paths on A Road Network with Speed Patterns
Shortest Paths.
Complex World 2015 Workshop
Enhancing Attack Robustness of Scale-free Networks by Camouflage
Department of Computer Science University of York
Heuristic Algorithms via VBA
Outline This topic covers Prim’s algorithm:
Overcoming Resolution Limits in MDL Community Detection
Informed search algorithms
Binghui Wang, Le Zhang, Neil Zhenqiang Gong
Big Data Analytics: Exploring Graphs with Optimized SQL Queries
Heuristic Algorithms via VBA
Heuristic Algorithms via VBA
CSE 373 Data Structures and Algorithms
Shortest Paths.
Modeling Entropy in Onion Routing Networks
Topological Signatures For Fast Mobility Analysis
15th Scandinavian Workshop on Algorithm Theory
Approximation Algorithms
Modeling IDS using hybrid intelligent systems
Time Complexity and the divide and conquer strategy
Presentation transcript:

A traffic complexity approach through cluster analysis Géraud Granger - Nicolas Durand STERIA/Eurocontrol - CENA LOG (Laboratoire d ’Optimisation Globale) CENA/ENAC Toulouse granger,durand@recherche.enac.fr

Outlines Cluster definition Goals of cluster analysis Theoretical study Experimental results The influence of uncertainty on clusters The feedback effect Conclusion and future work How to order aircraft inside clusters ?

Cluster definition: transitive closing of conflicting aircraft

Goals of cluster analysis Conflict solvers generally fail in dense areas whatever the resolution strategy (global or sequential resolution) Even ASAS solvers are sensitive to neighbouring aircraft  A robust solver must be able to deal with large clusters.  Clusters must be limited in size.

What characterizes a cluster ? The number of aircraft involved The number of conflicts The geometry (aircraft attitude) The number of maneouvres necessary to solve it The cluster diameter A cluster can be represented by a connected graph: (the aircraft are the nodes and the conflicts are the edges)

A connected graph can be represented by a graphic sequence A graphic sequence (d1,d2,…,dn) is a sequence of numbers which can be the degrees of some graph.

3 aircraft clusters 3 aircraft / 2 conflicts 3 aircraft/ 3 conflicts

4 aircraft clusters 3 conflicts 4 conflicts 5 conflicts 6 conflicts

4 conflicts 5 aircraft clusters 10 conflicts

Experimental results A french loaded traffic day (21 may 1999) 5% / 15% of uncertainty on H / V speed 8 minutes time window detection detection is updated every 2 minutes CATS/OPAS simuator Standard and Direct routes

Standard routes (no resolution)

Direct routes (no resolution)

The cluster diameter The distance between two nodes of a graph is the minimum number of edges connecting these two nodes The diameter of a graph is the maximum distance among every nodes pair Example:

Experimental results

The influence of uncertainty on cluster sizes (with resolution)

The feedback effect

Conclusions The number of cluster types and their complexity grow exponentially with the number of aircraft  large clusters are too complex for human analysis Solving large clusters is difficult  the key point for future control systems is to limit the maximum cluster size Cluster sizes are very sensitive to speed uncertainties  An efficient and robust solver requires a good trajectory forecast. The phenomenon is increased by the feedback effect. Direct routes are better than standard routes as they limit cluster sizes and increase cluster diameters.

NEXT STEPS Take into account the aircraft attitude (climbing, levelled, descending) in the cluster analysis Complexity is increased: with 3 different attitudes (climbing, descending, levelled aircraft), for 3 aircraft, 16 cluster types instead of 2. Cluster complexity depends on the resolution method: most of the ASAS projects or Conflict solvers are based on sequential resolution  what is the best priority order to solve conflicts ? Extended Flight Rules ? Arbitrary order ? ….

What is the best priority order ? An open question ? Experiment on 1000 6-aircraft clusters (levelled aircraft, toy problems) Solved conflicts: Random order: 738 Most conflicting aircraft first: 787 Less conflicting aircraft first: 702 Earliest conflict first: 884 Earliest conflict last: 677 … No Free Lunch : Some of the unsolved conflicts with the earliest conflict first rule are solved with other rules.

What is the best priority order ? An open question ? Experimental results on real traffic best order: 1. earliest conflict first 2. already manoeuvred first 3. max number of conflicts first No Free Lunch: sometimes with other priority orders there are less remaining conflicts some unsolved conflicts could have been solved with other priority orders