TY - JOUR
ID - 3819
TI - Heuristic artificial bee colony algorithm for solving the Homicidal Chauffeur differential game
JO - AUT Journal of Mathematics and Computing
JA - AJMC
LA - en
SN - 2783-2449
AU - Yazdaniyan, Zahra
AU - Shamsi, M.
AU - de Pinho, Maria do Rosario
AU - Foroozandeh, Z.
AD - Department of Applied Mathematics, Faculty of Mathematics and Computer Science, Amirkabir University of Technology, Tehran,
Iran
AD - Department of Electrical and Computer Engineering, SYSTEC, Faculdade de Engenharia, Universidade do Porto, 4200-465, Porto,
Portugal
AD - Department of Electrical and Computer Engineering, SYSTEC, Faculdade de Engenharia, Universidade do Porto, 4200-465, Porto, Portugal
Y1 - 2020
PY - 2020
VL - 1
IS - 2
SP - 153
EP - 163
KW - Differential game
KW - Saddle point solution
KW - Artificial bee colony
KW - Bilevel optimal control
DO - 10.22060/ajmc.2019.16949.1025
N2 - 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.
UR - https://ajmc.aut.ac.ir/article_3819.html
L1 - https://ajmc.aut.ac.ir/article_3819_fdcb2c008ac0793b7223b186013285d5.pdf
ER -