You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardexpand all lines: planning/behavior_path_dynamic_avoidance_module/README.md
+14-6
Original file line number
Diff line number
Diff line change
@@ -1,7 +1,9 @@
1
1
# Dynamic avoidance design
2
+
2
3
This module is under development.
3
4
4
5
## Purpose / Role
6
+
5
7
This module provides avoidance functions for vehicles, pedestrians, and obstacles in the vicinity of the ego's path in combination with the obstacle_avoidance module.
6
8
Each module performs the following roles.
7
9
Dynamic Avoidance module: This module cuts off the drivable area according to the position and velocity of the target to be avoided.
@@ -18,36 +20,40 @@ The table below lists the avoidance modules that can be used for each situation.
The inner algorithms can be separated into two parts: The first decide whether to avoid the obstacles and the second cuts off the drivable area against the corresponding obstacle.
23
26
If you are interested in more details, please see the code itself.
24
27
25
28
### Select obstacles to avoid
29
+
26
30
To decide whether to avoid an object, both the predicted path and the state (pose and twist) of each object are used.
27
31
The type of objects the user wants this module to avoid is also required.
28
-
Using this information, the module decides to *avoid* objects that *obstruct the ego's passage* and *can be avoided*.
32
+
Using this information, the module decides to _avoid_ objects that _obstruct the ego's passage_ and _can be avoided_.
29
33
30
-
The definition of *obstruct own passage* is implemented as the object that collides within seconds.
34
+
The definition of _obstruct own passage_ is implemented as the object that collides within seconds.
31
35
This process wastes computational cost by doing it for all objects; thus, filtering by the relative position and speed of the object with respect to the ego's path is also done as an auxiliary process.
32
-
The other, *can be avoided* denotes whether it can be avoided without risk to passengers or other vehicles.
36
+
The other, _can be avoided_ denotes whether it can be avoided without risk to passengers or other vehicles.
33
37
For this purpose, it is judged whether the obstacle can be avoided by satisfying the constraints of lateral acceleration and lateral jerk.
34
38
For example, the module decides not to avoid an object that is too close or fast in the lateral direction because it cannot be avoided.
35
39
36
40
### Cuts off the drivable area against the selected obstacles
41
+
37
42
For the selected obstacles to be avoided, the module cuts off the drivable area.
38
43
As inputs to decide the shapes of cut-off polygons, poses of the obstacles are mainly used, assuming they move in parallel to the ego's path, instead of its predicted path.
39
44
This design arises from that the predicted path of objects is not accurate enough to use the path modifications (at least currently).
40
45
Furthermore, the output drivable area shape is designed as a rectangular cutout along the ego's path to make the computation scalar rather than planar.
41
46
42
47
#### Determination of lateral dimension
48
+
43
49
Lateral dimensions of the polygon is calculated as follows.
44
50
The polygon's width to extract from the drivable area is the obstacle width and `drivable_area_generation.lat_offset_from_obstacle`.
45
51
We can limit the lateral shift length by `drivable_area_generation.max_lat_offset_to_avoid`.
Then, extracting the same directional and opposite directional obstacles from the drivable area will work as follows considering TTC (time to collision).
52
58
53
59
Regarding the same directional obstacles, obstacles whose TTC is negative will be ignored (e.g. The obstacle is in front of the ego, and the obstacle's velocity is larger than the ego's velocity.).
@@ -59,13 +65,13 @@ Opposite directional obstacles (Parameter names may differ from implementation)
0 commit comments