A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Busca Hill-Climbing Modificada aplicada à Observação de Alvos Cooperativos (CTO) movendo-se sobre um Grafo Planar
2020
Anais do Computer on the Beach
ABSTRACTIn the Cooperative Targets Observation (CTO) problem, a groupof observing agents with limited vision should be commanded inorder to keep the observation of multiple target agents in motion inorder to maximize the average number of targets observed duringthe period under consideration. Targets are cooperative in the sensethat they do not run away from observers. This article describes andevaluates the application of a modified Hill-Climbing algorithm tothe CTO problem when the movement
doi:10.14210/cotb.v11n1.p345-350
fatcat:g63l3iqixja27k753nscqkwhty