2023
DOI: 10.1051/e3sconf/202337105075
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic programming methods for modelling the target distribution matrix in pursuit tasks

Abstract: In this paper we consider modelling a matrix describing the process of group pursuit for a set of goals. The matrix reflects the number of opposing parties, namely the number of pursuers and the number of goals. Each cell of such matrix is a structured variable, which contains information about predicted time of jth target achievement by ith pursuer. From the finite set of pursuers distribution by aims, the one which provides minimal value of criterion among permissible values of times of achievement of aims b… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 3 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?