A Game-Theoretic Kendall’s Coefficient Weighting Framework for Evaluating Autonomous Path Planning Intelligence
Zewei Dong, Jingxuan Yang, Runze Yuan, Guangzhen Su, Lei Ming · Automation · 2025
Accurately evaluating the intelligence of autonomous path planning remains challenging, primarily due to the interdependencies among evaluation metrics and the insufficient integration of subjective and objective weighting methods. This paper proposes Game-Theoretic Kendall’s Coefficient (GTKC) weighting framework for evaluating autonomous path planning intelligence. The framework specifies a safety–efficiency–comfort metric system with observable, reproducible, and quantifiable metrics. To account for intermetric dependence, subjective weights are elicited via an improved Analytic Network Process (ANP), while objective weights are derived using the CRITIC method to capture contrast intensity and intercriteria conflict. The credibility of the subjective and objective weights is evaluated using Kendall’s coefficient and the coefficient of variation, respectively. Subsequently, based on the principle that higher credibility should receive greater weight, a game-theoretic optimization model is employed to dynamically derive optimal combination coefficients. Experimental results on three case scenarios demonstrate that the GTKC framework significantly outperforms existing weighting approaches in terms of effectiveness (achieving a lowest Mean Absolute Error (MAE) of 0.15 and a perfect Spearman’s correlation coefficient (ρ¯=1.0) with ground-truth rankings), stability (Mean Standard Deviation (MSD) = 0.023), and ranking consistency (Kendall’s coefficient W = 0.924). These findings validate GTKC as a theoretically grounded and practically robust mechanism that explicitly models metric interdependencies and integrates expert knowledge with empirical evidence, enabling reliable and reproducible evaluation of autonomous path planning intelligence.