Aircraft Trajectory Planning for Climate Hotspot Avoidance Considering Air Traffic Complexity: A Constrained Multi-Agent Reinforcement Learning Approach
Planning aircraft trajectories to avoid climate-sensitive areas poses operational challenges, including increased traffic complexity and potential safety risks. This study presents a framework designed to plan operationally feasible climate-friendly routes from the perspective of the air traffic management (ATM) system. The problem is formulated as a constrained Markov game, where air traffic complexity, a key indicator of air traffic manageability, serves as the objective function, and climate hotspot avoidance is imposed as a constraint. The proposed method employs the multi-agent proximal policy optimization algorithm and adapts it to handle constraints related to climate hotspot avoidance using the Lagrangian technique. To ensure scalability, parameter sharing is employed, allowing the algorithm to deal with varying numbers of concurrently operating aircraft in different scenarios. Experimental results demonstrate that the proposed algorithm effectively balances environmental goals with traffic manageability, offering operationally feasible climate-optimal trajectories.
SIDs_2024_paper_084 final.pdf
Main Document
http://purl.org/coar/version/c_970fb48d4fbd8a85
openaccess
N/A
13.2 MB
Adobe PDF
bfca6421ad0733947b5c20ed461826f2