提交 3a1ba246 编写于 作者: K kechxu 提交者: Jiangtao Hu

Planning: adjust for-loop to reach interval end point in qp_frenet_frame.cc

上级 9b54a28c
......@@ -217,8 +217,8 @@ bool QpFrenetFrame::MapDynamicObstacleWithDecision(
std::pair<uint32_t, uint32_t> update_index_range =
FindInterval(updated_start_s, updated_end_s);
for (uint32_t j = update_index_range.first; j < update_index_range.second;
++j) {
for (uint32_t j = update_index_range.first;
j <= update_index_range.second; ++j) {
dynamic_obstacle_bound_[j].first =
std::max(bound.first, dynamic_obstacle_bound_[j].first);
dynamic_obstacle_bound_[j].second =
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册