Abstract
Using multiple mobile robots in search missions offers a lot of benefits, but one needs a suitable and competent motion control algorithm that is able to consider sensor characteristics, the uncertainty of target detection, and complexity of needed maneuvers in order to make a multiagent search autonomous. This article provides a methodology for an autonomous 2-D search using multiple unmanned (aerial or possibly other) vehicles. The proposed methodology relies on an accurate calculation of target occurrence probability distribution based on the initial estimated target distribution and continuous action of spatial variant search agent sensors. The core of the autonomous search process is a high-level motion control for multiple search agents which utilizes the probabilistic model of target occurrence via a heat equation-driven area coverage (HEDAC) method. This centralized motion control algorithm is tailored for handling a group of search agents that are heterogeneous in both motion and sensing characteristics. The motion of agents is directed by the gradient of the potential field which provides a near-ergodic exploration of the search space. The proposed method is tested on three realistic search mission simulations and compared with three alternative methods, where HEDAC outperforms all alternatives in all tests. Conventional search strategies need about double the time to achieve the proportionate detection rate when compared to HEDAC controlled search. The scalability test showed that increasing the number of an HEDAC controlled search agents, although somewhat deteriorating the search efficiency, provides needed speed-up of the search. This study shows the flexibility and competence of the proposed method and gives a strong foundation for possible real-world applications.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.