Search arXiv⌕ Search

arXiv · 2412.10763

Impact of Trip Distance Distribution Time Dependency and Aggregation Levels in Bathtub Models -- A Comparative Simulation Analysis

Abstract

Bathtub models are used to study urban traffic within a certain area. They do not require to take into account the detailed network topology. The emergence of different bathtub models has raised the question of which model can provide more robust and accurate results under different demand scenarios and network properties. This paper presents a comparative simulation analysis of the accumulation-based model and trip-based models under static and dynamic trip distance distribution (TDD) scenarios. Network accumulation was used to validate and compare the performance of the bathtub models with results from the macroscopic traffic simulation with dynamic traffic assignment. Three networks were built to explore the effect of network properties on the accuracy of bathtub models. Two are from the network of Delft, the Netherlands, and one is a reference toy network. The findings show that the time dependency of TDD can increase the errors in bathtub models. Using TDD in different aggregation levels can significantly influence the performance of bathtub models during demand transition periods. The state transition speed of networks is also found to be influential. Future research could explore the effects of dynamic TDD under congested situations and develop enhanced bathtub models that can better account for different network state transition speeds.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiayi Guo, Irene Martínez, Gonçalo Correia, Bart van Arem. 2024-12-14. Impact of Trip Distance Distribution Time Dependency and Aggregation Levels in Bathtub Models -- A Comparative Simulation Analysis. https://arxiv.org/abs/2412.10763

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Simultaneous state estimation and control for nonlinear systems subject to bounded disturbances

In this work, we address the output--feedback control problem for nonlinear systems under bounded disturbances using a moving horizon approach. The controller is posed as an optimisation-based problem that simultaneously estimates the state trajectory and computes future control inputs. It minimises a criterion that involves finite backward and forward horizons with respect to the unknown initial state, measurement noises and control input variables.The main novelty of this work relies on linking the lengths of the forward and backward windows with the closed-loop stability, assuming detectability and decoding sufficient conditions to assure system stabilizability. It leads to a formulation that does not require to be a Control Lyapunov Function for the terminal cost of the controller. Simulation examples are carried out to compare the performance of solving simultaneously and independently the estimation and control problems. Furthermore, the examples show how the controller influences the length of the estimation window through its gain.

eess.SY↗

On finite-horizon approximation of an infinite-horizon feedback Nash equilibrium in discrete-time LQ games

Computing feedback Nash equilibria (FNEs) in infinite-horizon discrete-time linear-quadratic (LQ) dynamic games remains computationally challenging. Inspired by model predictive control (MPC) in single-agent optimal control, we address this challenge with a finite-horizon strategy for approximating one such FNE. The finite-horizon strategy is as follows. Each player $i$ has an individual prediction horizon $T^i$. At each stage, player $i$ envisions an auxiliary $T^i$-stage game, computes its unique FNE, and implements only the first-stage control. Our main results are as follows. First, we give parameter conditions that guarantee geometric convergence of the coupled Riccati iteration to a stabilizing solution. Second, under these conditions, the finite-horizon strategies stabilize the system, and each player's total cost converges to the limiting FNE cost as all prediction horizons tend to infinity. Third, we derive an explicit upper bound on this cost gap that decreases geometrically with the shortest prediction horizon. This bound tells us how long the prediction horizons need to be for a given accuracy. The strategy is tractable and implementable, as it avoids directly solving the coupled algebraic Riccati equations of the infinite-horizon game.

eess.SY↗

Closed Loop Reference Optimization for Extrusion Additive Manufacturing

Various defects occur during material extrusion additive manufacturing processes that degrade the quality of the 3D printed parts and lead to significant material waste. This motivates feedback control of the extrusion process to mitigate defects and prevent print failure. We propose a linear quadratic regulator (LQR) for closed-loop control with force feedback to provide accurate width tracking of the extruded filament. Furthermore, we propose preemptive optimization of the reference force given to the LQR that accounts for the performance of the LQR and generates the optimal reference for the closed loop extrusion dynamics and machine constraints. Simulation results demonstrate the improved tracking performance and response time. Experiments on a Fused Filament Fabrication 3D printer showcase a root mean square error improvement of 39.57% compared to tracking the unmodified reference as well as an 83.7% shorter settling time.

eess.SY↗