The task of automated intruder detection and interception is often considered as a suitable application for groups of mobile robots. Realistic versions of the problem include representing uncertainty, which turns it into NP-hard optimization tasks. In this paper we define the problem of indoor intruder interception with probabilistic intruder motion model and uncertainty of intruder detection. We define a model for representing the problem and propose an algorithm for optimizing plans for groups of mobile robots patrolling the building. The proposed evolutionary multi-agent algorithm uses a novel representation of solutions. The algorithm has been evaluated using different problem sizes and compared with other methods.
CITATION STYLE
Turek, W., Kubiczek, A., & Byrski, A. (2019). Evolutionary Optimization of Intruder Interception Plans for Mobile Robot Groups. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11536 LNCS, pp. 642–655). Springer Verlag. https://doi.org/10.1007/978-3-030-22734-0_47
Mendeley helps you to discover research relevant for your work.