اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدComparing the Performance of Traffic Coordination Methods for Advanced Aerial Mobility
73
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Traffic Management in Advanced Aerial Mobility (AAM) inherits many elements of conventional Air Traffic Management (ATM), but brings new complexities and challenges of its own. One of its ways of guaranteeing separation is the use of airborne, stand-alone Detect-And-Avoid, an operational concept where each aircraft decides its avoidance maneuvers independently, observing right-of-way rules and, in specific implementations, some form of pairwise coordination. This is a fundamental safety element for autonomous aircraft but, according to our research, is not sufficient for high-density airspaces as envisioned for urban environments. In these environments, some way of explicit and strategic traffic coordination must be in place, as done for conventional ATM. For efficiency reasons, ATM is evolving to more flexible uses of the airspace, such that the use of dynamically allocated corridors is a rising concept for AAM. These strategic forms of traffic coordination are potentially highly efficient if the aircraft adhere to their trajectory contracts and there are no significant perturbations to the traffic. However, if significant perturbations occur, such as loss of data communication, or the sudden appearance of an intruder, a centralized system may not react appropriately in due time. In busy scenarios, even small deviations from plans may compound so rapidly as to result in large differences in the overall achieved scenario, resulting in congestions and convoluted conflicts. Therefore, it is worth studying traffic coordination techniques that work locally with shorter look-ahead times. To that end, we explore an airborne collaborative method for traffic coordination, which is capable of safely solving conflicts with multiple aircraft, stressing its capabilities throughout a large number of scenarios and comparing its performance with established methods.
قيم البحث
اقرأ أيضاً
For high-density metro traffic, nowadays the time-variant passenger flow is the main cause of train delays and stranded passengers. Typically, the main objective of automatic metro traffic regulation methods is to minimize the delay time of trains wh
ile passengers satisfaction is not considered. Instead, in this work, a novel framework that integrates a passenger flow module (PFM) and a train operation module (TOM) is proposed with the aim of simultaneously minimizing traffic delays and passengers discomfort. In particular, the PFM is devoted to the optimization of the headway time in case of platform overcrowding, so as to reduce the passengers waiting time at platforms and increase the load rate of trains; while the TOM is devoted to the minimization of trains delays. The two modules interact with each other so that the headway time is automatically adjusted when a platform is overcrowded, and the train traffic is immediately regulated according to the new headway time. As a result, the number of passengers on the platform and their total waiting time can be significantly reduced. Numerical results are provided to show the effectiveness of the proposed method in improving the operation performance while minimizing the passengers discomfort.
Based on game theory and dynamic Level-k model, this paper establishes an intelligent traffic control method for intersections, studies the influence of multi-agent vehicle joint decision-making and group behavior disturbance on system state. The sim
ulation results show that this method has a good performance when there are more vehicles or emergency vehicles have higher priority.
This paper proposes decentralized resource-aware coordination schemes for solving network optimization problems defined by objective functions which combine locally evaluable costs with network-wide coupling components. These methods are well suited
for a group of supervised agents trying to solve an optimization problem under mild coordination requirements. Each agent has information on its local cost and coordinates with the network supervisor for information about the coupling term of the cost. The proposed approach is feedback-based and asynchronous by design, guarantees anytime feasibility, and ensures the asymptotic convergence of the network state to the desired optimizer. Numerical simulations on a power system example illustrate our results.
Demand flexibility is increasingly important for power grids. Careful coordination of thermostatically controlled loads (TCLs) can modulate energy demand, decrease operating costs, and increase grid resiliency. We propose a novel distributed control
framework for the Coordination Of HeterOgeneous Residential Thermostatically controlled loads (COHORT). COHORT is a practical, scalable, and versatile solution that coordinates a population of TCLs to jointly optimize a grid-level objective, while satisfying each TCLs end-use requirements and operational constraints. To achieve that, we decompose the grid-scale problem into subproblems and coordinate their solutions to find the global optimum using the alternating direction method of multipliers (ADMM). The TCLs local problems are distributed to and computed in parallel at each TCL, making COHORT highly scalable and privacy-preserving. While each TCL poses combinatorial and non-convex constraints, we characterize these constraints as a convex set through relaxation, thereby making COHORT computationally viable over long planning horizons. After coordination, each TCL is responsible for its own control and tracks the agreed-upon power trajectory with its preferred strategy. In this work, we translate continuous power back to discrete on/off actuation, using pulse width modulation. COHORT is generalizable to a wide range of grid objectives, which we demonstrate through three distinct use cases: generation following, minimizing ramping, and peak load curtailment. In a notable experiment, we validated our approach through a hardware-in-the-loop simulation, including a real-world air conditioner (AC) controlled via a smart thermostat, and simulated instances of ACs modeled after real-world data traces. During the 15-day experimental period, COHORT reduced daily peak loads by an average of 12.5% and maintained comfortable temperatures.
We present a procedure to numerically compute finite step worst case performance guarantees on a given algorithm for the unconstrained optimization of strongly convex functions with Lipschitz continuous gradients. The solution method provided serves
as an alternative approach to that derived by Taylor, Hendrickx, and Glineur in [Math. Prog. 161 (1-2), 2017]. The difference lies in the fact that our solution uses conditions for the interpolation of a set of points and gradient evaluations by the gradient of a function in the class of interest, whereas their solution uses conditions for the interpolation of a set of points, gradient evaluations, and function evaluations by a function in the class of interest. The motivation for this alternative solution is that, in many cases, neither the algorithm nor the performance metric of interest rely upon function evaluations. The primary development is a procedure to avoid suffering from the factorial growth in the number of these conditions with the size of the set to be interpolated when solving for the worst case performance.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
