2篇
您的检索式:作者名="Weiszer MICHAL"
|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | A large-scale multi-objective flights conflict avoidance approach supporting 4D trajectory operation显示文摘Recently, the long-term conflict avoidance approaches based on large-scale flights scheduling have attracted much attention due to their ability to provide solutions from a global point of view. However, current approaches which focus only on a single objective with the aim of minimizing the total delay and the number of conflicts, cannot provide controllers with variety of optional solutions, representing different tradeoffs. Furthermore, the flight track error is often overlooked in the current research. Therefore, in order to make the model more realistic, in this paper, we formulate the long-term conflict avoidance problem as a multi-objective optimization problem, which minimizes the total delay and reduces the number of conflicts simultaneously. As a complex air route network needs to accommodate thousands of flights, the problem is a large-scale combinatorial optimization problem with tightly coupled variables, which make the problem difficult to deal with. Hence,in order to further improve the search capability of the solution algorithm, a cooperative co-evolution(CC)algorithm is also introduced to divide the complex problem into several low dimensional sub-problems which are easier to solve. Moreover, a dynamic grouping strategy based on the conflict detection is proposed to improve the optimization efficiency and to avoid premature convergence. The well-known multi-objective evolutionary algorithm based on decomposition(MOEA/D) is then employed to tackle each sub-problem. Computational results using real traffic data from the Chinese air route network demonstrate that the proposed approach obtained better non-dominated solutions in a more effective manner than the existing approaches, including the multi-objective genetic algorithm(MOGA), NSGAII, and MOEA/D. The results also show that our approach provided satisfactory solutions for controllers from a practical point of view. | Xiangmin GUAN Xuejun ZHANG Renli LV Jun CHEN Weiszer MICHAL | 2017 | Science China(Information Sciences)2017,60,11: | 8 |
| 2 | Real-Time Four-Dimensional Trajectory Generation Based on Gain-Scheduling Control and a High-Fidelity Aircraft Model显示文摘Aircraft ground movement plays a key role in improving airport efficiency,as it acts as a link to all other ground operations.Finding novel approaches to coordinate the movements of a fleet of aircraft at an airport in order to improve system resilience to disruptions with increasing autonomy is at the center of many key studies for airport airside operations.Moreover,autonomous taxiing is envisioned as a key component in future digitalized airports.However,state-of-the-art routing and scheduling algorithms for airport ground movements do not consider high-fidelity aircraft models at both the proactive and reactive planning phases.The majority of such algorithms do not actively seek to optimize fuel efficiency and reduce harmful greenhouse gas emissions.This paper proposes a new approach for generating efficient four-dimensional trajectories(4DTs)on the basis of a high-fidelity aircraft model and gainscheduling control strategy.Working in conjunction with a routing and scheduling algorithm that determines the taxi route,waypoints,and time deadlines,the proposed approach generates fuel-efficient 4DTs in real time,while respecting operational constraints.The proposed approach can be used in two contexts:①as a reactive decision support tool to generate new trajectories that can resolve unprecedented events;and②as an autopilot system for both partial and fully autonomous taxiing.The proposed methodology is realistic and simple to implement.Moreover,simulation studies show that the proposed approach is capable of providing an up to 11%reduction in the fuel consumed during the taxiing of a large Boeing 747-100 jumbo jet. | Olusayo Obajemu Mahdi Mahfouf Lohithaksha M.Maiyar Abrar Al-Hzndi Michal Weiszer Jun Chen | 2021 | Engineering2021,7,4: | 2 |
      /1