On-line Search in Two-Dimensional Environment

We consider the following on-line pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown network. Their goal is to execute a search strategy that guarantees capturing a fast and invisible intruder regardless of its movements using as few searchers...

Full description

Saved in:

Bibliographic Details
Published in:	Theory of computing systems Vol. 63; no. 8; pp. 1819 - 1848
Main Authors:	Dereniowski, Dariusz, Osula, Dorota
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.11.2019 Springer Nature B.V
Subjects:	Agents (artificial intelligence) Algorithms Computer Science Coordinates Lower bounds Nodes Search algorithms Special Issue on Approximation and Online Algorithms Strategy Theory of Computation Two dimensional models Connected search On-line searching Distributed searching Pursuit-evasion Partial grid
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!