اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدConformal Transformation Electromagnetics Based on Schwarz-Christoffel Mapping for the Synthesis of Doubly Connected Metalenses
114
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
An innovative transformation electromagnetics (TE) paradigm, which leverages on the Schwarz-Christoffel (SC) theorem, is proposed to design effective and realistic field manipulation devices (FMDs). Thanks to the conformal property, such a TE design method allows one to considerably mitigate the anisotropy of the synthesized metalenses (i.e., devices with artificially engineered materials covering an antenna to modify its radiation features) with respect to those yielded by the competitive state-of-the-art TE techniques. Moreover, devices with doubly connected contours, thus including masts with arbitrary sections and lenses with holes/forbidden regions in which the material properties cannot be controlled, can be handled. A set of numerical experiments is presented to assess the features of the proposed method in terms of field-manipulation capabilities and complexity of the lens material in a comparative fashion.
قيم البحث
اقرأ أيضاً
La transformoj de Schwarz-Christoffel mapas, konforme, la superan kompleksan duon-ebenon al regiono limigita per rektaj segmentoj. Cxi tie ni priskribas kiel konvene kunigi mapon de la suba duon-ebeno al mapo de la supera duon-ebeno. Ni emfazas la be
zonon de klara difino de angulo de kompleksa nombro, por tiu kunigo. Ni diskutas kelkajn ekzemplojn kaj donas interesan aplikon pri movado de fluido. ------- Schwarz-Christoffel transformations map, conformally, the complex upper half plane into a region bounded by right segments. Here we describe how to couple conveniently a map of the lower half plane to the map of the upper half plane. We emphasize the need of a clear definition of angle of a complex, to that coupling. We discuss some examples and give an interesting application for motion of fluid.
This paper investigates the cooperative planning and control problem for multiple connected autonomous vehicles (CAVs) in different scenarios. In the existing literature, most of the methods suffer from significant problems in computational efficienc
y. Besides, as the optimization problem is nonlinear and nonconvex, it typically poses great difficultly in determining the optimal solution. To address this issue, this work proposes a novel and completely parallel computation framework by leveraging the alternating direction method of multipliers (ADMM). The nonlinear and nonconvex optimization problem in the autonomous driving problem can be divided into two manageable subproblems; and the resulting subproblems can be solved by using effective optimization methods in a parallel framework. Here, the differential dynamic programming (DDP) algorithm is capable of addressing the nonlinearity of the system dynamics rather effectively; and the nonconvex coupling constraints with small dimensions can be approximated by invoking the notion of semi-definite relaxation (SDR), which can also be solved in a very short time. Due to the parallel computation and efficient relaxation of nonconvex constraints, our proposed approach effectively realizes real-time implementation and thus also extra assurance of driving safety is provided. In addition, two transportation scenarios for multiple CAVs are used to illustrate the effectiveness and efficiency of the proposed method.
We introduce reachability analysis for the formal examination of robots. We propose a novel identification method, which preserves reachset conformance of linear systems. We additionally propose a simultaneous identification and control synthesis sch
eme to obtain optimal controllers with formal guarantees. In a case study, we examine the effectiveness of using reachability analysis to synthesize a state-feedback controller, a velocity observer, and an output feedback controller.
Connected and Automated Hybrid Electric Vehicles have the potential to reduce fuel consumption and travel time in real-world driving conditions. The eco-driving problem seeks to design optimal speed and power usage profiles based upon look-ahead info
rmation from connectivity and advanced mapping features. Recently, Deep Reinforcement Learning (DRL) has been applied to the eco-driving problem. While the previous studies synthesize simulators and model-free DRL to reduce online computation, this work proposes a Safe Off-policy Model-Based Reinforcement Learning algorithm for the eco-driving problem. The advantages over the existing literature are three-fold. First, the combination of off-policy learning and the use of a physics-based model improves the sample efficiency. Second, the training does not require any extrinsic rewarding mechanism for constraint satisfaction. Third, the feasibility of trajectory is guaranteed by using a safe set approximated by deep generative models. The performance of the proposed method is benchmarked against a baseline controller representing human drivers, a previously designed model-free DRL strategy, and the wait-and-see optimal solution. In simulation, the proposed algorithm leads to a policy with a higher average speed and a better fuel economy compared to the model-free agent. Compared to the baseline controller, the learned strategy reduces the fuel consumption by more than 21% while keeping the average speed comparable.
Connected and automated vehicles have shown great potential in improving traffic mobility and reducing emissions, especially at unsignalized intersections. Previous research has shown that vehicle passing order is the key influencing factor in improv
ing intersection traffic mobility. In this paper, we propose a graph-based cooperation method to formalize the conflict-free scheduling problem at an unsignalized intersection. Based on graphical analysis, a vehicles trajectory conflict relationship is modeled as a conflict directed graph and a coexisting undirected graph. Then, two graph-based methods are proposed to find the vehicle passing order. The first is an improved depth-first spanning tree algorithm, which aims to find the local optimal passing order vehicle by vehicle. The other novel method is a minimum clique cover algorithm, which identifies the global optimal solution. Finally, a distributed control framework and communication topology are presented to realize the conflict-free cooperation of vehicles. Extensive numerical simulations are conducted for various numbers of vehicles and traffic volumes, and the simulation results prove the effectiveness of the proposed algorithms.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
