Real-World Application of Various Trajectory Planning Algorithms on MIT RACECAR
Oguzhan Kose

TL;DR
This study compares DWA, TEB, and APF trajectory planning algorithms on MIT RACECAR, evaluating their obstacle avoidance, route simplicity, and computational efficiency in a lane-following scenario with obstacle avoidance.
Contribution
The paper implements and compares three trajectory planning algorithms on a real vehicle, highlighting APF's advantages in computational efficiency and simplicity for real-world applications.
Findings
APF had the lowest computational load.
APF successfully navigated obstacles with simpler logic.
DWA and TEB showed different strengths in obstacle handling.
Abstract
In the project, the vehicle was first controlled with ROS. For this purpose, the necessary nodes were prepared to be controlled with a joystick. Afterwards, DWA(Dynamic Window Approach), TEB(Timed-Elastic Band) and APF(Artificial Potential Field) path planning algorithms were applied to MIT RACECAR, respectively. These algorithms have advantages and disadvantages against each other on different issues. For this reason, a scenario was created to compare algorithms. On a curved double lane road created according to this scenario, MIT RACECAR has to follow the lanes and when it encounters an obstacle, it has to change lanes without leaving the road and pass without hitting the obstacle. In addition, an image processing algorithm was developed to obtain the position information of the lanes needed to implement this scenario. This algorithm detects the target point by processing the image…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms · Robotics and Sensor-Based Localization · Autonomous Vehicle Technology and Safety
