Cooperative Coverage with a Leader and a Wingmate in Communication-Constrained Environments

We consider a mission framework in which two unmanned vehicles (UVs), a leader and a wingmate, are required to provide cooperative coverage of an environment while being within a short communication range. This framework finds applications in underwater and/or military domains, where certain constra...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2022-10
Main Authors: Sai Krishna Kanth Hari, Rathinam, Sivakumar, Swaroop Darbha, Casbeer, David W
Format: Article
Language:English
Subjects:
Algorithms
Communication
Constraints
Heuristic methods
Military communications
Optimization
Unmanned vehicles
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider a mission framework in which two unmanned vehicles (UVs), a leader and a wingmate, are required to provide cooperative coverage of an environment while being within a short communication range. This framework finds applications in underwater and/or military domains, where certain constraints are imposed on communication by either the application or the environment. An important objective of missions within this framework is to minimize the total travel and communication costs of the leader-wingmate duo. In this paper, we propose and formulate the problem of finding routes for the UVs that minimize the sum of their travel and communication costs as a network optimization problem of the form of a binary program (BP). The BP is computationally expensive, with the time required to compute optimal solutions increasing rapidly with the problem size. To address this challenge, here, we propose two algorithms, an approximation algorithm and a heuristic algorithm, to solve large-scale instances of the problem swiftly. We demonstrate the effectiveness and the scalability of these algorithms through an analysis of extensive numerical simulations performed over 500 instances, with the number of targets in the instances ranging from 6 to 100.
ISSN:2331-8422