Three-Dimensional Conflict Resolution Strategy Based on Network Cooperative Game
Aiming at the problems of difficult handling of three-dimensional flight conflicts and unfair distribution of resolution costs, we propose a multi-aircraft conflict resolution method based on the network cooperative game. Firstly, we establish a flight conflict network model with aircraft as nodes a...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-07-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-8994/14/8/1517 |
_version_ | 1797407790798471168 |
---|---|
author | Wenda Yang Xiangxi Wen Minggong Wu Kexin Bi Longfei Yue |
author_facet | Wenda Yang Xiangxi Wen Minggong Wu Kexin Bi Longfei Yue |
author_sort | Wenda Yang |
collection | DOAJ |
description | Aiming at the problems of difficult handling of three-dimensional flight conflicts and unfair distribution of resolution costs, we propose a multi-aircraft conflict resolution method based on the network cooperative game. Firstly, we establish a flight conflict network model with aircraft as nodes and the conflict relationship between node pairs as edges. After that, we propose a comprehensive network index that can evaluate the effect of resolution strategy. Based on the concept of “nucleolus solution”, we establish a conflict network alliance with all nodes as participants, and balance the interests of all participants through the resolution cost function. In order to improve the timeliness of the method, we propose two optimization methods: adjusting high-priority nodes and customizing the initial resolution scheme. Finally, we combine the NSGA-II algorithm to solve the optimal conflict resolution scheme. The simulation results show that our method can adjust 10 aircraft in 15.17 s and resolve 12 flight conflicts in a complex conflict scenario containing 40 aircraft; our method reduces the resolution cost by more than 22.1% on average compared with the method without considering the resolution cost. The method ensures both the conflict resolution capability and the reduction in resolution cost. |
first_indexed | 2024-03-09T03:47:46Z |
format | Article |
id | doaj.art-c1c9c97ecbd4483db612977f5a40d30d |
institution | Directory Open Access Journal |
issn | 2073-8994 |
language | English |
last_indexed | 2024-03-09T03:47:46Z |
publishDate | 2022-07-01 |
publisher | MDPI AG |
record_format | Article |
series | Symmetry |
spelling | doaj.art-c1c9c97ecbd4483db612977f5a40d30d2023-12-03T14:32:35ZengMDPI AGSymmetry2073-89942022-07-01148151710.3390/sym14081517Three-Dimensional Conflict Resolution Strategy Based on Network Cooperative GameWenda Yang0Xiangxi Wen1Minggong Wu2Kexin Bi3Longfei Yue4Air Traffic Control and Navigation School, Air Force Engineering University, Xi’an 710051, ChinaAir Traffic Control and Navigation School, Air Force Engineering University, Xi’an 710051, ChinaAir Traffic Control and Navigation School, Air Force Engineering University, Xi’an 710051, ChinaAir Traffic Control and Navigation School, Air Force Engineering University, Xi’an 710051, ChinaAir Traffic Control and Navigation School, Air Force Engineering University, Xi’an 710051, ChinaAiming at the problems of difficult handling of three-dimensional flight conflicts and unfair distribution of resolution costs, we propose a multi-aircraft conflict resolution method based on the network cooperative game. Firstly, we establish a flight conflict network model with aircraft as nodes and the conflict relationship between node pairs as edges. After that, we propose a comprehensive network index that can evaluate the effect of resolution strategy. Based on the concept of “nucleolus solution”, we establish a conflict network alliance with all nodes as participants, and balance the interests of all participants through the resolution cost function. In order to improve the timeliness of the method, we propose two optimization methods: adjusting high-priority nodes and customizing the initial resolution scheme. Finally, we combine the NSGA-II algorithm to solve the optimal conflict resolution scheme. The simulation results show that our method can adjust 10 aircraft in 15.17 s and resolve 12 flight conflicts in a complex conflict scenario containing 40 aircraft; our method reduces the resolution cost by more than 22.1% on average compared with the method without considering the resolution cost. The method ensures both the conflict resolution capability and the reduction in resolution cost.https://www.mdpi.com/2073-8994/14/8/1517flight conflict networkconflict resolutioncooperative gamespeed obstacle methodNSGA-II algorithm |
spellingShingle | Wenda Yang Xiangxi Wen Minggong Wu Kexin Bi Longfei Yue Three-Dimensional Conflict Resolution Strategy Based on Network Cooperative Game Symmetry flight conflict network conflict resolution cooperative game speed obstacle method NSGA-II algorithm |
title | Three-Dimensional Conflict Resolution Strategy Based on Network Cooperative Game |
title_full | Three-Dimensional Conflict Resolution Strategy Based on Network Cooperative Game |
title_fullStr | Three-Dimensional Conflict Resolution Strategy Based on Network Cooperative Game |
title_full_unstemmed | Three-Dimensional Conflict Resolution Strategy Based on Network Cooperative Game |
title_short | Three-Dimensional Conflict Resolution Strategy Based on Network Cooperative Game |
title_sort | three dimensional conflict resolution strategy based on network cooperative game |
topic | flight conflict network conflict resolution cooperative game speed obstacle method NSGA-II algorithm |
url | https://www.mdpi.com/2073-8994/14/8/1517 |
work_keys_str_mv | AT wendayang threedimensionalconflictresolutionstrategybasedonnetworkcooperativegame AT xiangxiwen threedimensionalconflictresolutionstrategybasedonnetworkcooperativegame AT minggongwu threedimensionalconflictresolutionstrategybasedonnetworkcooperativegame AT kexinbi threedimensionalconflictresolutionstrategybasedonnetworkcooperativegame AT longfeiyue threedimensionalconflictresolutionstrategybasedonnetworkcooperativegame |