2012
DOI: 10.1109/tcst.2011.2130526
|View full text |Cite
|
Sign up to set email alerts
|

A Matching Pursuit Algorithm Approach to Chaser-Target Formation Flying Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
5
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 5 publications
0
5
0
Order By: Relevance
“…Besides applied to missile control, the algorithm is applied to the mobile robot is done by Dias et al [14]. Besides apply in the aircraft, the algorithm is examined by Massioni et al, [15] used in pursuing agent for formation. 2865 This paper presents pursuit algorithm which has been previously mentioned by the researchers to be applied to the trash can robots that is able to pursue and pick up garbage that has fallen on floor.…”
Section: Pursuit Algorithmmentioning
confidence: 99%
“…Besides applied to missile control, the algorithm is applied to the mobile robot is done by Dias et al [14]. Besides apply in the aircraft, the algorithm is examined by Massioni et al, [15] used in pursuing agent for formation. 2865 This paper presents pursuit algorithm which has been previously mentioned by the researchers to be applied to the trash can robots that is able to pursue and pick up garbage that has fallen on floor.…”
Section: Pursuit Algorithmmentioning
confidence: 99%
“…Besides applied to missile control, the algorithm is applied to the mobile robot is done by Dias et al [14]. Besides apply in the aircraft, the algorithm is examined by Massioni et al, [15] used in pursuing agent for formation.…”
Section: Pursuit Algorithmmentioning
confidence: 99%
“…It turns out that in the case of orthogonal vectoring, fuel consumption is directly proportional to the ℓ 1 norm of the control sequence and the ℓ 2 /ℓ 1 norm in the case of thrust vectoring [5,6]. The authors of [7] use matching pursuit and orthogonal matching pursuit algorithms to generate (approximations) of the sparsest control sequences (that is, control sequences comprised of the smallest possible number of non-zero elements) which will keep the output tracking error within certain bounds for a given reference signal. The approach in [7] requires that a reference trajectory is known and in addition, the terminal time is assumed to be free.…”
Section: Introductionmentioning
confidence: 99%
“…The authors of [7] use matching pursuit and orthogonal matching pursuit algorithms to generate (approximations) of the sparsest control sequences (that is, control sequences comprised of the smallest possible number of non-zero elements) which will keep the output tracking error within certain bounds for a given reference signal. The approach in [7] requires that a reference trajectory is known and in addition, the terminal time is assumed to be free. Numerical methods that are based on the primer vector theory are presented in [8][9][10].…”
Section: Introductionmentioning
confidence: 99%