arXiv subjects

Alexander Keimer

Publications and source records attributed to Alexander Keimer.

25 records · Page 2Linked to original sources

arXiv2022

Conservation laws with nonlocal velocity -- the singular limit problem

We consider conservation laws with nonlocal velocity and show for nonlocal weights of exponential type that the unique solutions converge in a weak or strong sense (dependent on the regularity of the velocity) to the entropy solution of the local conservation law when the nonlocal weight approaches a Dirac distribution. To this end, we establish first a uniform total variation estimate on the nonlocal velocity which enables it to prove that the nonlocal solution is entropy admissible in the limit. For the entropy solution, we use a tailored entropy flux pair which allows the usage of only one entropy to obtain uniqueness (given some additional constraints). For general weights, we show that monotonicity of the initial datum is preserved over time which enables it to prove the convergence to the local entropy solution for rather general kernels and monotone initial datum as well. This covers the archetypes of local conservation laws: Shock waves and rarefactions. It also underlines that a ``nonlocal in the velocity'' approximation might be better suited to approximate local conservation laws than a nonlocal in the solution approximation where such monotonicity does only hold for specific velocities.

math.AP↗

arXiv2022

Composing MPC with LQR and Neural Network for Amortized Efficiency and Stable Control

Model predictive control (MPC) is a powerful control method that handles dynamical systems with constraints. However, solving MPC iteratively in real time, i.e., implicit MPC, remains a computational challenge. To address this, common solutions include explicit MPC and function approximation. Both methods, whenever applicable, may improve the computational efficiency of the implicit MPC by several orders of magnitude. Nevertheless, explicit MPC often requires expensive pre-computation and does not easily apply to higher-dimensional problems. Meanwhile, function approximation, although scales better with dimension, still requires pre-training on a large dataset and generally cannot guarantee to find an accurate surrogate policy, the failure of which often leads to closed-loop instability. To address these issues, we propose a triple-mode hybrid control scheme, named Memory-Augmented MPC, by combining a linear quadratic regulator, a neural network, and an MPC. From its standard form, we further derive two variants of such hybrid control scheme: one customized for chaotic systems and the other for slow systems. The proposed scheme does not require pre-computation and can improve the amortized running time of the composed MPC with a well-trained neural network. In addition, the scheme maintains closed-loop stability with any neural networks of proper input and output dimensions, alleviating the need for certifying optimality of the neural network in safety-critical applications.

eess.SY↗

arXiv2022

Limitations and Improvements of the Intelligent Driver Model (IDM)

This contribution analyzes the widely used and well-known "intelligent driver model (briefly IDM), which is a second order car-following model governed by a system of ordinary differential equations. Although this model was intensively studied in recent years for properly capturing traffic phenomena and driver braking behavior, a rigorous study of the well-posedness has, to our knowledge, never been performed. First it is shown that, for a specific class of initial data, the vehicles' velocities become negative or even diverge to $-\infty$ in finite time, both undesirable properties for a car-following model. Various modifications of the IDM are then proposed in order to avoid such ill-posedness. The theoretical remediation of the model, rather than post facto by ad-hoc modification of code implementations, allows a more sound numerical implementation and preservation of the model features. Indeed, to avoid inconsistencies and ensure dynamics close to the one of the original model, one may need to inspect and clean large input data, which may result in practically impossible scenarios for large-scale simulations. Although well-posedness issues occur only for specific initial data, this may happen frequently when different traffic scenarios are analyzed, and especially in presence of lane-changing, on ramps and other network components as it is the case for most commonly used micro-simulators. On the other side, it is shown that well-posedness can be guaranteed by straight-forward improvements, such as those obtained by slightly changing the acceleration to prevent the velocity from becoming negative.

eess.SY↗

arXiv2021

Discontinuous nonlocal conservation laws and related discontinuous ODEs -- Existence, Uniqueness, Stability and Regularity

