Decomposition of Collaborative Surveillance Tasks for Execution in Marine Environments by a Team of Unmanned Surface Vehicles
This paper introduces an approach for decomposing exploration tasks among multiple unmanned surface vehicles (USVs) in congested regions. In order to ensure effective distribution of the workload, the algorithm has to consider the effects of the environmental constraints on the USVs. The performance...
Gespeichert in:
Veröffentlicht in: | Journal of mechanisms and robotics 2018-04, Vol.10 (2) |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | This paper introduces an approach for decomposing exploration tasks among multiple unmanned surface vehicles (USVs) in congested regions. In order to ensure effective distribution of the workload, the algorithm has to consider the effects of the environmental constraints on the USVs. The performance of a USV is influenced by the surface currents, risk of collision with the civilian traffic, and varying depths due to tides and weather. The team of USVs needs to explore a certain region of the harbor and we need to develop an algorithm to decompose the region of interest into multiple subregions. The algorithm overlays a two-dimensional grid upon a given map to convert it to an occupancy grid, and then proceeds to partition the region of interest among the multiple USVs assigned to explore the region. During partitioning, the rate at which each USV is able to travel varies with the applicable speed limits at the location. The objective is to minimize the time taken for the last USV to finish exploring the assigned area. We use the particle swarm optimization (PSO) method to compute the optimal region partitions. The method is verified by running simulations in different test environments. We also analyze the performance of the developed method in environments where speed restrictions are not known in advance. |
---|---|
ISSN: | 1942-4302 1942-4310 |
DOI: | 10.1115/1.4038974 |