Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
Pinoxchio
apollo
提交
3a793501
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,发现更多精彩内容 >>
提交
3a793501
编写于
6月 20, 2019
作者:
K
kechxu
提交者:
Kecheng Xu
6月 20, 2019
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Prediction: narrow the range of caution in cruise
上级
63a2de46
变更
3
隐藏空白更改
内联
并排
Showing
3 changed file
with
7 addition
and
2 deletion
+7
-2
modules/prediction/common/prediction_gflags.cc
modules/prediction/common/prediction_gflags.cc
+2
-0
modules/prediction/common/prediction_gflags.h
modules/prediction/common/prediction_gflags.h
+1
-0
modules/prediction/scenario/prioritization/obstacles_prioritizer.cc
...ediction/scenario/prioritization/obstacles_prioritizer.cc
+4
-2
未找到文件。
modules/prediction/common/prediction_gflags.cc
浏览文件 @
3a793501
...
...
@@ -62,6 +62,8 @@ DEFINE_bool(enable_all_junction, false,
"If consider all junction with junction_mlp_model."
);
DEFINE_double
(
caution_search_distance_ahead
,
50.0
,
"The distance ahead to search caution-level obstacles"
);
DEFINE_double
(
caution_search_distance_backward
,
50.0
,
"The distance backward to search caution-level obstacles"
);
DEFINE_double
(
caution_search_distance_backward_for_merge
,
60.0
,
"The distance backward to search caution-lebel obstacles "
"in the case of merging"
);
...
...
modules/prediction/common/prediction_gflags.h
浏览文件 @
3a793501
...
...
@@ -46,6 +46,7 @@ DECLARE_int32(road_graph_max_search_horizon);
DECLARE_double
(
junction_distance_threshold
);
DECLARE_bool
(
enable_all_junction
);
DECLARE_double
(
caution_search_distance_ahead
);
DECLARE_double
(
caution_search_distance_backward
);
DECLARE_double
(
caution_search_distance_backward_for_merge
);
DECLARE_double
(
caution_search_distance_backward_for_overlap
);
DECLARE_double
(
caution_pedestrian_approach_time
);
...
...
modules/prediction/scenario/prioritization/obstacles_prioritizer.cc
浏览文件 @
3a793501
...
...
@@ -59,7 +59,8 @@ int NearestFrontObstacleIdOnLaneSequence(const LaneSequence& lane_sequence) {
int
nearest_front_obstacle_id
=
std
::
numeric_limits
<
int
>::
min
();
double
smallest_relative_s
=
std
::
numeric_limits
<
double
>::
max
();
for
(
const
auto
&
nearby_obs
:
lane_sequence
.
nearby_obstacle
())
{
if
(
nearby_obs
.
s
()
<
0.0
)
{
if
(
nearby_obs
.
s
()
<
0.0
||
nearby_obs
.
s
()
>
FLAGS_caution_search_distance_ahead
)
{
continue
;
}
if
(
nearby_obs
.
s
()
<
smallest_relative_s
)
{
...
...
@@ -74,7 +75,8 @@ int NearestBackwardObstacleIdOnLaneSequence(const LaneSequence& lane_sequence) {
int
nearest_backward_obstacle_id
=
std
::
numeric_limits
<
int
>::
min
();
double
smallest_relative_s
=
std
::
numeric_limits
<
double
>::
max
();
for
(
const
auto
&
nearby_obs
:
lane_sequence
.
nearby_obstacle
())
{
if
(
nearby_obs
.
s
()
>
0.0
)
{
if
(
nearby_obs
.
s
()
>
0.0
||
nearby_obs
.
s
()
<
-
FLAGS_caution_search_distance_backward
)
{
continue
;
}
if
(
-
nearby_obs
.
s
()
<
smallest_relative_s
)
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录