Dynamic Task Assignment and Path Planning for Multi-AUV System in Variable Ocean Current Environment
An integrated multiple autonomous underwater vehicle (multi-AUV) dynamic task assignment and path planning algorithm is proposed by combing the improved self-organizing map (SOM) neural network and a novel velocity synthesis approach. Each target is to be visited by one and only one AUV, and a short...
Saved in:
| Published in | Journal of intelligent & robotic systems Vol. 74; no. 3-4; pp. 999 - 1012 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Dordrecht
Springer Netherlands
01.06.2014
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0921-0296 1573-0409 |
| DOI | 10.1007/s10846-013-9870-2 |
Cover
| Summary: | An integrated multiple autonomous underwater vehicle (multi-AUV) dynamic task assignment and path planning algorithm is proposed by combing the improved self-organizing map (SOM) neural network and a novel velocity synthesis approach. Each target is to be visited by one and only one AUV, and a shortest path between a starting point and the destination is found in the presence of the variable current environment and dynamic targets. Firstly, the SOM neuron network is developed to assign a team of AUVs to achieve multiple target locations in dynamic ocean environment. The working process involves special definition of the rule to select the winner, the computation of the neighborhood function, and the method to update weights. Then, the velocity synthesis approach is applied to plan a shortest path for each AUV to visit the corresponding target in dynamic environment subject to the ocean current being variable and targets being movable. Lastly, to demonstrate the effectiveness of the proposed approach, simulation results are given in this paper. |
|---|---|
| Bibliography: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
| ISSN: | 0921-0296 1573-0409 |
| DOI: | 10.1007/s10846-013-9870-2 |