Robust Lane Detection with Binary Integer Optimization
- 1 May 2020
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 229-235
Abstract
Formula Student Driverless (FSD) is a competition where student teams compete to build an autonomous racecar. The main dynamic event in FSD is trackdrive, where the racecar traverses an unknown track with lanes demarcated by cones. One major challenge of the event is to determine the boundaries of the lane from cones perceived online despite false positive cone detections and sharp turns. We present a binary integer optimization to address this problem by leveraging a priori knowledge from competition rules on parameters such as average cone spacings and minimum track width. In this paper, we describe our approach, and analyze its latency, accuracy, and robustness to false positive cone detections. This approach is used on-board to solve the lane detection problem during the competition in real-time.Keywords
This publication has 10 references indexed in Scilit:
- Towards End-to-End Lane Detection: an Instance Segmentation Approach2018
- The Fast Lane Detection of Road Using RANSAC Algorithm2017
- Recent progress in road and lane detection: a surveyMachine Vision and Applications, 2012
- Robust lane detection and tracking with ransac and Kalman filter2009
- Finding multiple lanes in urban road networks with vision and lidarAutonomous Robots, 2009
- An integrated, robust approach to lane marking detection and lane tracking2004
- Lane detection and tracking using B-SnakeImage and Vision Computing, 2004
- Convex Optimization2004
- Lane detection using spline modelPattern Recognition Letters, 2000
- The Mosek Interior Point Optimizer for Linear Programming: An Implementation of the Homogeneous Algorithm2000