As deployment of automated vehicles increases, so does the rate at which they are exposed to critical traffic situations. Such situations, e.g. a late detected pedestrian in the vehicle path, require operation at the handling limits in order to maximize the capacity to avoid an accident. Also, the physical limitations of the vehicle typically vary in time due to local road and weather conditions. In this paper, we tackle the problem of trajectory planning and control at the limits of handling under time varying constraints, by adapting to local traction limitations. The proposed method is based on Real Time Iteration Sequential Quadratic Programming (RTI-SQP) augmented with state space sampling, which we call Sampling Augmented Adaptive RTI-SQP (SAA-SQP). Through extensive numerical simulations we demonstrate that our method increases the vehicle's capacity to avoid late detected obstacles compared to the traditional planning tracking approaches, as a direct consequence of safe operating constraint adaptation in real time.
The minimum-lap-time optimal control problem for a Formula One race car is solved using direct transcription and nonlinear programming. Features of this work include significantly reduced full-lap solution times and the simultaneous optimisation of the driven line, the driver controls and multiple car set-up parameters. It is shown that significant reductions in the driven lap time can be obtained from track-specific set-up parameter optimisation. Reduced computing times are achieved using a combination of a track description based on curvilinear coordinates, analytical derivatives and model non-dimensionalisation. The curvature of the track centre line is found by solving an auxiliary optimal control problem that negates the difficulties associated with integration drift and trajectory closure. The problem of maneuvering a vehicle through a race course in minimum time requires computation of both longitudinal (brake and throttle) and lateral (steering wheel) control inputs. Unfortunately, solving the resulting nonlinear optimal control problem is typically computationally expensive and infeasible for real-time trajectory planning. This paper presents an iterative algorithm that divides the path generation task into two sequential subproblems that are significantly easier to solve. Given an initial path through the race track, the algorithm runs a forward-backward integration scheme to determine the minimum-time longitudinal speed profile, subject to tire friction constraints. With this fixed speed profile, the algorithm updates the vehicle's path by solving a convex optimization problem that minimizes the resulting path curvature while staying within track boundaries and obeying affine, time-varying vehicle dynamics constraints. This two-step process is repeated iteratively until the predicted lap time no longer improves. While providing no guarantees of convergence or a globally optimal solution, the approach performs very well when validated on the Thunderhill Raceway course in Willows, CA. The predicted lap time converges after four to five iterations, with each iteration over the full 4.5 km race course requiring only thirty seconds of computation time on a laptop computer. The resulting trajectory is experimentally driven at the race circuit with an autonomous Audi TTS test vehicle, and the resulting lap time and racing line is comparable to both a nonlinear gradient descent solution and a trajectory recorded from a professional racecar driver. The experimental results indicate that the proposed method is a viable option for online trajectory planning in the near future.