LACART: Lookahead-Augmented Collision Avoidance and Reference Tracking Strategies for Safety-Critical Robots
Overview
This research introduces LACART, a method integrating lookahead-based control barrier functions, relaxed control Lyapunov functions, and quadratic programming to enhance collision avoidance and reference tracking for autonomous racing. The approach handles circular obstacles and track boundaries within a unified optimization framework. Comparative simulations indicate similar full-track paths with reduced median computation times (0.31 ms per step vs. 0.33 ms) compared to Huang et al., and a 1:43-scale vehicle demonstration achieved a 25 Hz control rate using camera-based estimation and wireless actuation.
Generated from attributed reports · Updated 2 days ago
Event evidence and corrections
0 attributed source owners. Ownership does not establish independent confirmation. Quantities are reported separately and are never added together.
Environment: simulation
“for obstacle avoidance and reference tracking. The method handles circular obstacles and track boundaries in a common optimisation layer. Comparative simulation results against Huang \emph{et al.} \cite{r9} show similar full-track paths and lower median computation times: 0.31 versus 0.33 ms per step and 0.023 versus 0.025 ms per QP solve. The dissertation further demonstrates a 1:43-scale vehicle with camera-based”
Exact source · revision 1Source owner not reported
Control: reported autonomous
“arXiv:2611.09640v1 Announce Type: new Abstract: Autonomous racing provides a demanding testbed for collision avoidance under tight geometric and computational constraints. Building on a recent conference contribution and a master's dissertation, LACART combines lookahead-based control barrier functions (CBFs), a relaxed control Lyapunov function (CLF), and quadratic programming (QP) to modify nominal vehicle commands”
Exact source · revision 1Source owner not reported
Reported quantity · computation time per step: 0.31 other · Basis not reported
“for obstacle avoidance and reference tracking. The method handles circular obstacles and track boundaries in a common optimisation layer. Comparative simulation results against Huang \emph{et al.} \cite{r9} show similar full-track paths and lower median computation times: 0.31 versus 0.33 ms per step and 0.023 versus 0.025 ms per QP solve. The dissertation further demonstrates a 1:43-scale vehicle with camera-based”
Exact source · revision 1Source owner not reported
Reported quantity · computation time per QP solve: 0.023 other · Basis not reported
“for obstacle avoidance and reference tracking. The method handles circular obstacles and track boundaries in a common optimisation layer. Comparative simulation results against Huang \emph{et al.} \cite{r9} show similar full-track paths and lower median computation times: 0.31 versus 0.33 ms per step and 0.023 versus 0.025 ms per QP solve. The dissertation further demonstrates a 1:43-scale vehicle with camera-based”
Exact source · revision 1Source owner not reported
Reported quantity · control rate: 25 other · Basis not reported
“estimation and wireless actuation at a reported 25 Hz control rate. We identify the conditions linking lookahead-point clearance to body clearance, illustrate hardware limitations, and propose a recorded demonstration of safety intervention and recovery. The contribution targets ground-robot collision avoidance and real-time safety monitoring.”
Exact source · revision 1Source owner not reported
Report timeline
Follow attributed reports and material updates.
- arXiv Robotics — research abstractsSignalLACART: Lookahead-Augmented Collision Avoidance and Reference Tracking Strategies for Safety-Critical Robots
This research introduces LACART, a method integrating lookahead-based control barrier functions, relaxed control Lyapunov functions, and quadratic programming to enhance collision avoidance and reference tracking for autonomous racing. The approach handles circular obstacles and track boundaries within a unified optimization framework. Comparative simulations indicate similar full-track paths with reduced median computation times (0.31 ms per step vs. 0.33 ms) compared to Huang et al., and a 1:43-scale vehicle demonstration achieved a 25 Hz control rate using camera-based estimation and wireless actuation.
Event coverage history
Current attention 3·Peak within the comparable range 4（2026-11-10 11:00 UTC）·Change within the comparable range over 24 hours –
The trend compares participants observed continuously; its scope may be narrower than current attention totals. Hover or click to explore hourly observations, or use the left and right arrow keys.
Timezone · UTC
Article dates follow your selected timezone. Briefing editions use Hong Kong time (UTC+8).