Affiliation:
1. Kent State University, Kent, Ohio 44242
Abstract
Near-future air taxi operations with electric vertical takeoff and landing aircraft will be constrained by the need for frequent recharging and limited takeoff and landing pads in vertiports and will be subject to time-varying demand and electricity prices, making the dispatch problem unique and particularly challenging to solve. Previously, the authors have developed optimization models to address this problem. Such optimization models, however, suffer from prohibitively high computational run times when the scale of the problem increases, making them less practical for real-world implementation. To overcome this issue, the authors have developed two deep reinforcement learning-based dispatch algorithms, namely, single-agent and multi-agent double dueling deep Q-network dispatch algorithms, where the objective is to maximize operating profit. A passenger transportation simulation environment was built to assess the performance of these algorithms across 36 numerical cases with varying numbers of vehicles and vertiports and amounts of demand. The results indicate that the multi-agent dispatch algorithm can closely approximate the optimal dispatch policy with significantly less computational expenses compared to the benchmark optimization model. The multi-agent algorithm was found to outperform the single-agent counterpart with respect to both profits generated and training time. Additionally, we implemented a heuristic-based algorithm, faster but less effective in generating profits compared to our two deep reinforcement learning-based algorithms.
Publisher
American Institute of Aeronautics and Astronautics (AIAA)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献