Incident indicators for freeway traffic flow models

Developed in this paper is a traffic flow model parametrised to describe abnormal traffic behaviour. In large traffic networks, the immediate detection and categorisation of traffic incidents/accidents is of capital importance to avoid breakdowns, further accidents. First, this claims for traffic flow models capable to capture abnormal traffic condition like accidents. Second, by means of proper real-time estimation technique, observing accident related parameters, one may even categorize the severity of accidents. Hence, in this paper, we suggest to modify the nominal Aw-Rascle (AR) traffic model by a proper incident related parametrisation. The proposed Incident Traffic Flow (ITF) model is defined by introducing the incident parameters modifying the anticipation and the dynamic speed relaxation terms in the speed equation of the AR model. These modifications are proven to have physical meaning. Furthermore, the characteristic properties of the ITF model is discussed in the paper. A multi stage numerical scheme is suggested to discretise in space and time the resulting non-homogeneous system of PDEs. The resulting systems of ODE is then combined with receding horizon estimation methods to reconstruct the incident parameters. Finally, the viability of the suggested incident parametrisation is validated in a simulation environment.Team Azita Dabir

Optimized Speed Trajectories for Cyclists, Based on Personal Preferences and Traffic Light Information-A Stochastic Dynamic Programming Approach

The literature on green mobility and eco-driving in urban areas has burgeoned in recent years, with special attention to using infrastructure to vehicle (I2V) communications to obtain optimal speed trajectory which minimize the economic and environmental costs. This article shares the concept with these studies but turns the spotlight on cyclists. It examines the problem of finding optimal speed trajectory for a cyclist in signalised urban areas. Unlike the available studies on motorised vehicles which predominantly designed for pre-defined, fixed traffic lights timing, this article uses an algorithm based on stochastic dynamic programming to explicitly address uncertainty in traffic light timing. Moreover, through a comprehensive set of simulation experiments, the article examines the impact of the speed advice's starting point as well as the cyclist's willingness for changing his/her speed on enhancing the performance. The proposed approach targets various performance metrics such as minimising the total travel time, energy consumption, or the probability of stopping at a red light. Hence, the resulting speed advice can be tailored according to the personal preferences of each cyclist. In a simulation case study, the results of the proposed approach is also compared with an existing approach in the literature. Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Team Azita DabiriTransport and PlanningTransport and Plannin

Timetable Scheduling for Passenger-Centric Urban Rail Networks: Model Predictive Control based on a Novel Absorption Model

Timetable scheduling plays a key role in daily operations of urban rail transit systems, as it determines the quality of service provided to passengers. In order to develop efficient timetable scheduling methods, it is necessary to develop a proper model to integrate timetable-related and passenger-related factors in urban rail network efficiently. In this paper, a novel passenger absorption model for passenger- centric urban rail networks is established. The model explicitly integrates time-varying passenger origin-destination demands and the departure frequency of each line for real-time timetable scheduling. Then, a model predictive control (MPC) method for the timetable scheduling problem is proposed based on the developed model. The resulting MPC optimization problem can be formulated as a mixed-integer programming (MILP) problem, which can be solved efficiently by using the existing MILP solvers. The effectiveness of the absorption model and the corresponding MILP-based MPC approach is illustrated through the case study based on two Beijing subway lines. Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Team Bart De SchutterTeam Azita DabiriDelft Center for Systems and Contro

Deep Learning for Object Detection and Segmentation in Videos: Toward an Integration With Domain Knowledge

Deep learning has enabled the rapid expansion of computer vision tasks from image frames to video segments. This paper focuses on the review of the latest research in the field of computer vision tasks in general and on object localization and identification of their associated pixels in video frames in particular. After performing a systematic analysis of the existing methods, the challenges related to computer vision tasks are presented. In order to address the existing challenges, a hybrid framework is proposed, where deep learning methods are coupled with domain knowledge. An additional feature of this survey is that a review of the currently existing approaches integrating domain knowledge with deep learning techniques is presented. Finally, some conclusions on the implementation of hybrid architectures to perform computer vision tasks are discussed.Team DeSchutterTeam Azita Dabir

Learning safety in model-based Reinforcement Learning using MPC and Gaussian Processes

