期刊
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
卷 119, 期 -, 页码 1-21出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.trb.2018.11.006
关键词
Trajectory planning; Connected vehicles; Automated vehicles; Feasibility conditions; Parsimonious
类别
资金
- National Natural Science Foundation of China [91520301]
- National Key R&D Program in China [2016YFB0100906]
- US National Science Foundation [1558887]
One challenging problem about connected automated vehicles is to optimize vehicle trajectories considering realistic constraints (e.g. vehicle kinematic limits and collision avoidance) and objectives (e.g., travel time, fuel consumption). With respect to communication cost and implementation difficulty, parsimonious trajectory planning has attracted continuous interests. In this paper, we first analyze the feasibility conditions for a general continuous-time trajectory planning problem and then propose an analytical solution method for two important boundary trajectory problems. We further propose a discrete time model with a more general objective function and a certain sparsity requirement that helps parsimonious planned trajectories. This sparsity requirement is implemented with a norm regulatory term appended to the objective function. Numerical examples are conducted on several representative applications and show that the proposed design strategy is effective. (C) 2018 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据