bradyz / 2020_CARLA_challenge

"Learning by Cheating" (CoRL 2019) submission for the 2020 CARLA Challenge
181 stars 49 forks source link

Not the exact same implementation as the original LBC code ? #15

Closed jrabary closed 3 years ago

jrabary commented 4 years ago

Hi,

I wondering whether this base code implements exactly the original LBC algorithm. When I look at it closely it seems that it doesn't use the branch selection based on command (follow lane, turn left, ...) Instead it seems to use the target points coordinates. Am I correct ?

bradyz commented 4 years ago

Correct! The conditional command here is a "target heatmap", which is the target point projected into the camera view. I found this to work a little better, but have yet to evaluate this quantitatively

jrabary commented 4 years ago

Thanks. Interesting result. I think there is less ambiguity when one use the target heatmap instead of the high level command. That may explain the performance gain if validated.

AIasd commented 4 years ago

Hi @bradyz can you explain a bit more about this target heatmap? I am really interested in knowing a bit more about it.

bradyz commented 4 years ago

So instead of using discrete commands, we render the project the future waypoint (this is typically pretty far, maybe 50 meters or so) into the first person view as a heatmap, then concatenate this to the RGB image.

AIasd commented 4 years ago

I see. This makes sense. Thank you for the quick response!