• Journal of Korea Society of Industrial Information Systems
• /
• v.29 no.4
• /
• pp.67-76
• /
• 2024

In this study, we address the problem of target detection using multiple agents. Specifically, the detection problem involving mobile agents necessitates additional strategies for path planning. The objective is to maximize the total utility derived from the detection process over a specific period. This detection problem incorporates realistic utility values by considering a stochastic process based on the Poisson process, which accounts for the changing probability of target event occurrence over time. The objective function is nonlinear and is classified as an NP-hard problem. To identify an effective solution within an efficient computation time, this study demonstrates that the objective function possesses the characteristic of submodularity. Using this property, we propose a heuristic algorithm designed to obtain a reasonable strategy with relatively low computational time. The proposed algorithm shows solution performance and the ability to generate solutions within an appropriate computation time through theoretical and experimental results.