AIAA Scitech 2019 Forum 2019
DOI: 10.2514/6.2019-0388
|View full text |Cite
|
Sign up to set email alerts
|

Coordinating Defender Path Planning for Optimal Target-Attacker-Defender Game

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…In [28], the approach does not require perfect knowledge of the states as the agents estimate through the range and heading measurements using an EKF. Manyam et al [29] presented a path planning problem modeled as a TAD game, involving two cooperative agents in an adversarial environment. The second vehicle helps the first vehicle complete a mission by defending against any attackers along the path.…”
Section: Introductionmentioning
confidence: 99%
“…In [28], the approach does not require perfect knowledge of the states as the agents estimate through the range and heading measurements using an EKF. Manyam et al [29] presented a path planning problem modeled as a TAD game, involving two cooperative agents in an adversarial environment. The second vehicle helps the first vehicle complete a mission by defending against any attackers along the path.…”
Section: Introductionmentioning
confidence: 99%