Each stage does its business logic inside Process function.
If the stage want to transit to a different stage after finish, it should set the type of 'next_stage_'.
38 {
39 ADEBUG <<
"stage: Approach";
40 CHECK_NOTNULL(frame);
41
42 auto scenario_context = GetContextAs<YieldSignContext>();
43 scenario_config_.CopyFrom(scenario_context->scenario_config);
44
46 if (result.HasError()) {
47 AERROR <<
"YieldSignStageApproach planning error";
48 }
49
50 const auto& reference_line_info = frame->reference_line_info().front();
51
52 if (scenario_context->current_yield_sign_overlap_ids.empty()) {
54 }
55
56 for (const auto& yield_sign_overlap_id :
57 scenario_context->current_yield_sign_overlap_ids) {
58
59 PathOverlap* current_yield_sign_overlap =
60 reference_line_info.GetOverlapOnReferenceLine(
62 if (!current_yield_sign_overlap) {
63 continue;
64 }
65
66
67 reference_line_info.SetJunctionRightOfWay(
68 current_yield_sign_overlap->start_s, false);
69
70 static constexpr double kPassStopLineBuffer = 0.3;
71 const double adc_front_edge_s = reference_line_info.AdcSlBoundary().end_s();
72 const double distance_adc_pass_stop_sign =
73 adc_front_edge_s - current_yield_sign_overlap->start_s;
74 if (distance_adc_pass_stop_sign > kPassStopLineBuffer) {
75
76 return FinishStage();
77 }
78
79 const double distance_adc_to_stop_line =
80 current_yield_sign_overlap->start_s - adc_front_edge_s;
81 ADEBUG <<
"yield_sign_overlap_id[" << yield_sign_overlap_id <<
"] start_s["
82 << current_yield_sign_overlap->start_s
83 << "] distance_adc_to_stop_line[" << distance_adc_to_stop_line
84 << "]";
85 bool yield_sign_done = false;
86 if (distance_adc_to_stop_line <
88
89 yield_sign_done = true;
90 const auto& path_decision = reference_line_info.path_decision();
91 for (const auto* obstacle : path_decision.obstacles().Items()) {
92 const std::string& obstacle_id = obstacle->Id();
93 std::string obstacle_type_name =
94 PerceptionObstacle_Type_Name(obstacle->Perception().type());
95 ADEBUG <<
"yield_sign[" << yield_sign_overlap_id <<
"] obstacle_id["
96 << obstacle_id << "] type[" << obstacle_type_name << "]";
97 if (obstacle->IsVirtual()) {
98 continue;
99 }
100
101 if (obstacle->reference_line_st_boundary().IsEmpty()) {
102 continue;
103 }
104
105 static constexpr double kMinSTBoundaryT = 6.0;
106 if (obstacle->reference_line_st_boundary().min_t() > kMinSTBoundaryT) {
107 continue;
108 }
109 const double kepsilon = 1e-6;
110 double obstacle_traveled_s =
111 obstacle->reference_line_st_boundary().bottom_left_point().s() -
112 obstacle->reference_line_st_boundary().bottom_right_point().s();
113 ADEBUG <<
"obstacle[" << obstacle->Id() <<
"] obstacle_st_min_t["
114 << obstacle->reference_line_st_boundary().min_t()
115 << "] obstacle_st_min_s["
116 << obstacle->reference_line_st_boundary().min_s()
117 << "] obstacle_traveled_s[" << obstacle_traveled_s << "]";
118
119
120
121
122 static constexpr double kIgnoreMaxSTMinT = 0.1;
123
124 static constexpr double kIgnoreMinSTMinS = 15.0;
125 if (obstacle_traveled_s < kepsilon &&
126 obstacle->reference_line_st_boundary().min_t() < kIgnoreMaxSTMinT &&
127 obstacle->reference_line_st_boundary().min_s() > kIgnoreMinSTMinS) {
128 continue;
129 }
130
132 ->mutable_planning_status()
133 ->mutable_yield_sign()
134 ->add_wait_for_obstacle_id(obstacle->Id());
135
136 yield_sign_done = false;
137 }
138 }
139
140 if (yield_sign_done) {
141 return FinishStage();
142 }
143 }
144
146}
virtual StageResult FinishScenario()
std::shared_ptr< DependencyInjector > injector_
StageResult ExecuteTaskOnReferenceLine(const common::TrajectoryPoint &planning_start_point, Frame *frame)
optional double max_valid_stop_distance