Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2020 Jun 8;22(6):635.
doi: 10.3390/e22060635.

Intermittent Information-Driven Multi-Agent Area-Restricted Search

Affiliations

Intermittent Information-Driven Multi-Agent Area-Restricted Search

Branko Ristic et al. Entropy (Basel). .

Abstract

The problem is a two-dimensional area-restricted search for a target using a coordinated team of autonomous mobile sensing platforms (agents). Sensing is characterised by a range-dependent probability of detection, with a non-zero probability of false alarms. The context is underwater surveillance using a swarm of amphibious drones equipped with active sonars. The paper develops an intermittent information-driven search strategy, which alternates between two phases: the fast and non-receptive displacement phase (called the ballistic phase) with a slow displacement and sensing phase (called the diffusive phase). The proposed multi-agent search strategy is carried out in a decentralised manner, which means that all computations (estimation and motion control) are done locally. Coordination of agents is achieved by exchanging the data with the neighbours only, in a manner which does not require global knowledge of the communication network topology.

Keywords: autonomous search; decentralised control; infotaxis; multi-agent system.

PubMed Disclaimer

Conflict of interest statement

The authors declare no conflict of interest.

Figures

Figure 1
Figure 1
A team of 13 searching agents connected with different communication networks: (a) Rmax=1.1d; and (b) Rmax=2d. d is the smallest distance between the agents. Both communication graphs are connected.
Figure 2
Figure 2
Illustration of the evolution of the POM over time: (a) k=0; (b) k=10; and (c) k=38. The multi-agent formation graph is shown in Figure 1a.
Figure 2
Figure 2
Illustration of the evolution of the POM over time: (a) k=0; (b) k=10; and (c) k=38. The multi-agent formation graph is shown in Figure 1a.
Figure 3
Figure 3
An illustrative run with S=5 agents: (a) a top-down view of the search area and agents’ paths up to k=375; (b) the estimated POM of agent number 1 at k=375 (the shades of gray indicate the value of probability); (c) entropy Hk as a function of time; and (d) cardinality of the set Ek as a function of time.
Figure 4
Figure 4
Multi-agent formations (and their initial communication graphs) used in Monte Carlo simulations. The minimum distance d=5, Rmax=1.4 d.
Figure 5
Figure 5
Search time duration as a function of the size of formation S: the mean (red squares) and the [5,95] percentile limits.

References

    1. Ristic B., Skvortsov A., Gunatilaka A. A study of cognitive strategies for an autonomous search. Inf. Fusion. 2016;28:1–9. doi: 10.1016/j.inffus.2015.06.008. - DOI
    1. Hutchinson M., Liu C., Chen W.H. Information-Based Search for an Atmospheric Release Using a Mobile Robot: Algorithm and Experiments. IEEE Trans. Control. Syst. Technol. 2018;27:1–15. doi: 10.1109/TCST.2018.2860548. - DOI
    1. Haley K.B., Stone L.D. Search Theory and Applications (Nato Conference Series) Springer; Berlin, Germany: 1980.
    1. Stone L.D. In search of Air France flight 447. [(accessed on 3 June 2020)];Institute of Operations Research and the Management Sciences 2011. Available online: https://www.informs.org/ORMS-Today/Public-Articles/August-Volume-38-Numb....
    1. Halford S.E. How do site-specific DNA-binding proteins find their targets? Nucleic Acids Res. 2004;32:3040–3052. doi: 10.1093/nar/gkh624. - DOI - PMC - PubMed

LinkOut - more resources