启发式
启发式
数学优化
计算机科学
动态规划
弹道
运动规划
任务(项目管理)
能量(信号处理)
运动(物理)
运筹学
人工智能
算法
工程类
数学
系统工程
机器人
统计
物理
天文
作者
Zlatan Ajanović,Michael Stolz,Martin Horn
标识
DOI:10.1016/j.ifacol.2018.07.042
摘要
Predictive motion planning is the key to achieve energy-efficient driving, which is one of the main benefits of automated driving. Researchers have been studying the planning of velocity trajectories, a simpler form of motion planning, for over a decade now and many different methods are available. Dynamic programming has shown to be the most common choice due to its numerical background and ability to include nonlinear constraints and models. Although planning of an optimal trajectory is done in a systematic way, dynamic programming does not use any knowledge about the considered problem to guide the exploration and therefore explores all possible trajectories. A⁎ is a search algorithm which enables using knowledge about the problem to guide the exploration to the most promising solutions first. Knowledge has to be represented in a form of a heuristic function, which gives an optimistic estimate of cost for transitioning to the final state, which is not a straightforward task. This paper presents a novel heuristics incorporating air drag and auxiliary power as well as operational costs of the vehicle, besides kinetic and potential energy and rolling resistance known in the literature. Furthermore, optimal cruising velocity, which depends on vehicle aerodynamic properties and auxiliary power, is derived. Results are compared for different variants of heuristic functions and dynamic programming as well.
科研通智能强力驱动
Strongly Powered by AbleSci AI