2019
DOI: 10.1007/s13042-019-00923-8
|View full text |Cite
|
Sign up to set email alerts
|

A fast decision making method for mandatory lane change using kernel extreme learning machine

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 17 publications
0
3
0
Order By: Relevance
“…In addition, Hou 13 modeled lane changes behavior using a Bayesian classifier and a decision tree method, the prediction accuracy of merge events is 79.3%. In Cheng et al ’s work, 14 a K-ELM (kernel extreme learning machine) based decision-making method was proposed for mandatory lane changes, and simulation results show that it can generate the lane change decision with a 92.86% accuracy for merge events. Jin 15 used the continuous hidden Markov model to predict lane change behavior, the predicted accuracy of left and right lane changes are 84% and 88%, respectively.…”
Section: Related Workmentioning
confidence: 99%
“…In addition, Hou 13 modeled lane changes behavior using a Bayesian classifier and a decision tree method, the prediction accuracy of merge events is 79.3%. In Cheng et al ’s work, 14 a K-ELM (kernel extreme learning machine) based decision-making method was proposed for mandatory lane changes, and simulation results show that it can generate the lane change decision with a 92.86% accuracy for merge events. Jin 15 used the continuous hidden Markov model to predict lane change behavior, the predicted accuracy of left and right lane changes are 84% and 88%, respectively.…”
Section: Related Workmentioning
confidence: 99%
“…• Transport. In this field, several studies focus on process improvement, such as speed and accuracy in lane changing maneuvers when driving on highways [97], driving terrestrial vehicles on rural roads [98], robots learning routes through linguistic decision trees [99], and methods used in biped robot walking processes [100,101].…”
Section: Supervised Learningmentioning
confidence: 99%
“…The kernel function can be applied to train the kernel-based ELM model when the hidden layer feature mapping h(x) is unknown. The K-ELM algorithm does not need to consider the number of hidden nodes and only concerns the selection of the kernel function and the input data (Cheng et al, 2019). Let W k denote the output weight, which is expressed as…”
Section: Brief Description Of Elm and K-elmmentioning
confidence: 99%