EDBT 2026 Demo / reviewers in the wild / expert
Rob M. P. Goverde
dblp:79/7453
· DBLP profile ↗
10ranked-venue papers
0as first author
7since 2021 · last 2026
0000-0001-8840-4488ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 9 · 7 since 2021Databases, data management, data science and information retrieval · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | A Predictive Artificial Potential Field Method for Virtual Coupling Train ControlabstractIn response to the growing demand for rail transport, next-generation signalling systems are increasingly investigated by the railway community. In particular, the concept of Virtual Coupling (VC) is progressively gaining ground thanks to its potential ability to reduce safe train separation to less than an absolute braking distance. That enables trains to move synchronously in a vehicle-to-vehicle radio-connected convoy. One of the major concerns associated with this concept is the safe and effective control of trains in a convoy when considering varying train resistances and risk factors due to, e.g., sudden degradation in the train and communication performance. This paper develops a novel Predictive Artificial Potential Field (PAPF) approach for safe and effective real-time train control under realistic VC operations. The proposed approach uses a realistic homogeneous strip model of train motion. Moreover, it incorporates a dynamically changing safety margin to take into account risk factor occurrences, such as delays in train control and communication, or sudden emergency braking applications. A simulation-based assessment of the developed method is performed for a high-speed rail corridor in China. Results show that the proposed PAPF control algorithm effectively supervises the safe train separation, preventing activation of emergency brakes even when risk events occur. The method contributes to advancing the state of the art on VC train control. Yuqing Ji, Egidio Quaglietta, Rob M. P. Goverde, Dongxiu Ou |
IEEE Trans. Intell. Transp. Syst. | 3 |
| 2025 | Sensitivity of Train Path Envelopes for Automatic Train OperationabstractAutomatic Train Operation (ATO) aims to enhance punctuality, energy efficiency, and reliability by automating driving tasks. Specifically, for mainline railways, an ATO onboard component generates and tracks optimised train trajectories based on time targets or windows at critical network locations, known as timing points, across train routes. These timing points and their associated constraints are specified in the Train Path Envelope (TPE), computed to ensure conflict-free operations. The generation of TPEs relies on dynamic updates of the real-time traffic plan from the Traffic Management System and real-time train statuses (e.g., position and speed). Understanding how TPEs are affected by these updates is essential for effective ATO deployment. To address this, this paper proposes a sensitivity analysis using elementary effects of a TPE generation algorithm, evaluating its response to variations in real-time traffic plans and train status updates. A real-life case study on a Dutch rail corridor with heterogeneous traffic reveals that control timing points can be introduced into the TPE as headways decrease, to homogenise traffic by aligning speed profiles and thus resolving conflicts. Timing point locations remain mostly unchanged, while their associated time windows become more sensitive when placed further along the route. Operational tolerance, which defines the latest conflict-free passing time, becomes more sensitive to headway changes and the distance from the previous stop. Ziyulong Wang, Egidio Quaglietta, Maarten G. P. Bartholomeus, Rob M. P. Goverde |
IEEE Trans. Intell. Transp. Syst. | 4 |
| 2023 | A Literature Review on Train Motion Model CalibrationabstractThe dynamics of a moving train are usually described by means of a motion model based on Newton’s second law. This model uses as input track geometry data and train characteristics like mass, the parameters that model the running resistance, the maximum tractive effort and power, and the brake rates to be applied. It can reproduce and predict train dynamics accurately if the mentioned train characteristics are carefully calibrated. The model constitutes the core element of a broad variety of railway applications, from timetabling tools to Driver Advisory Systems and Automatic Train Operation. Among the existing train motion model calibration techniques, those that use operational data are of particular interest, as they benefit from on- board recorded data, capturing the train dynamics during operation. In this literature review article we provide an overview of the train motion model calibration techniques that have been published in the scientific literature between January 2000 and December 2021 and either use operational data or can be minimally adapted to use it. To this end, we present a critical overview of the existing train motion model calibration approaches, distinguishing online calibration that analyzes data on- the-go and offline calibration that analyzes historical data batchwise. We propose a research agenda and highlight some potential goals to be tackled in the near future: from devising accurate online calibrators for eco-driving applications to quantitizing the physical sources of parameter variation. Last, we discuss practical recommendations for practitioners and scholars inferred from the current state of the art. Alex Cunillera, Nikola Besinovic, Ramon M. Lentink, Niels van Oort, Rob M. P. Goverde |
IEEE Trans. Intell. Transp. Syst. | 5 |
| 2022 | Artificial Intelligence in Railway Transport: Taxonomy, Regulations, and ApplicationsabstractArtificial Intelligence (AI) is becoming pervasive in most engineering domains, and railway transport is no exception. However, due to the plethora of different new terms and meanings associated with them, there is a risk that railway practitioners, as several other categories, will get lost in those ambiguities and fuzzy boundaries, and hence fail to catch the real opportunities and potential of machine learning, artificial vision, and big data analytics, just to name a few of the most promising approaches connected to AI. The scope of this paper is to introduce the basic concepts and possible applications of AI to railway academics and practitioners. To that aim, this paper presents a structured taxonomy to guide researchers and practitioners to understand AI techniques, research fields, disciplines, and applications, both in general terms and in close connection with railway applications such as autonomous driving, maintenance, and traffic management. The important aspects of ethics and explainability of AI in railways are also introduced. The connection between AI concepts and railway subdomains has been supported by relevant research addressing existing and planned applications in order to provide some pointers to promising directions. Nikola Besinovic, Lorenzo De Donato, Francesco Flammini, Rob M. P. Goverde, Zhiyuan Lin 0002, Ronghui Liu, Stefano Marrone 0002, Roberto Nardone, Tianli Tang, Valeria Vittorini |
IEEE Trans. Intell. Transp. Syst. | 4 |
| 2022 | A Matheuristic for the Integrated Disruption Management of Traffic, Passengers and Stations in Urban Railway LinesabstractIn big cities, the metro lines usually face great pressure caused by huge passengers demand, especially during peak hours. When disruptions occur, passengers accumulate quickly at stations. It is of great importance for dispatchers to take passenger flow control into consideration for the traffic management to ensure passengers’ safety and to maintain their satisfaction. This paper proposes an integrated disruption management model, which incorporates train rescheduling and passenger flow control. In this model, the train services can be short-turned, cancelled and rerouted, while the number of passengers entering a station is managed by controlling the station gates with consideration of the capacities of platforms and trains. Moreover, the number of passengers arriving at a station is calculated according to the origin-destination matrices. The objectives are to recover the train operation to the original timetable as soon as possible and to minimize the waiting time of passengers outside the stations. With the interaction between train services, passengers and station gates, an iterative metaheuristic approach is proposed to solve the integrated disruption management problem. Based on the data of a Beijing metro line, numerical experiments are conducted to test the proposed algorithm. The results demonstrate the importance of integrated disruption management and the effectiveness of our solution method. Nikola Besinovic, Yihui Wang 0001, Songwei Zhu, Egidio Quaglietta, Tao Tang 0004, Rob M. P. Goverde |
IEEE Trans. Intell. Transp. Syst. | 6 |
| 2022 | Deep Deterministic Policy Gradient for High-Speed Train Trajectory OptimizationabstractThis paper proposes a novel train trajectory optimization approach for high-speed railways. We restrict our attention to single train operation scenarios with different scheduled/rescheduled running times aiming at generating optimal train recommended trajectories in real time, which can ensure punctuality and energy efficiency of train operation. A learning-based approach deep deterministic policy gradient (DDPG) is designed to generate optimal train trajectories based on the offline training from the interaction between the agent and the trajectory simulation environment. An allocating running time and selecting operation modes (ARTSOM) algorithm is proposed to improve train punctuality and give a series of discrete operation modes (full traction, cruising, coasting, full braking), and thus to produce a feasible training set for DDPG, which can speed up the training process. Numerical experiments show that an optimized speed profile can be generated by DDPG within seconds on a realistic railway line. In addition, the results demonstrate the generalization ability of trained DDPG in solving TTO problems with different running times and line conditions. Lingbin Ning, Min Zhou 0003, Zhuopu Hou, Rob M. P. Goverde, Fei-Yue Wang 0001, Hairong Dong 0001 |
IEEE Trans. Intell. Transp. Syst. | 4 |
| 2022 | Improving the Utilization of Regenerative Energy and Shaving Power Peaks by Railway Timetable AdjustmentabstractEmploying regenerative braking in trains contributes to reducing the amount of energy used, especially when applied to commuter trains and to those used on very dense suburban networks. This paper presents a method to fine-tune the periodic timetable to improve the utilization of regenerative energy and to shave power peaks while maintaining the structure and robustness of the original timetable. First, a mixed-integer linear programming model based on the periodic event scheduling framework is proposed. A set of feasible timetables is determined and optimized with the aim of increasing synchronized acceleration and braking events at the same station, and maintaining the timetable robustness at the specified level. Next, a local search algorithm is developed to optimize the timetable such that the power peak value is minimized. The max-plus system model is adopted to estimate the delay propagation. Monte Carlo simulation is used to evaluate the utilization of regenerative energy and power peaks in random delayed circumstances. The proposed method was adopted to fine-tune the 2019 timetable for a sub-network of the Dutch railway. In the case of on- time scenarios, the optimized timetable increases the regenerative energy usage by almost 290% and decreases the 15-minute power peaks by 8.5%. In the case of delay scenarios, the optimized timetable outperforms the original timetable in terms of using regenerative energy and shaving power peaks. Pengling Wang, Nikola Besinovic, Rob M. P. Goverde, Francesco Corman |
IEEE Trans. Intell. Transp. Syst. | 3 |
| 2016 | Rescheduling Trains Using Petri Nets and Heuristic SearchabstractRailway systems may be interrupted by unforeseen events that require quick replanning to a feasible new schedule. This paper deals with the train rescheduling problem on double-track lines. The rescheduling problem is regarded as a conflict detection and resolution procedure. Timed Colored Petri nets are adopted to model the railway system: places represent rail resources, and tokens represent trains. A conflict detection rule is established in accordance with the safety principles of railway operations to predict potential conflicts. A Petri-net-based conflict resolution algorithm adapted from the A* algorithm is designed to search for an optimal or a near-optimal feasible schedule. The algorithm takes into account the railway operational principles when generating new markings, so that the new schedule has less train delays and respects the safety principles. The approach is applied in a case study to a double-track corridor from the Dutch railway network. For small delays, the algorithm can make delayed trains recover to their scheduled timetable within seconds. For large perturbations, the solutions generated by the algorithm can effectively reduce train delays while ensuring traffic safety. Pengling Wang, Lei Ma 0007, Rob M. P. Goverde, Qingyuan Wang 0001 |
IEEE Trans. Intell. Transp. Syst. | 3 |
| 2015 | Efficient formalization of railway interlocking data in RailML
Mark Bosschaart, Egidio Quaglietta, Bob Janssen, Rob M. P. Goverde |
Inf. Syst. | 4 |
| 2015 | Online Data-Driven Adaptive Prediction of Train Event TimesabstractThis paper presents a microscopic model for accurate prediction of train event times based on a timed event graph with dynamic arc weights. The process times in the model are dynamically obtained using processed historical track occupation data, thus reflecting all phenomena of railway traffic captured by the train describer systems and preprocessing tools. The graph structure of the model allows applying fast algorithms to compute prediction of event times even for large networks. The accuracy of predictions is increased by incorporating the effects of predicted route conflicts on train running times due to braking and reacceleration. Moreover, the train runs with process times that continuously deviate from their estimates in a certain pattern are detected, and downstream process times are adaptively adjusted to minimize the expected prediction error. The tool has been tested and validated in a real-time environment using train describer log files. Pavle Kecman, Rob M. P. Goverde |
IEEE Trans. Intell. Transp. Syst. | 2 |