We study nonlocal conservation laws with a discontinuous flux function of regularity $\mathsf{L}^{\infty}(\mathbb{R})$ in the spatial variable and show existence and uniqueness of weak solutions in $\mathsf{C}\big([0,T];\mathsf{L}^{1}_{\text{loc}}(\mathbb{R})\big)$, as well as related maximum principles. We achieve this well-posedness by a proper reformulation in terms of a fixed-point problem. This fixed-point problem itself necessitates the study of existence, uniqueness and stability of a class of discontinuous ordinary differential equations. On the ODE level, we compare the solution type defined here with the well-known Carathéodory and Filippov solutions.

math.AP↗

arXiv2021

Quasi-Dynamic Traffic Assignment using High Performance Computing

Traffic assignment methods are some of the key approaches used to model flow patterns that arise in transportation networks. Since static traffic assignment does not have a notion of time, it is not designed to represent temporal dynamics that arise as vehicles flow through the network and demand varies through the day. Dynamic traffic assignment methods attempt to resolve these issues, but require significant computational resources if modeling urban-scale regions (on the order of millions of links and vehicles) and often take days of compute time to complete. The focus of this work is two-fold: 1) to introduce a new traffic assignment approach - a quasi-dynamic traffic assignment (QDTA) model and 2) to describe how we parallelized the QDTA algorithms to leverage High-Performance Computing (HPC) and scale to large metropolitan areas while dramatically reducing compute time. We examine and compare different scenarios, including a baseline static traffic assignment (STA) and a quasi-dynamic scenario inspired by the user-equilibrium (UET). Results are presented for the San Francisco Bay Area which accounts for 19M trips/day and an urban road network of 1M links. We utilize an iterative gradient descent method, where the step size is selected using a Quasi-Newton method with parallelized cost function evaluations and compare it to using pre-defined step sizes (MSA). Using the parallelized line search provides a 16 percent reduction in total execution time due to a reduction in the number of gradient descent iterations required for convergence. The full day QDTA comprising 96 optimization steps over 15 minute intervals runs in about 4 minutes on 1,024 cores of the NERSC Cori computer, which represents a speedup of over 36x versus serial execution. To our knowledge, this compute time is significantly lower than other traffic assignment solutions for a problem of this scale.

cs.DC↗

arXiv2020

A general result on the approximation of local conservation laws by nonlocal conservation laws: The singular limit problem for exponential kernels

We deal with the problem of approximating a scalar conservation law by a conservation law with nonlocal flux. As convolution kernel in the nonlocal flux, we consider an exponential-type approximation of the Dirac distribution. This enables us to obtain a total variation bound on the nonlocal term. By using this, we prove that the (unique) weak solution of the nonlocal problem converges strongly in $C(L^{1}_{\text{loc}})$ to the entropy solution of the local conservation law. We conclude with several numerical illustrations which underline the main results and, in particular, the difference between the solution and the nonlocal term.

math.AP↗

arXiv2017

Integration of Information Patterns in the Modeling and Design of Mobility Management Services

Over the last decade, the rise of the mobile internet and the usage of mobile devices has enabled ubiquitous traffic information. With the increased adoption of specific smartphone applications, the number of users of routing applications has become large enough to disrupt traffic flow patterns in a significant manner. Similarly, but at a slightly slower pace, novel services for freight transportation and city logistics improve the efficiency of goods transportation and change the use of road infrastructure. The present article provides a general four-layer framework for modeling these new trends. The main motivation behind the development is to provide a unifying formal system description that can at the same time encompass system physics (flow and motion of vehicles) as well as coordination strategies under various information and cooperation structures. To showcase the framework, we apply it to the specific challenge of modeling and analyzing the integration of routing applications in today's transportation systems. In this framework, at the lowest layer (flow dynamics) we distinguish app users from non-app users. A distributed parameter model based on a non-local partial differential equation is introduced and analyzed. The second layer incorporates connected services (e.g., routing) and other applications used to optimize the local performance of the system. As inputs to those applications, we propose a third layer introducing the incentive design and global objectives, which are typically varying over the day depending on road and weather conditions, external events etc. The high-level planning is handled on the fourth layer taking social long-term objectives into account.

eess.SY↗