Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
Pinoxchio
apollo
提交
340c976d
A
apollo
项目概览
Pinoxchio
/
apollo
与 Fork 源项目一致
从无法访问的项目Fork
通知
2
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
A
apollo
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
340c976d
编写于
3月 01, 2018
作者:
L
Liangliang Zhang
提交者:
Yifei Jiang
3月 02, 2018
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
fixed lattice planner compile warning.
上级
44caa897
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
11 addition
and
12 deletion
+11
-12
modules/planning/lattice/trajectory_generation/trajectory_evaluator.cc
...ing/lattice/trajectory_generation/trajectory_evaluator.cc
+11
-12
未找到文件。
modules/planning/lattice/trajectory_generation/trajectory_evaluator.cc
浏览文件 @
340c976d
...
...
@@ -37,12 +37,11 @@ namespace planning {
using
Trajectory1d
=
Curve1d
;
TrajectoryEvaluator
::
TrajectoryEvaluator
(
const
std
::
array
<
double
,
3
>&
init_s
,
const
PlanningTarget
&
planning_target
,
const
std
::
array
<
double
,
3
>&
init_s
,
const
PlanningTarget
&
planning_target
,
const
std
::
vector
<
std
::
shared_ptr
<
Trajectory1d
>>&
lon_trajectories
,
const
std
::
vector
<
std
::
shared_ptr
<
Trajectory1d
>>&
lat_trajectories
,
std
::
shared_ptr
<
PathTimeGraph
>
path_time_graph
)
:
init_s_
(
init_s
),
path_time_graph_
(
path_time_graph
)
{
:
path_time_graph_
(
path_time_graph
),
init_s_
(
init_s
)
{
const
double
start_time
=
0.0
;
const
double
end_time
=
FLAGS_trajectory_time_length
;
path_time_intervals_
=
path_time_graph_
->
GetPathBlockingIntervals
(
...
...
@@ -147,16 +146,16 @@ double TrajectoryEvaluator::Evaluate(
// 5. Cost of lateral comfort
// Longitudinal costs
double
lon_objective_cost
=
LonObjectiveCost
(
lon_trajectory
,
planning_target
);
double
lon_objective_cost
=
LonObjectiveCost
(
lon_trajectory
,
planning_target
);
double
lon_jerk_cost
=
LonComfortCost
(
lon_trajectory
);
double
lon_collision_cost
=
LonCollisionCost
(
lon_trajectory
);
// decides the longitudinal evaluation horizon for lateral trajectories.
double
evaluation_horizon
=
std
::
min
(
FLAGS_decision_horizon
,
lon_trajectory
->
Evaluate
(
0
,
lon_trajectory
->
ParamLength
()));
double
evaluation_horizon
=
std
::
min
(
FLAGS_decision_horizon
,
lon_trajectory
->
Evaluate
(
0
,
lon_trajectory
->
ParamLength
()));
std
::
vector
<
double
>
s_values
;
for
(
double
s
=
0.0
;
s
<
evaluation_horizon
;
s
+=
FLAGS_trajectory_space_resolution
)
{
...
...
@@ -297,8 +296,8 @@ std::vector<double> TrajectoryEvaluator::evaluate_per_lonlat_trajectory(
std
::
vector
<
double
>
TrajectoryEvaluator
::
CreateLongitudinalGuideVelocity
(
const
PlanningTarget
&
planning_target
)
const
{
double
comfort_a
=
FLAGS_longitudinal_acceleration_lower_bound
*
FLAGS_comfort_acceleration_factor
;
double
comfort_a
=
FLAGS_longitudinal_acceleration_lower_bound
*
FLAGS_comfort_acceleration_factor
;
double
cruise_s_dot
=
planning_target
.
cruise_speed
();
ConstantAccelerationTrajectory1d
lon_traj
(
init_s_
[
0
],
cruise_s_dot
);
...
...
@@ -320,14 +319,14 @@ std::vector<double> TrajectoryEvaluator::CreateLongitudinalGuideVelocity(
lon_traj
.
AppendSgment
(
stop_a
,
stop_t
);
}
if
(
lon_traj
.
ParamLength
()
<
FLAGS_trajectory_time_length
)
{
lon_traj
.
AppendSgment
(
0.0
,
FLAGS_trajectory_time_length
-
lon_traj
.
ParamLength
());
lon_traj
.
AppendSgment
(
0.0
,
FLAGS_trajectory_time_length
-
lon_traj
.
ParamLength
());
}
}
std
::
vector
<
double
>
reference_s_dot
;
for
(
double
t
=
0.0
;
t
<
FLAGS_trajectory_time_length
;
t
+=
FLAGS_trajectory_time_resolution
)
{
t
+=
FLAGS_trajectory_time_resolution
)
{
reference_s_dot
.
push_back
(
lon_traj
.
Evaluate
(
1
,
t
));
}
return
reference_s_dot
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录