|
Frontiers of Information Technology & Electronic Engineering
ISSN 2095-9184 (print), ISSN 2095-9230 (online)
2016 Vol.17 No.6 P.553-565
Intelligent computing budget allocation for on-road trajectory planning based on candidate curves
Abstract: In this paper, on-road trajectory planning is solved by introducing intelligent computing budget allocation (ICBA) into a candidate-curve-based planning algorithm, namely, ordinal-optimization-based differential evolution (OODE). The proposed algorithm is named IOODE with ‘I’ representing ICBA. OODE plans the trajectory in two parts: trajectory curve and acceleration profile. The best trajectory curve is picked from a set of candidate curves, where each curve is evaluated by solving a subproblem with the differential evolution (DE) algorithm. The more iterations DE performs, the more accurate the evaluation will become. Thus, we intelligently allocate the iterations to individual curves so as to reduce the total number of iterations performed. Meanwhile, the selected best curve is ensured to be one of the truly top curves with a high enough probability. Simulation results show that IOODE is 20% faster than OODE while maintaining the same performance in terms of solution quality. The computing budget allocation framework presented in this paper can also be used to enhance the efficiency of other candidate-curve-based planning methods.
Key words: Intelligent computing budget allocation, Trajectory planning, On-road planning, Intelligent vehicles, Ordinal optimization
创新点:提出基于智能计算量分配(ICBA)的轨迹规划算法框架;设计曲线评价预测模型和优质曲线选拔模型,提出基于ICBA的轨迹规划算法IOODE。
方法:基于对优质曲线迭代分配计算量的思想,设计智能计算量分配(ICBA)机制,提出基于ICBA的轨迹规划算法框架(图4);设计曲线评价预测模型(EPM)和优质曲线选拔模型(CSM),提出基于ICBA的轨迹规划算法IOODE;通过仿真分析IOODE算法的轨迹规划结果(图9、10),验证所提出计算量分配机制的有效性(图12、13)和ICBA对算法效率的提升作用(图14、表5)。
结论:本文中提出的IOODE算法与OODE算法相比,求解质量没有明显区别,但求解速度提升约20%(表5)。
关键词组:
References:
Open peer comments: Debate/Discuss/Question/Opinion
<1>
DOI:
10.1631/FITEE.1500269
CLC number:
TP242.6
Download Full Text:
Downloaded:
2506
Download summary:
<Click Here>Downloaded:
1971Clicked:
6964
Cited:
0
On-line Access:
2024-08-27
Received:
2023-10-17
Revision Accepted:
2024-05-08
Crosschecked:
2016-05-18