Dwell Time Allocation Algorithm for Multiple Target Tracking in LPI Radar Network Based on Cooperative Game.
Uloženo v:
| Název: | Dwell Time Allocation Algorithm for Multiple Target Tracking in LPI Radar Network Based on Cooperative Game. |
|---|---|
| Autoři: | Xue, Chenyan, Wang, Ling, Zhu, Daiyin |
| Zdroj: | Sensors (14248220); Oct2020, Vol. 20 Issue 20, p5944, 1p |
| Témata: | MULTIPLE target tracking, TIME management, TRACKING radar, ALGORITHMS, COOPERATIVE game theory |
| Abstrakt: | To solve the problem of dwell time management for multiple target tracking in Low Probability of Intercept (LPI) radar network, a Nash bargaining solution (NBS) dwell time allocation algorithm based on cooperative game theory is proposed. This algorithm can achieve the desired low interception performance by optimizing the allocation of the dwell time of each radar under the constraints of the given target detection performance, minimizing the total dwell time of radar network. By introducing two variables, dwell time and target allocation indicators, we decompose the dwell time and target allocation into two subproblems. Firstly, combining the Lagrange relaxation algorithm with the Newton iteration method, we derive the iterative formula for the dwell time of each radar. The dwell time allocation of the radars corresponding to each target is obtained. Secondly, we use the fixed Hungarian algorithm to determine the target allocation scheme based on the dwell time allocation results. Simulation results show that the proposed algorithm can effectively reduce the total dwell time of the radar network, and hence, improve the LPI performance. [ABSTRACT FROM AUTHOR] |
| Copyright of Sensors (14248220) is the property of MDPI and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Databáze: | Complementary Index |
| FullText | Text: Availability: 0 CustomLinks: – Url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?cmd=search&db=pmc&term=1424-8220[TA]+AND+5944[PG]+AND+2020[PDAT] Name: FREE - PubMed Central (ISSN based link) Category: fullText Text: Full Text Icon: https://imageserver.ebscohost.com/NetImages/iconPdf.gif MouseOverText: Check this PubMed for the article full text. – Url: https://resolver.ebscohost.com/openurl?sid=EBSCO:edb&genre=article&issn=14248220&ISBN=&volume=20&issue=20&date=20201015&spage=5944&pages=5944-5944&title=Sensors (14248220)&atitle=Dwell%20Time%20Allocation%20Algorithm%20for%20Multiple%20Target%20Tracking%20in%20LPI%20Radar%20Network%20Based%20on%20Cooperative%20Game.&aulast=Xue%2C%20Chenyan&id=DOI:10.3390/s20205944 Name: Full Text Finder Category: fullText Text: Full Text Finder Icon: https://imageserver.ebscohost.com/branding/images/FTF.gif MouseOverText: Full Text Finder – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Xue%20C Name: ISI Category: fullText Text: Nájsť tento článok vo Web of Science Icon: https://imagesrvr.epnet.com/ls/20docs.gif MouseOverText: Nájsť tento článok vo Web of Science |
|---|---|
| Header | DbId: edb DbLabel: Complementary Index An: 147000751 RelevancyScore: 790 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 789.61962890625 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Dwell Time Allocation Algorithm for Multiple Target Tracking in LPI Radar Network Based on Cooperative Game. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Xue%2C+Chenyan%22">Xue, Chenyan</searchLink><br /><searchLink fieldCode="AR" term="%22Wang%2C+Ling%22">Wang, Ling</searchLink><br /><searchLink fieldCode="AR" term="%22Zhu%2C+Daiyin%22">Zhu, Daiyin</searchLink> – Name: TitleSource Label: Source Group: Src Data: Sensors (14248220); Oct2020, Vol. 20 Issue 20, p5944, 1p – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22MULTIPLE+target+tracking%22">MULTIPLE target tracking</searchLink><br /><searchLink fieldCode="DE" term="%22TIME+management%22">TIME management</searchLink><br /><searchLink fieldCode="DE" term="%22TRACKING+radar%22">TRACKING radar</searchLink><br /><searchLink fieldCode="DE" term="%22ALGORITHMS%22">ALGORITHMS</searchLink><br /><searchLink fieldCode="DE" term="%22COOPERATIVE+game+theory%22">COOPERATIVE game theory</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: To solve the problem of dwell time management for multiple target tracking in Low Probability of Intercept (LPI) radar network, a Nash bargaining solution (NBS) dwell time allocation algorithm based on cooperative game theory is proposed. This algorithm can achieve the desired low interception performance by optimizing the allocation of the dwell time of each radar under the constraints of the given target detection performance, minimizing the total dwell time of radar network. By introducing two variables, dwell time and target allocation indicators, we decompose the dwell time and target allocation into two subproblems. Firstly, combining the Lagrange relaxation algorithm with the Newton iteration method, we derive the iterative formula for the dwell time of each radar. The dwell time allocation of the radars corresponding to each target is obtained. Secondly, we use the fixed Hungarian algorithm to determine the target allocation scheme based on the dwell time allocation results. Simulation results show that the proposed algorithm can effectively reduce the total dwell time of the radar network, and hence, improve the LPI performance. [ABSTRACT FROM AUTHOR] – Name: Abstract Label: Group: Ab Data: <i>Copyright of Sensors (14248220) is the property of MDPI and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edb&AN=147000751 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.3390/s20205944 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 1 StartPage: 5944 Subjects: – SubjectFull: MULTIPLE target tracking Type: general – SubjectFull: TIME management Type: general – SubjectFull: TRACKING radar Type: general – SubjectFull: ALGORITHMS Type: general – SubjectFull: COOPERATIVE game theory Type: general Titles: – TitleFull: Dwell Time Allocation Algorithm for Multiple Target Tracking in LPI Radar Network Based on Cooperative Game. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Xue, Chenyan – PersonEntity: Name: NameFull: Wang, Ling – PersonEntity: Name: NameFull: Zhu, Daiyin IsPartOfRelationships: – BibEntity: Dates: – D: 15 M: 10 Text: Oct2020 Type: published Y: 2020 Identifiers: – Type: issn-print Value: 14248220 Numbering: – Type: volume Value: 20 – Type: issue Value: 20 Titles: – TitleFull: Sensors (14248220) Type: main |
| ResultId | 1 |
Full Text Finder
Nájsť tento článok vo Web of Science