ICode9

精准搜索请尝试: 精确搜索
首页 > 其他分享> 文章详细

Baidu Apollo代码解析之Lattice Planner

2019-05-30 10:53:57  阅读:1932  来源: 互联网

标签:Baidu Planner longitudinal point trajectory lateral according Lattice planning


Apollo中提到了几种轨迹规划方法,这里简要介绍Lattice,主要思路可以参考这一篇博文,我为了自己方便理解代码,于是把代码的步骤和注释整理了。文件路径:apollo\modules\planning\planner\lattice\lattice_planner.cc。

  1. obtain a reference line and transform it to the PathPoint format.
  2. compute the matched point of the init planning point on the reference line.

  3. according to the matched point, compute the init state in Frenet frame.

  4. parse the decision and get the planning target.

  5. generate 1d trajectory bundle for longitudinal and lateral respectively.(Trajectory1dGenerator)

  6. first, evaluate the feasibility of the 1d trajectories according to dynamic constraints. second, evaluate the feasible longitudinal and lateral trajectory pairs and sort them according to the cost.(TrajectoryEvaluator)

  7. always get the best pair of trajectories to combine; return the first collision-free trajectory.(TrajectoryCombiner:combine two 1d trajectories to one 2d trajectory。ConstraintChecker:check longitudinal and lateral acceleration considering trajectory curvatures。CollisionChecker:check collision with other obstacles)

标签:Baidu,Planner,longitudinal,point,trajectory,lateral,according,Lattice,planning
来源: https://blog.csdn.net/linxigjs/article/details/90692262

本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享;
2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关;
3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关;
4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除;
5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。

专注分享技术,共同学习,共同进步。侵权联系[81616952@qq.com]

Copyright (C)ICode9.com, All Rights Reserved.

ICode9版权所有