Approaching a coalition of evaders
type: Item
instance of: scholarly article
title: Approaching a coalition of evaders
zbMATH Open document ID: 0625.90107
author: Igor I. Shevchenko
published in: Automation and Remote Control
publication date: 1986-01-01T00:00:00Z
review text: This paper studies a very simple model of conflict in which a pursuer approaches a coalition of evaders. The distance between the pursuer and the coalition is defined as the distance to the remotest evader. In the special case of two evaders, the optimal pursuit strategy is derived, as well as the guaranteed distance to the coalition. For the case of more than two evaders, an upper bound of this distance, which corresponds to a programmed method of selection of a pair of evaders being approached, is obtained.
Mathematics Subject Classification ID: 91A24
Mathematics Subject Classification ID: 91A23
Mathematics Subject Classification ID: 91A99
zbMATH DE Number: 4016645
zbMATH Keywords: pursuer
zbMATH Keywords: coalition of evaders
zbMATH Keywords: optimal pursuit strategy
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 4016645