This line is at the condition that i equals to 0, it sets dubinsNodes[0]'s predecessor as start node. However, checking dubinsNodes[0] == start would get true, which means the first dubin node will equal to is predecessor, and it brings node duplication at the connection of dubinShot and regular search.
(I am using these node results for velocity profile generation, thus duplicated node definitely affect the angle calculation)
https://github.com/karlkurzer/path_planner/blob/524a4894d3dab99fc85906ff4d9c0bea777319ab/src/algorithm.cpp#L493
This line is at the condition that
i
equals to 0, it setsdubinsNodes[0]
's predecessor as start node. However, checkingdubinsNodes[0] == start
would gettrue
, which means the first dubin node will equal to is predecessor, and it brings node duplication at the connection of dubinShot and regular search.(I am using these node results for velocity profile generation, thus duplicated node definitely affect the angle calculation)