2011
DOI: 10.3182/20110828-6-it-1002.00797
|View full text |Cite
|
Sign up to set email alerts
|

Numerical Study of Two-on-One Pursuit-Evasion Game

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 13 publications
0
1
0
Order By: Relevance
“…The game of degree was addressed in [57], [58] by employing the following payoff functional: the distance between the object being pursued and the pursuer closest to it, when a fixed-time engagement terminates. The paper [59] considered the three-player game in detail by briefly discussing the surfaces of the differential game when pursuers were both stronger, both weaker, and one stronger-one-weaker than the evader. The authors of [60] studied the case where faster pursuers cooperate to capture a slower evader in minimum time.…”
Section: B N Pursuers 1 Evader (Nv1)mentioning
confidence: 99%
“…The game of degree was addressed in [57], [58] by employing the following payoff functional: the distance between the object being pursued and the pursuer closest to it, when a fixed-time engagement terminates. The paper [59] considered the three-player game in detail by briefly discussing the surfaces of the differential game when pursuers were both stronger, both weaker, and one stronger-one-weaker than the evader. The authors of [60] studied the case where faster pursuers cooperate to capture a slower evader in minimum time.…”
Section: B N Pursuers 1 Evader (Nv1)mentioning
confidence: 99%