Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
Pinoxchio
apollo
提交
b3967e90
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,发现更多精彩内容 >>
提交
b3967e90
编写于
11月 20, 2018
作者:
L
Liangliang Zhang
提交者:
Jiangtao Hu
12月 13, 2018
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Planning: fixed case 23, 82, 100, 112, 178, 180, 10791, 10801
上级
a5e64054
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
21 addition
and
21 deletion
+21
-21
modules/planning/toolkits/deciders/side_pass_path_decider.cc
modules/planning/toolkits/deciders/side_pass_path_decider.cc
+21
-21
未找到文件。
modules/planning/toolkits/deciders/side_pass_path_decider.cc
浏览文件 @
b3967e90
...
...
@@ -22,8 +22,8 @@
#include <algorithm>
#include <string>
#include <utility>
#include <unordered_map>
#include <utility>
#include "modules/common/proto/pnc_point.pb.h"
...
...
@@ -44,8 +44,8 @@ using apollo::common::util::MakePointENU;
using
apollo
::
hdmap
::
HDMapUtil
;
constexpr
double
kRoadBuffer
=
0.0
;
constexpr
double
kObstacleLBuffer
=
0.
4
;
constexpr
double
kObstacleSBuffer
=
3
.0
;
constexpr
double
kObstacleLBuffer
=
0.
1
;
constexpr
double
kObstacleSBuffer
=
1
.0
;
constexpr
double
kSidePassPathLength
=
50.0
;
SidePassPathDecider
::
SidePassPathDecider
(
const
TaskConfig
&
config
)
...
...
@@ -248,7 +248,7 @@ SidePassPathDecider::GetPathBoundaries(
const
TrajectoryPoint
&
planning_start_point
,
const
SLBoundary
&
adc_sl_boundary
,
const
ReferenceLine
&
reference_line
,
const
IndexedList
<
std
::
string
,
Obstacle
>
&
indexed_obstacles
,
bool
*
fail_to_find_boundary
)
{
bool
*
fail_to_find_boundary
)
{
std
::
vector
<
std
::
tuple
<
double
,
double
,
double
>>
lateral_bounds
;
constexpr
double
kLargeBoundary
=
10.0
;
...
...
@@ -316,13 +316,11 @@ SidePassPathDecider::GetPathBoundaries(
}
ADEBUG
<<
"Obstacles that are considered is at: "
<<
"curr_s = "
<<
curr_s
-
adc_frenet_frame_point_
.
s
()
<<
" start_s = "
<<
obs_sl
.
start_s
()
-
adc_frenet_frame_point_
.
s
()
<<
" end_s = "
<<
obs_sl
.
end_s
()
-
adc_frenet_frame_point_
.
s
()
<<
" start_l = "
<<
obs_sl
.
start_l
()
<<
" end_l = "
<<
obs_sl
.
end_l
();
<<
"curr_s = "
<<
curr_s
-
adc_frenet_frame_point_
.
s
()
<<
" start_s = "
<<
obs_sl
.
start_s
()
-
adc_frenet_frame_point_
.
s
()
<<
" end_s = "
<<
obs_sl
.
end_s
()
-
adc_frenet_frame_point_
.
s
()
<<
" start_l = "
<<
obs_sl
.
start_l
()
<<
" end_l = "
<<
obs_sl
.
end_l
();
ADEBUG
<<
"ADC width = "
<<
2.0
*
adc_half_width
;
*
fail_to_find_boundary
=
false
;
...
...
@@ -340,27 +338,29 @@ SidePassPathDecider::GetPathBoundaries(
side_pass_direction
=
obs_id_to_side_pass_dir
[
obstacle
->
Id
()];
if
(
side_pass_direction
==
SidePassDirection
::
LEFT
)
{
const
double
lower_bound
=
FLAGS_static_decision_nudge_l_buffer
+
obs_sl
.
end_l
();
const
double
lower_bound
=
FLAGS_static_decision_nudge_l_buffer
+
obs_sl
.
end_l
();
ADEBUG
<<
"Should pass from left. Lower bound = "
<<
lower_bound
;
if
(
std
::
get
<
2
>
(
lateral_bound
)
-
lower_bound
-
2.0
*
adc_half_width
-
kRoadBuffer
>=
0.0
)
{
kRoadBuffer
>=
0.0
)
{
ADEBUG
<<
"Reseting the right boundary for left-side-pass."
;
std
::
get
<
1
>
(
lateral_bound
)
=
lower_bound
+
adc_half_width
+
kObstacleLBuffer
;
std
::
get
<
1
>
(
lateral_bound
)
=
lower_bound
+
adc_half_width
+
kObstacleLBuffer
;
}
else
{
*
fail_to_find_boundary
=
true
;
break
;
}
}
else
{
const
double
upper_bound
=
-
FLAGS_static_decision_nudge_l_buffer
+
obs_sl
.
start_l
();
const
double
upper_bound
=
-
FLAGS_static_decision_nudge_l_buffer
+
obs_sl
.
start_l
();
ADEBUG
<<
"Should pass from right. Upper bound = "
<<
upper_bound
;
if
(
upper_bound
-
std
::
get
<
1
>
(
lateral_bound
)
-
2.0
*
adc_half_width
-
kRoadBuffer
>=
0.0
)
{
kRoadBuffer
>=
0.0
)
{
ADEBUG
<<
"Reseting the left boundary for right-side-pass."
;
std
::
get
<
2
>
(
lateral_bound
)
=
upper_bound
-
adc_half_width
-
kObstacleLBuffer
;
std
::
get
<
2
>
(
lateral_bound
)
=
upper_bound
-
adc_half_width
-
kObstacleLBuffer
;
}
else
{
*
fail_to_find_boundary
=
true
;
break
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录