Distributed Hunting for Multi USVs Based on Cyclic Estimation and Pursuit

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this brief, we study the hunting problem for a group of underactuated surface vehicles (USVs), in which the vehicles converge to the target as the center, as well as maintain the desired relative distance to the target when rotating around the target at the same speed. A approach based on the cyclic matrix is delivered. The overall control objectives are divided into two subobjectives, where the first is target circling that all vehicles rotate a circle around the target, and the second is that the vehicles are eventually evenly spaced on the circle. The former part is based on the cyclic estimation of target to get close to the target, the latter is designed by also cyclic pursuit strategy using the relative angle between the neighbors. An important feature of the controller is that not all vehicles know the target’s position. For hunting with obstacle avoidance, artificial potential method and label’s change strategy between neighbors are also applied to guarantee obstacle avoidance. Numerical simulations are given to verify the effectiveness of the proposed controller.

Cite

CITATION STYLE

APA

Hu, B., Liu, B., Xu, Z., Geng, T., Yuan, Y., & Zhang, H. T. (2018). Distributed Hunting for Multi USVs Based on Cyclic Estimation and Pursuit. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10984 LNAI, pp. 101–112). Springer Verlag. https://doi.org/10.1007/978-3-319-97586-3_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free