ترغب بنشر مسار تعليمي؟ اضغط هنا

Dynamic driving and routing games for autonomous vehicles on networks: A mean field game approach

98   0   0.0 ( 0 )
 نشر من قبل Kuang Huang
 تاريخ النشر 2020
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

This paper aims to answer the research question as to optimal design of decision-making processes for autonomous vehicles (AVs), including dynamical selection of driving velocity and route choices on a transportation network. Dynamic traffic assignment (DTA) has been widely used to model travelerss route choice or/and departure-time choice and predict dynamic traffic flow evolution in the short term. However, the existing DTA models do not explicitly describe ones selection of driving velocity on a road link. Driving velocity choice may not be crucial for modeling the movement of human drivers but it is a must-have control to maneuver AVs. In this paper, we aim to develop a game-theoretic model to solve for AVss optimal driving strategies of velocity control in the interior of a road link and route choice at a junction node. To this end, we will first reinterpret the DTA problem as an N-car differential game and show that this game can be tackled with a general mean field game-theoretic framework. The developed mean field game is challenging to solve because of the forward and backward structure for velocity control and the complementarity conditions for route choice. An efficient algorithm is developed to address these challenges. The model and the algorithm are illustrated on the Braess network and the OW network with a single destination. On the Braess network, we first compare the LWR based DTA model with the proposed game and find that the driving and routing control navigates AVs with overall lower costs. We then compare the total travel cost without and with the middle link and find that the Braess paradox may still arise under certain conditions. We also test our proposed model and solution algorithm on the OW network.



قيم البحث

اقرأ أيضاً

96 - Kuang Huang , Xuan Di , Qiang Du 2019
This paper presents scalable traffic stability analysis for both pure autonomous vehicle (AV) traffic and mixed traffic based on continuum traffic flow models. Human vehicles are modeled by a non-equilibrium traffic flow model, i.e., Aw-Rascle-Zhang (ARZ), which is unstable. AVs are modeled by the mean field game which assumes AVs are rational agents with anticipation capacities. It is shown from linear stability analysis and numerical experiments that AVs help stabilize the traffic. Further, we quantify the impact of AVs penetration rate and controller design on the traffic stability. The results may provide insights for AV manufacturers and city planners.
215 - Kuang Huang , Xuan Di , Qiang Du 2019
This paper proposes an efficient computational framework for longitudinal velocity control of a large number of autonomous vehicles (AVs) and develops a traffic flow theory for AVs. Instead of hypothesizing explicitly how AVs drive, our goal is to de sign future AVs as rational, utility-optimizing agents that continuously select optimal velocity over a period of planning horizon. With a large number of interacting AVs, this design problem can become computationally intractable. This paper aims to tackle such a challenge by employing mean field approximation and deriving a mean field game (MFG) as the limiting differential game with an infinite number of agents. The proposed micro-macro model allows one to define individuals on a microscopic level as utility-optimizing agents while translating rich microscopic behaviors to macroscopic models. Different from existing studies on the application of MFG to traffic flow models, the present study offers a systematic framework to apply MFG to autonomous vehicle velocity control. The MFG-based AV controller is shown to mitigate traffic jam faster than the LWR-based controller. MFG also embodies classical traffic flow models with behavioral interpretation, thereby providing a new traffic flow theory for AVs.
We study a general class of entropy-regularized multi-variate LQG mean field games (MFGs) in continuous time with $K$ distinct sub-population of agents. We extend the notion of actions to action distributions (exploratory actions), and explicitly der ive the optimal action distributions for individual agents in the limiting MFG. We demonstrate that the optimal set of action distributions yields an $epsilon$-Nash equilibrium for the finite-population entropy-regularized MFG. Furthermore, we compare the resulting solutions with those of classical LQG MFGs and establish the equivalence of their existence.
123 - Canqi Yao , Shibo Chen , 2021
Logistics has gained great attentions with the prosperous development of commerce, which is often seen as the classic optimal vehicle routing problem. Meanwhile, electric vehicle (EV) has been widely used in logistic fleet to curb the emission of gre en house gases in recent years. Solving the optimization problem of joint routing and charging of multiple EVs is in a urgent need, whose objective function includes charging time, charging cost, EVs travel time, usage fees of EV and revenue from serving customers. This joint problem is formulated as a mixed integer programming (MIP) problem, which, however, is NP-hard due to integer restrictions and bilinear terms from the coupling between routing and charging decisions. The main contribution of this paper lies at proposing an efficient two stage algorithm that can decompose the original MIP problem into two linear programming (LP) problems, by exploiting the exactness of LP relaxation and eliminating the coupled term. This algorithm can achieve a nearoptimal solution in polynomial time. In addition, another variant algorithm is proposed based on the two stage one, to further improve the quality of solution.
Robots deployed in real-world environments should operate safely in a robust manner. In scenarios where an ego agent navigates in an environment with multiple other non-ego agents, two modes of safety are commonly proposed -- adversarial robustness a nd probabilistic constraint satisfaction. However, while the former is generally computationally intractable and leads to overconservative solutions, the latter typically relies on strong distributional assumptions and ignores strategic coupling between agents. To avoid these drawbacks, we present a novel formulation of robustness within the framework of general-sum dynamic game theory, modeled on defensive driving. More precisely, we prepend an adversarial phase to the ego agents cost function. That is, we prepend a time interval during which other agents are assumed to be temporarily distracted, in order to render the ego agents equilibrium trajectory robust against other agents potentially dangerous behavior during this time. We demonstrate the effectiveness of our new formulation in encoding safety via multiple traffic scenarios.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا