John Dahl
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
John Dahl has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Jonas Fredriksson
Department of Electrical Engineering, Chalmers University of Technology, Gothenburg, Sweden
5 shared publications - Gabriel Rodrigues de Campos
Zenseact
4 shared publications - Claes Olsson1 shared publication
- Emil Klintberg
Volvo Autonomous Solutions, Göteborg, Sweden
1 shared publication - Sebastien Gros
NTNU
1 shared publication
Latest Publications
- 7 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Vehicles
- Vol. 8 (4) , 2914-2925
Prediction-Uncertainty-Aware Threat Detection for ADAS: A Case Study on Lane-Keeping Assistance
Advanced driver assistance systems typically support the driver in cases where the driver is likely to fail the driving task. The challenge, from a system perspective, is to accurately detect those cases. Recently, machine learning-based prediction models that are able to estimate the prediction uncertainty in real-time have successfully been introduced for this purpose. However, very little effort has been made on using the prediction uncertainty in the decision-making logic to improve the system's robustness, especially in cases where the input data is affected by noise or anomalies that are not presented in the training data. In this work, four threat-detection methods using uncertainty estimates are proposed and evaluated using a real-world data set. The methods use different strategies for leveraging uncertainty information, where the goal is to ensure that the intervention decision is based on trustworthy predictions. The threat-detection methods' performances are evaluated, using five different learning-based prediction models, in the context of a lane-keeping assistance application.
- 7 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Vehicles
- Vol. 8 (4) , 2914-2925
Prediction-Uncertainty-Aware Threat Detection for ADAS: A Case Study on Lane-Keeping Assistance
Advanced driver assistance systems typically support the driver in cases where the driver is likely to fail the driving task. The challenge, from a system perspective, is to accurately detect those cases. Recently, machine learning-based prediction models that are able to estimate the prediction uncertainty in real-time have successfully been introduced for this purpose. However, very little effort has been made on using the prediction uncertainty in the decision-making logic to improve the system's robustness, especially in cases where the input data is affected by noise or anomalies that are not presented in the training data. In this work, four threat-detection methods using uncertainty estimates are proposed and evaluated using a real-world data set. The methods use different strategies for leveraging uncertainty information, where the goal is to ensure that the intervention decision is based on trustworthy predictions. The threat-detection methods' performances are evaluated, using five different learning-based prediction models, in the context of a lane-keeping assistance application.
- 29 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 23 (7) , 9115-9125
Performance and Efficiency Analysis of a Linear Learning-Based Prediction Model Used for Unintended Lane-Departure Detection
Advanced driver assistance systems have been an active research topic for decades, for which many approaches have been developed not only to reduce the number of traffic accidents but also to increase the driver’s comfort. Among the many different solutions proposed, learning-based prediction approaches have gained considerable attention in recent years. Within this scope, this work focuses on the implementation aspects of a linear learning-based regression model for detecting unintended lane-departures, where the goal is to achieve a prediction model with good predictive performance while keeping the computational complexity as low as possible. Aspects under consideration include input signal selection and down-sampling. The linear prediction model is analyzed using a real world data set, and benchmarked against a kinematic constant velocity model and a non-linear regression model. The results show that the linear regression model has a significantly higher prediction performance when compared to a kinematic model. It is also shown that the predictive performance remains comparable to the more complex nonlinear regression model, even though the computational complexity of the linear model is significantly lower.
- 29 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 23 (7) , 9115-9125
Performance and Efficiency Analysis of a Linear Learning-Based Prediction Model Used for Unintended Lane-Departure Detection
Advanced driver assistance systems have been an active research topic for decades, for which many approaches have been developed not only to reduce the number of traffic accidents but also to increase the driver’s comfort. Among the many different solutions proposed, learning-based prediction approaches have gained considerable attention in recent years. Within this scope, this work focuses on the implementation aspects of a linear learning-based regression model for detecting unintended lane-departures, where the goal is to achieve a prediction model with good predictive performance while keeping the computational complexity as low as possible. Aspects under consideration include input signal selection and down-sampling. The linear prediction model is analyzed using a real world data set, and benchmarked against a kinematic constant velocity model and a non-linear regression model. The results show that the linear regression model has a significantly higher prediction performance when compared to a kinematic model. It is also shown that the predictive performance remains comparable to the more complex nonlinear regression model, even though the computational complexity of the linear model is significantly lower.
- 20 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
A Path Prediction Model based on Multiple Time Series Analysis Tools used to Detect Unintended Lane Departures
In this paper, a path prediction model is presented and used to detect unintended lane departures caused by erroneous driving behaviors. The prediction model is inspired by the concept of a linear vector autoregressive model that is commonly used for multiple time series analysis. The original concept is extended to allow sparse historic sampling, which is shown to reduce the computational complexity while maintaining the predictive performance. A real world data set is used to derive and validate the proposed model, for which the performance is benchmarked against a kinematic model. The results show that the proposed model can improve the true positive rate by 18% and reduce the false-positive rate by 34%, with respect to a constant velocity model and for a prediction horizon of 1.75 s.
- 20 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
A Path Prediction Model based on Multiple Time Series Analysis Tools used to Detect Unintended Lane Departures
In this paper, a path prediction model is presented and used to detect unintended lane departures caused by erroneous driving behaviors. The prediction model is inspired by the concept of a linear vector autoregressive model that is commonly used for multiple time series analysis. The original concept is extended to allow sparse historic sampling, which is shown to reduce the computational complexity while maintaining the predictive performance. A real world data set is used to derive and validate the proposed model, for which the performance is benchmarked against a kinematic model. The results show that the proposed model can improve the true positive rate by 18% and reduce the false-positive rate by 34%, with respect to a constant velocity model and for a prediction horizon of 1.75 s.
- 13 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Vehicles
- Vol. 4 (1) , 101-113
Collision Avoidance: A Literature Review on Threat-Assessment Techniques
- 13 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Vehicles
- Vol. 4 (1) , 101-113
Collision Avoidance: A Literature Review on Threat-Assessment Techniques
- 1 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3675-3681
An improved dual Newton strategy for scenario-tree MPC
This paper considers the problem of solving Quadratic Programs (QPs) in the context of robust Model Predictive Control (MPC) based on scenario trees. A Newton strategy is used in conjunction with dual decomposition, yielding a parallelizable method with a fast practical convergence. In this context, it has been observed that the Hessian of the dual function has an intricate sparsity structure and can be rank deficient, hence requiring a computationally expensive linear algebra and a regularization strategy. In this paper, we show that it is possible to organize the robust MPC problem such that the dual Hessian has a block-tridiagonal structure, hence reducing dramatically the cost of its factorization. Moreover, a simple and inexpensive strategy of constraint elimination is proposed for ensuring the positive definiteness of the dual Hessian, making regularization superfluous. This strategy additionally allows for evening the computational burden of computing the robust MPC solution in its parallelization.
- 1 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3675-3681
An improved dual Newton strategy for scenario-tree MPC
This paper considers the problem of solving Quadratic Programs (QPs) in the context of robust Model Predictive Control (MPC) based on scenario trees. A Newton strategy is used in conjunction with dual decomposition, yielding a parallelizable method with a fast practical convergence. In this context, it has been observed that the Hessian of the dual function has an intricate sparsity structure and can be rank deficient, hence requiring a computationally expensive linear algebra and a regularization strategy. In this paper, we show that it is possible to organize the robust MPC problem such that the dual Hessian has a block-tridiagonal structure, hence reducing dramatically the cost of its factorization. Moreover, a simple and inexpensive strategy of constraint elimination is proposed for ensuring the positive definiteness of the dual Hessian, making regularization superfluous. This strategy additionally allows for evening the computational burden of computing the robust MPC solution in its parallelization.