FTC Programming: Pure Pursuit Tutorial 3

preview_player
Показать описание
Shows how to write a circle and line segment intersection algorithm.

Music: Madeon - Shuriken

CORRECTIONS: Time 13:34 - This should read linePoint1.x "less than" linePoint2.x ? linePoint1.x : linePoint2.x
Same fix for the following line.
Рекомендации по теме
Комментарии
Автор

Useful tutorial on pure pursuit. Considering this video is from 4 years ago and there have been many developments on the roadrunner side, are there still reasons to learn and explore pure pursuit? how is this better that RR or under what circumstances would we consider PP over RR?

SSR_FTC
Автор

I'm a little confused about the problem at 4:10 where it requires an int but found a double. Can anyone explain that to me and the best way to fix it?

nathanwessel
Автор

Instead of throwing an ArithmeticException, Math.sqrt would return NaN for any negative input

michaelpeng
Автор

how would you upload this code to an actual FTC robot?

sanbot
Автор

How are you using the add method when it requires ints but you used doubles. Because I tried that, and it gave me errors.

akhilsamavedam
Автор

smh used Symbolab for a complex math problem no one wants to do therefore must be mentorbuilt

useewhynot
join shbcf.ru