This paper proposes a method to encourage safety in Model Predictive Control (MPC)-based Reinforcement Learning (RL) via Gaussian Process (GP) regression. The framework consists of 1) a parametric MPC scheme that is employed as model-based controller with approximate knowledge on the real system's dynamics, 2) an episodic RL algorithm tasked with adjusting the MPC parametrization in order to increase its performance, and 3) GP regressors used to estimate, directly from data, constraints on the MPC parameters capable of predicting, up to some probability, whether the parametrization is likely to yield a safe or unsafe policy. These constraints are then enforced onto the RL updates in an effort to enhance the learning method with a probabilistic safety mechanism. Compared to other recent publications combining safe RL with MPC, our method does not require further assumptions on, e.g., the prediction model in order to retain computational tractability. We illustrate the results of our method in a numerical example on the control of a quadrotor drone in a safety-critical environment.Team Azita DabiriDelft Center for Systems and Contro

Towards establishing an automated selection framework for underwater image enhancement methods

The majority of computer vision architectures are developed based on the assumption of the availability of good quality data. However, this is a particularly hard requirement to achieve in underwater conditions. To address this limitation, plenty of underwater image enhancement methods have received considerable attention during the last decades, but due to the lack of a commonly accepted framework to systematically evaluate them and to determine the likely optimal one for a given image, their adoption in practice is hindered, since it is not clear which one can achieve the best results. In this paper, we propose a standardized selection framework to evaluate the quality of an underwater image and to estimate the most suitable image enhancement technique based on its impact on the image classification performance.Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Team Bart De SchutterTeam Azita DabiriDelft Center for Systems and Contro

Clustering-based methodology for estimating bicycle accumulation levels on signalized links: A case study from the Netherlands

The number of queued bicycles on a signalised link is crucial information for the adoption of intelligent transport systems, aiming at a better management of cyclists in cities. An unsupervised machine learning methodology is deployed to produce estimations of accumulation levels based on data retrieved from a bicycle street of the Netherlands. The use of a clustering-based approach, combined with a conceptual insight into the bicycle accumulation process and various data sources, makes the applied methodology less dependent on sensor errors. This clustering-based methodology is a first step in bicycle accumulation estimation and clearly identifies levels of cyclists accumulated in front of a traffic light.Accepted Author ManuscriptTransport and PlanningTeam DeSchutterTransport and Plannin

Energy-based shape regulation of soft robots with unactuated dynamics dominated by elasticity

This paper proposes a model-based control design approach for a broad class of soft robots, having their elastic field dominating gravity in the unactuated coordinates. To this end, we consider finite-dimensional dynamic models obtained from approximations of the system's energy. Then, we propose a general control architecture that can stabilize soft robots based on potential energy shaping. We discuss three specializations of this general architecture: a PD with mixed feedback-feedforward gravity compensation, a PD with feedforward compensation, and a saturated version of the latter. We provide a physical interpretation of the controllers, and we illustrate their applicability through simulations.Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Learning & Autonomous ControlTeam Azita Dabir

Exploring the Potential of Neural Networks for Bicycle Travel Time Estimation

A tool for travel time estimation of cyclists approaching a traffic light can monitor level of service of intersections in bike crowded cities. This work represents a first step in developing such a tool. Neural Network models are evaluated on how they perform in estimating individual travel time of cyclists approaching a signalized intersection. Based on simulated scenarios, in cities with low bicycle levels (deterministic scenario), Neural Networks are good travel time estimators whereas, in places with high bike volumes (where cyclists depart with a discharge rate) information on queued cyclists is crucial for travel time information.Accepted Author ManuscriptTransport and PlanningTeam DeSchutterTransport and Plannin

Real-Time Train Scheduling With Uncertain Passenger Flows: A Scenario-Based Distributed Model Predictive Control Approach

Real-time train scheduling is essential for passenger satisfaction in urban rail transit networks. This paper focuses on real-time train scheduling for urban rail transit networks considering uncertain time-dependent passenger origin-destination demands. First, a macroscopic passenger flow model we proposed before is extended to include rolling stock availability. Then, a distributed-knowledgeable-reduced-horizon (DKRH) algorithm is developed to deal with the computational burden and the communication restrictions of the train scheduling problem in urban rail transit networks. For the DKRH algorithm, a cost-to-go function is designed to reduce the prediction horizon of the original model predictive control approach while taking into account the control performance. By applying a scenario reduction approach, a scenario-based distributed-knowledgeable-reduced-horizon (S-DKRH) algorithm is proposed to handle the uncertain passenger flows with an acceptable increase in computation time. Numerical experiments are conducted to evaluate the effectiveness of the developed DKRH and S-DKRH algorithms based on real-life data from the Beijing urban rail transit network. The simulation results indicate that DKRH can be used to achieve real-time train scheduling for the urban rail transit network, while S-DKRH can handle the uncertainty in the passenger flows with an acceptable sacrifice in computation time.Team Bart De SchutterTeam Azita DabiriDelft Center for Systems and Contro