A Critical Scenario Search Method for Intelligent Vehicle Testing Based on the Social Cognitive Optimization Algorithm

Intelligent vehicle testing has been a hotspot in the field of intelligent vehicles. Due to the multi-dimensional parameters and the continuity of testing scenarios, a complete test of all scenarios requires a large amount of manpower and several material resources. In critical scenarios, deficiencies in an intelligent vehicle’s performance and defects of an algorithm can be exposed. Therefore, increasing the search efficiency and coverage of critical scenarios is key in improving scenario-based intelligent vehicle testing technology. In this study, a critical scenario search method for intelligent vehicle testing based on the social cognitive optimization (SCO) algorithm is proposed. This method has two main parts: global search and local search. The global search, based on the modified SCO algorithm, integrates the density peak clustering (DPC) algorithm and the cooling scheduling function, and aims to find all local aggregation areas of critical scenarios in a logical scenario space. The local search applies a multi-dimensional convolution algorithm to the global search results to find critical scenarios near the local aggregation areas. Finally, a longitudinal automatic driving algorithm is tested using the proposed method under a specified logical scenario in a simulation environment. The test results show that the proposed method can improve both the search efficiency and coverage of critical scenarios.