• Corpus ID: 15159502

A new framework for solving en-routes conflicts

@inproceedings{Allignol2013ANF,
  title={A new framework for solving en-routes conflicts},
  author={Cyril Allignol and Nicolas Barnier and Nicolas Durand and Jean-Marc Alliot},
  year={2013},
  url={https://api.semanticscholar.org/CorpusID:15159502}
}
A new framework is introduced that separates the model from the solver so as to be able to enhance the model with as many refinements as necessary to comply with operational constraints and compare different resolution methods on the same data, which is one of the crucial aspects of scientific research.
enac.hal.science
30 Citations
Highly Influential Citations
2
Background Citations
10
Methods Citations
14

Figures and Tables from this paper

30 Citations

Cooperation of combinatorial solvers for en-route conflict resolution

Dual-Horizon Reciprocal Collision Avoidance for Aircraft and Unmanned Aerial Systems

The Dual-Horizon ORCA (DH-ORCA) algorithm is introduced, where two time horizons are used respectively for short-term collision avoidance and medium-term path-crossing, and it is shown that this new approach mitigates the main issues of ORCA and CS-ORca and yields better performances with dense traffic scenarios.

Review of Conflict Resolution Methods for Manned and Unmanned Aviation

A taxonomy that categorises algorithms in terms of their approach to avoidance planning, surveillance, control, trajectory propagation, predictability assumption, resolution manoeuvre, multi-actor conflict resolution, considered obstacle types, optimization, and method category is presented.

Homotopy Route Generation Model for Robust Trajectory Planning

Although advance future avionics will enable full compliance with the given trajectory, there are many uncertainty sources that can deflect aircraft from their intended positions. In this article, we…

ELSA Air Traffic Simulator: an Empirically grounded Agent Based Model for the SESAR scenario

It is found that the implementation of free-routing could have a positive impact on the safety event occurrences that will be reduced in number although spread over a larger area, and that quadratic scaling law is modified when the airspace is partitioned in air traffic sectors with capacity constraints.

Does ATM Need Centralized Coordination? Autonomous Conflict Resolution Analysis in a Constrained Speed Environment

This paper compares this autonomous algorithm derived from robotics with a centralized approach using evolutionary computation on a complex example to point out their relative performance in a speed constrained environment, and provides scientific arguments for the necessity of centralized air traffic control.

Dynamic collision avoidance using local cooperative airplanes decisions

This work proposes an autonomous and generic multi-agent system to address the collision avoidance management problem using a decentralized distributed approach and validates the system using state-of-the-art benchmarks.

Constant speed optimal reciprocal collision avoidance

An empirically grounded agent based simulator for the air traffic management in the SESAR scenario

Applications to Air Traffic Management

This chapter discusses applications of metaheuristics to problems of air traffic management, and describes an ATM system in a few words, so that readers who are not familiar with such systems can understand the problems being addressed.

25 References

A traffic complexity approach through cluster analysis

A theoretical study of the possible structures of clusters is presented and a simulation using French real traffic data compares the structure of clusters with direct and standard routes.

OPTIMAL RESOLUTION OF EN ROUTE CONFLICTS.

A stochastic optimization algorithm based on genetic techniques is presented that can find many different nearly optimal solutions in real time, even in very complex situations involving many aircraft.

Conflict resolution problems for air traffic management systems solved with mixed integer programming

This paper proposes two different formulations of the multiaircraft conflict avoidance problem as a mixed-integer linear program: in the first case only velocity changes are admissible maneuvers, in the second one only heading angle changes are allowed.

Trajectory deconfliction with constraint programming

This work proposes to estimate the cost of directly solving all conflicts in the upper airspace with ground holding, provided that aircraft were able to follow their trajectories accurately and presents a Constraint Programming model of this large-scale combinatorial optimization problem.

Collision Avoidance in the Air Traffic Management: A Mixed Integer Linear Optimization Approach

A mixed 0-1 linear optimization model based on geometric transformations for collision avoidance between an arbitrary number of aircrafts in the airspace is developed and can be used in real time by using optimization software.

Automatic aircraft conflict resolution using genetic algorithms

It is shown how genetic algorithms can be used to solve en-route aircraft conflict automatically to increase Air Traffic Control capacity in high density areas and the author describes the improvements used for solving the conflict resolution problem.

Aircraft Conflict Resolution by Genetic Algorithm and B-Spline Approximation

A new methodology is presented that relies on B-splines to model trajectories, models air-traffic conflict resolution as an optimization problem whose decision variables are the spline control points, and uses genetic algorithms to tackle this optimization problem in order to generate optimal conflict-free situations.

A mixed integer program for flight-level assignment and speed control for conflict resolution

An optimization model for generating speed trajectories that minimize the fuel expended to avoid conflicts is developed that can be solved in near real-time for large number of aircraft.

Minimization of Potential Air Conflicts through Speed Regulation

Efficiency of the method has been validated through simulations, including human-in-the-loop experiments, which opens the door to conflict resolution algorithms based on speed regulation, and a potential conflict detection and resolution framework is presented.

Constraint Solving for Combinatorial Search Problems: A Tutorial

This tutorial reviews some fundamental techniques from artificial intelligence, numerical analysis, and operations research to solve both discrete and continuous combinatorial problems.