Title of article :
Heuristic artificial bee colony algorithm for solving the Homicidal Chauffeur differential game
Author/Authors :
Yazdaniyan, Zahra Department of Applied Mathematics - Faculty of Mathematics and Computer Science - Amirkabir University of Technology, Tehran, Iran , Shamsi, Mostafa Department of Mathematics and Computer Science - Amirkabir University of Technology , Rosario de Pinho, Maria do Department of Electrical and Computer Engineering - Faculdade de Engenharia - Universidade do Porto, Porto, Portugal , Foroozandeh, Zahra Department of Electrical and Computer Engineering - Faculdade de Engenharia - Universidade do Porto, Porto, Portugal
Pages :
11
From page :
153
To page :
163
Abstract :
In this paper, we consider the Homicidal Chauffeur (HC) problem as an interesting and practical differential game. At first, we introduce a bilevel optimal control problem (BOCP) and prove that a saddle point solution for this game exists if and only if this BOCP has an optimal solution in which the optimal value of the objective function is equal to 1. Then, BOCP is discretized and converted to a nonlinear bilevel programming problem. Finally, an Artificial Bee Colony (ABC) algorithm is used for solving this problem, in which the lower-level problem will be considered as a constraint and solved by an NLP-solver. Finally, to demonstrate the effectiveness of the presented method, various cases of HC problem are solved and the simulation results are reported.
Keywords :
Differential game , Saddle point solution , Artificial bee colony , Bilevel optimal control
Journal title :
AUT Journal of Mathematics and Computing
Serial Year :
2020
Record number :
2714534
Link To Document :
بازگشت