Krister Wolff
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Krister Wolff has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Mattias Wahde
Chalmers University of Technology
3 shared publications - Carl-Johan Hoel
Department of Mechanics and Maritime Sciences, Chalmers University of Technology, Gothenburg, Sweden
2 shared publications - Carl-Johan Hoel
Chalmers University of Technology 412 96 Göteborg Sweden
2 shared publications - Leo Laine
Chalmers University of Technology 412 96 Göteborg Sweden
2 shared publications Almir Heralic
Department of Applied Mechanics, Chalmers University of Technology, 412 96 Göteborg, Sweden
1 shared publication- Gustav Markkula
Institute for Transport Studies, University of Leeds, Leeds, United Kingdom
1 shared publication
Latest Publications
- Open Access
- 4 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Vehicular Technology
- Vol. 7, 1-14
VERNE: A Spatial Data Structure Representing Railway Networks for Autonomous Robot Navigation
Efficient representation and querying of railway networks are crucial for autonomous railway systems and digital infrastructure management. This paper introduces VEctorial Railway NEtwork (VERNE), an interpretable data structure and algorithm that integrates vector-based spatial partitioning with a railway-specific topological framework to enhance network representation and navigation. VERNE is designed to optimize query efficiency, reduce memory footprint, and ensure scalability for real-time applications. Its internal mechanism results from a comparative performance analysis between a $k$-d tree, an STRtree and two custom algorithms, highlighting trade-offs in computational efficiency and memory overhead. The proposed approach is validated using datasets from both the French and Swedish railway networks, demonstrating its effectiveness in real-world scenarios. The results indicate that VERNE provides a robust and scalable solution for railway infrastructure modeling, offering improvements in localization speed and computational efficiency. Another advantage is that it inherently manipulates atomic elements which can contain any information relevant to directly perform navigation onboard an autonomous robot. This work contributes to the advancement of railway digitalization by providing a structured methodology for spatial data processing in autonomous railway systems.
- 4 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Vehicular Technology
- Vol. 7, 1-14
Open AccessVERNE: A Spatial Data Structure Representing Railway Networks for Autonomous Robot Navigation
Efficient representation and querying of railway networks are crucial for autonomous railway systems and digital infrastructure management. This paper introduces VEctorial Railway NEtwork (VERNE), an interpretable data structure and algorithm that integrates vector-based spatial partitioning with a railway-specific topological framework to enhance network representation and navigation. VERNE is designed to optimize query efficiency, reduce memory footprint, and ensure scalability for real-time applications. Its internal mechanism results from a comparative performance analysis between a $k$-d tree, an STRtree and two custom algorithms, highlighting trade-offs in computational efficiency and memory overhead. The proposed approach is validated using datasets from both the French and Swedish railway networks, demonstrating its effectiveness in real-world scenarios. The results indicate that VERNE provides a robust and scalable solution for railway infrastructure modeling, offering improvements in localization speed and computational efficiency. Another advantage is that it inherently manipulates atomic elements which can contain any information relevant to directly perform navigation onboard an autonomous robot. This work contributes to the advancement of railway digitalization by providing a structured methodology for spatial data processing in autonomous railway systems.
- Top Cited Papers
- 16 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 24 (6) , 6030-6041
Ensemble Quantile Networks: Uncertainty-Aware Reinforcement Learning With Applications in Autonomous Driving
Reinforcement learning (RL) can be used to create a decision-making agent for autonomous driving. However, previous approaches provide black-box solutions, which do not offer information on how confident the agent is about its decisions. An estimate of both the aleatoric and epistemic uncertainty of the agent’s decisions is fundamental for real-world applications of autonomous driving. Therefore, this paper introduces the Ensemble Quantile Networks (EQN) method, which combines distributional RL with an ensemble approach, to obtain a complete uncertainty estimate. The distribution over returns is estimated by learning its quantile function implicitly, which gives the aleatoric uncertainty, whereas an ensemble of agents is trained on bootstrapped data to provide a Bayesian estimation of the epistemic uncertainty. A criterion for classifying which decisions that have an unacceptable uncertainty is also introduced. The results show that the EQN method can balance risk and time efficiency in different occluded intersection scenarios, by considering the estimated aleatoric uncertainty. Furthermore, it is shown that the trained agent can use the epistemic uncertainty information to identify situations that the agent has not been trained for and thereby avoid making unfounded, potentially dangerous, decisions outside of the training distribution.
- 16 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 24 (6) , 6030-6041
Top Cited PapersEnsemble Quantile Networks: Uncertainty-Aware Reinforcement Learning With Applications in Autonomous Driving
Reinforcement learning (RL) can be used to create a decision-making agent for autonomous driving. However, previous approaches provide black-box solutions, which do not offer information on how confident the agent is about its decisions. An estimate of both the aleatoric and epistemic uncertainty of the agent’s decisions is fundamental for real-world applications of autonomous driving. Therefore, this paper introduces the Ensemble Quantile Networks (EQN) method, which combines distributional RL with an ensemble approach, to obtain a complete uncertainty estimate. The distribution over returns is estimated by learning its quantile function implicitly, which gives the aleatoric uncertainty, whereas an ensemble of agents is trained on bootstrapped data to provide a Bayesian estimation of the epistemic uncertainty. A criterion for classifying which decisions that have an unacceptable uncertainty is also introduced. The results show that the EQN method can balance risk and time efficiency in different occluded intersection scenarios, by considering the estimated aleatoric uncertainty. Furthermore, it is shown that the trained agent can use the epistemic uncertainty information to identify situations that the agent has not been trained for and thereby avoid making unfounded, potentially dangerous, decisions outside of the training distribution.
- Open Access
Tactical Decision-Making in Autonomous Driving by Reinforcement Learning with Uncertainty Estimation
Reinforcement learning (RL) can be used to create a tactical decision-making agent for autonomous driving. However, previous approaches only output decisions and do not provide information about the agent's confidence in the recommended actions. This paper investigates how a Bayesian RL technique, based on an ensemble of neural networks with additional randomized prior functions (RPF), can be used to estimate the uncertainty of decisions in autonomous driving. A method for classifying whether or not an action should be considered safe is also introduced. The performance of the ensemble RPF method is evaluated by training an agent on a highway driving scenario. It is shown that the trained agent can estimate the uncertainty of its decisions and indicate an unacceptable level when the agent faces a situation that is far from the training distribution. Furthermore, within the training distribution, the ensemble RPF agent outperforms a standard Deep Q-Network agent. In this study, the estimated uncertainty is used to choose safe actions in unknown situations. However, the uncertainty information could also be used to identify situations that should be added to the training process.
Open AccessTactical Decision-Making in Autonomous Driving by Reinforcement Learning with Uncertainty Estimation
Reinforcement learning (RL) can be used to create a tactical decision-making agent for autonomous driving. However, previous approaches only output decisions and do not provide information about the agent's confidence in the recommended actions. This paper investigates how a Bayesian RL technique, based on an ensemble of neural networks with additional randomized prior functions (RPF), can be used to estimate the uncertainty of decisions in autonomous driving. A method for classifying whether or not an action should be considered safe is also introduced. The performance of the ensemble RPF method is evaluated by training an agent on a highway driving scenario. It is shown that the trained agent can estimate the uncertainty of its decisions and indicate an unacceptable level when the agent faces a situation that is far from the training distribution. Furthermore, within the training distribution, the ensemble RPF agent outperforms a standard Deep Q-Network agent. In this study, the estimated uncertainty is used to choose safe actions in unknown situations. However, the uncertainty information could also be used to identify situations that should be added to the training process.
- Top Cited Papers
- 25 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Vehicles
- Vol. 5 (2) , 294-305
Combining Planning and Deep Reinforcement Learning in Tactical Decision Making for Autonomous Driving
Tactical decision making for autonomous driving is challenging due to the diversity of environments, the uncertainty in the sensor information, and the complex interaction with other road users. This paper introduces a general framework for tactical decision making, which combines the concepts of planning and learning, in the form of Monte Carlo tree search and deep reinforcement learning. The method is based on the AlphaGo Zero algorithm, which is extended to a domain with a continuous state space where self-play cannot be used. The framework is applied to two different highway driving cases in a simulated environment and it is shown to perform better than a commonly used baseline method. The strength of combining planning and learning is also illustrated by a comparison to using the Monte Carlo tree search or the neural network policy separately.
- 25 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Vehicles
- Vol. 5 (2) , 294-305
Top Cited PapersCombining Planning and Deep Reinforcement Learning in Tactical Decision Making for Autonomous Driving
Tactical decision making for autonomous driving is challenging due to the diversity of environments, the uncertainty in the sensor information, and the complex interaction with other road users. This paper introduces a general framework for tactical decision making, which combines the concepts of planning and learning, in the form of Monte Carlo tree search and deep reinforcement learning. The method is based on the AlphaGo Zero algorithm, which is extended to a domain with a continuous state space where self-play cannot be used. The framework is applied to two different highway driving cases in a simulated environment and it is shown to perform better than a commonly used baseline method. The strength of combining planning and learning is also illustrated by a comparison to using the Monte Carlo tree search or the neural network policy separately.
- Open Access
Automated Speed and Lane Change Decision Making using Deep Reinforcement Learning
This paper introduces a method, based on deep reinforcement learning, for automatically generating a general purpose decision making function. A Deep Q-Network agent was trained in a simulated environment to handle speed and lane change decisions for a truck-trailer combination. In a highway driving case, it is shown that the method produced an agent that matched or surpassed the performance of a commonly used reference model. To demonstrate the generality of the method, the exact same algorithm was also tested by training it for an overtaking case on a road with oncoming traffic. Furthermore, a novel way of applying a convolutional neural network to high level input that represents interchangeable objects is also introduced.
Open AccessAutomated Speed and Lane Change Decision Making using Deep Reinforcement Learning
This paper introduces a method, based on deep reinforcement learning, for automatically generating a general purpose decision making function. A Deep Q-Network agent was trained in a simulated environment to handle speed and lane change decisions for a truck-trailer combination. In a highway driving case, it is shown that the method produced an agent that matched or surpassed the performance of a commonly used reference model. To demonstrate the generality of the method, the exact same algorithm was also tested by training it for an overtaking case on a road with oncoming traffic. Furthermore, a novel way of applying a convolutional neural network to high level input that represents interchangeable objects is also introduced.
- Open Access
- 3 July 2013
- Published by Springer Nature in European Transport Research Review
- Vol. 6 (1) , 51-60
Driver behaviour in unexpected critical events and in repeated exposures – a comparison
- 3 July 2013
- Published by Springer Nature in European Transport Research Review
- Vol. 6 (1) , 51-60
Open AccessDriver behaviour in unexpected critical events and in repeated exposures – a comparison
- Open Access
- 1 October 2007
- Published by IntechOpen
Evolution of Biped Locomotion Using Linear Genetic Programming
Evolution of Biped Locomotion Using Linear Genetic Programming | InTechOpen, Published on: 2007-10-01. Authors: Krister Wolff and Mattias Wahde
- 1 October 2007
- Published by IntechOpen
Open AccessEvolution of Biped Locomotion Using Linear Genetic Programming
Evolution of Biped Locomotion Using Linear Genetic Programming | InTechOpen, Published on: 2007-10-01. Authors: Krister Wolff and Mattias Wahde
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (1062922X) , 227-234
Structural Evolution of Central Pattern Generators for Bipedal Walking in 3D Simulation
Anthropomorphic walking for a simulated bipedal robot has been realized by means of artificial evolution of central pattern generator (CPG) networks. The approach has been investigated through full rigid-body dynamics simulations in 3D of a bipedal robot with 14 degrees of freedom. The half-center CPG model has been used as an oscillator unit, with interconnection paths between oscillators undergoing structural modifications using a genetic algorithm. In addition, the connection weights in a feedback network of predefined structure were evolved. Furthermore, a supporting structure was added to the robot in order to guide the evolutionary process towards natural, human-like gaits. Subsequently, this structure was removed, and the ability of the best evolved controller to generate a bipedal gait without the help of the supporting structure was verified. Stable, natural gait patterns were obtained, with a maximum walking speed of around 0.9 m/s.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (1062922X) , 227-234
Structural Evolution of Central Pattern Generators for Bipedal Walking in 3D Simulation
Anthropomorphic walking for a simulated bipedal robot has been realized by means of artificial evolution of central pattern generator (CPG) networks. The approach has been investigated through full rigid-body dynamics simulations in 3D of a bipedal robot with 14 degrees of freedom. The half-center CPG model has been used as an oscillator unit, with interconnection paths between oscillators undergoing structural modifications using a genetic algorithm. In addition, the connection weights in a feedback network of predefined structure were evolved. Furthermore, a supporting structure was added to the robot in order to guide the evolutionary process towards natural, human-like gaits. Subsequently, this structure was removed, and the ability of the best evolved controller to generate a bipedal gait without the help of the supporting structure was verified. Stable, natural gait patterns were obtained, with a maximum walking speed of around 0.9 m/s.