Covariance matrix adaptation evolution strategy based on ensemble of mutations for parking navigation and maneuver of autonomous vehicles

Abstract

Previous works have demonstrated the use of human-inspired frameworks to address autonomous vehicle parking. In such frameworks, autonomous vehicle parking is formulated as a two-stage optimization problem where the first stage involves the generation of initial waypoints which are consequently used to reduce the autonomous parking task into a local motion planning task. In the second stage, the local motion planning is solved as a classical optimization problem. However, the overall algorithmic performance in the second stage depends on the planning horizon used to formulate the local planning task. In this work, we show first that the state-of-the-art algorithms often employed in the second stage fail with an increase in the planning horizon. Motivated by the need for algorithms that are scalable to different planning horizons, this work proposes Covariance Matrix Adaptation Evolution Strategy (CMA-ES) with an ensemble of mutations for the second stage. Specifically, the proposed algorithm features an ensemble of Gaussian- and Cauchy-based mutations to facilitate an efficient blend of both exploitation and exploration that is crucial for both short and long horizons. Furthermore, to handle the associated constraints, Superiority of Feasible (SF) constraint handling technique is incorporated into the proposed algorithm. Performance analysis based on 24 parking missions conducted with planning horizons of 2 and 4 shows that the proposed algorithm is scalable to different planning horizons compared with three commonly employed state-of-the-art algorithms.