An Optimal Strategy for a Conflict Resolution Problem

Author(s):  
V. Anantharam ◽  
P. Varaiya
1986 ◽  
Vol 7 (4) ◽  
pp. 329-332 ◽  
Author(s):  
V. Anantharam ◽  
P. Varaiya

2016 ◽  
Vol 64 (4) ◽  
pp. 838-848 ◽  
Author(s):  
Giovanni Giallombardo ◽  
Houyuan Jiang ◽  
Giovanna Miglionico

2019 ◽  
Vol 92 (2) ◽  
pp. 156-162
Author(s):  
Yun-Xiang Han ◽  
Jian-Wei Zhang ◽  
Xiao-Qiong Huang

Purpose A number of automated tools will be required for the purpose of enabling efficient services in air traffic control. The purpose of this paper is to devise an optimal flight trajectory search method that optimizes airspace system efficiency for 3D space in the presence of uncertainties. Design/methodology/approach This paper put forward an optimization model for generating applicable solutions of multi-aircraft conflict resolution problem, and the solution is based on the principle of optimality. Findings The conflict resolution problem between multiple aircraft can be described by spatial discretization, and the approach taken digitizes the 3D space into a grid of nodes. Practical implications The simulation examples are given to illustrate the validity of trajectory search model and stress on the impact of different system parameters. Originality/value Realistic constraints that are convenient to operate are incorporated in the system model, and the results show that it can provide reliable decision-making for conflict avoidance.


2013 ◽  
Vol 333-335 ◽  
pp. 1251-1255
Author(s):  
En Yu Liu ◽  
Xiang Min Guan ◽  
Xue Jun Zhang ◽  
Jie Zeng

Conflict resolution problem (CRP) plays a crucial role in the guarantee of safety. This paper formulates CRP as a multi-agent path planning problem which aims to find optimal paths for aircrafts. An algorithm named CCDG is proposed to tackle it based on cooperative coevolutionary (CC) with a dynamic grouping strategy for aircraft. CCDG makes aircraft divided into several equal sub-groups according to the dynamic grouping strategy. Each sub-group can adopt an evolutionary algorithm (EA) to optimize the aircrafts paths fully distributed and in parallel. Optimal solution is obtained through cooperation and coordination with all sub-populations. Empirical studies using extremely scenario adopted by previous research show that CCDG outperformed the existing approach (the fast GA), and the popular path planner that each aircraft uses an EA. Moreover, CCDG succeed to improve the airspace safety and reduce cost for CR.


2014 ◽  
Vol 48 (3) ◽  
pp. 334-350 ◽  
Author(s):  
Zhe Liang ◽  
Wanpracha Art Chaovalitwongse ◽  
Elsayed A. Elsayed

Algorithms ◽  
2019 ◽  
Vol 12 (2) ◽  
pp. 47
Author(s):  
Hao-xiang Chen ◽  
Ying Nan ◽  
Yi Yang

A real-time conflict resolution algorithm based on model predictive control (MPC) is introduced to address the flight conflict resolution problem in multi-UAV scenarios. Using a low-level controller, the UAV dynamic equations are abstracted into simpler unicycle kinematic equations. The neighboring UAVs exchange their predicted trajectories at each sample time to predict the conflicts. Then, under the predesignated resolution rule and strategy, decentralized coordination and cooperation are performed to resolve the predicted conflicts. The controller structure of the distributed nonlinear model predictive control (DNMPC) is designed to predict potential conflicts and calculate control variables for each UAV. Numerical simulations of multi-UAV coordination are performed to verify the performance of the proposed algorithm. Results demonstrate that the proposed algorithm can resolve the conflicts sufficiently in real time, while causing no further conflicts.


2017 ◽  
Vol 58 ◽  
pp. 151-158 ◽  
Author(s):  
Antonio Alonso-Ayuso ◽  
Laureano F. Escudero ◽  
F. Javier Martín-Campo ◽  
Nenad Mladenović

Sign in / Sign up

Export Citation Format

Share Document