2010 13th International Conference on Information Fusion 2010
DOI: 10.1109/icif.2010.5712010
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive ping control for track-holding in multistatic active sonar networks

Abstract: Distributed multistatic active sonar networks provide an Anti-Submarine Warfare capability against small, quiet, threat submarines in the harsh clutter-saturated littoral and deeper ocean environments. Adaptive ping control techniques provide the potential to significantly increase the multistatic network's performance, by pinging (in an optimum sense) the right source, at the right time, with the right waveform. This paper describes an automatic, adaptive ping control algorithm. It specifically addresses the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 6 publications
0
2
0
Order By: Relevance
“…In more recent studies, Angley et al (, ) develop efficient ping scheduling methodologies for multistatic sonars that seek to improve tracking performance. Some other studies that consider the ping scheduling problem for bistatic and multistatic sonar include Wakayama and Grimmett (), Wakayama, Zabinsky, and Grimmett (), and Suvorova, Morelande, Moran, Simakov, and Fletcher ().…”
Section: Related Workmentioning
confidence: 99%
“…In more recent studies, Angley et al (, ) develop efficient ping scheduling methodologies for multistatic sonars that seek to improve tracking performance. Some other studies that consider the ping scheduling problem for bistatic and multistatic sonar include Wakayama and Grimmett (), Wakayama, Zabinsky, and Grimmett (), and Suvorova, Morelande, Moran, Simakov, and Fletcher ().…”
Section: Related Workmentioning
confidence: 99%
“…Greedy scheduling algorithms define a reward for all possible actions a single step ahead and pick the action that maximises this reward. Significant work has since been undertaken to define new metrics for sensor scheduling using greedy algorithms [1,[6][7][8][9][10][11]. Greedy algorithms have the advantage of being computationally efficient, but can have issues effectively prioritising resources in complex multi-target scenarios, especially, as in this case, when conserving the battery power of the sonobuoys is important.…”
Section: Introductionmentioning
confidence: 99%