This paper considers a problem of planning an attack in robotic football (RoboCup). The problem is reduced to finding a trajectory of the ball from its current position to the opponents goals. Heuristic search algorithm, i.e. A*, is used to find such a trajectory. For this algorithm to be applicable we introduce a discretized model of the environment, i.e. a graph, as well as the core search components: cost function and heuristic function. Both are designed to take into account all the available information of the game state. We extensively evaluate the suggested approach in simulation comparing it to a range of baselines. The result of the conducted evaluation clearly shows the benefit of utilizing heuristic search within the RoboCup context.
DOI: 10.1007/978-3-030-60337-3_15
Скачать сборник (PDF) или читать онлайн на Springer Nature (англ.): https://link.springer.com/chapter/10.1007/978-3-030-60337-3_15
Скачать статью (PDF) на arXiv.org (англ.): https://arxiv.org/pdf/2008.00851
ResearchGate: https://www.researchgate.net/publication/343414463_Planning_to_Score_a_Goal_in_Robotic_Football_with_Heuristic_Search
Khokhlov, I., Litvinenko, V., Ryakin, I., Yakovlev, K. (2020). Planning to Score a Goal in Robotic Football with Heuristic Search // In: Ronzhin, A., Rigoll, G., Meshcheryakov, R. (eds) Interactive Collaborative Robotics. ICR 2020. Lecture Notes in Computer Science, Vol. 12336, pp. 148–159.