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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theory of computing systems Jg. 63; H. 8; S. 1819 - 1848
Hauptverfasser:	Dereniowski, Dariusz, Osula, Dorota
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.11.2019 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!