2004 IEEE/OES Autonomous Underwater Vehicles (IEEE Cat. No.04CH37578) 2004
DOI: 10.1109/auv.2004.1431191
|View full text |Cite
|
Sign up to set email alerts
|

A leader-follower algorithm for multiple AUV formations

Abstract: Abstract-In the future, it may be possible to employ large numbers of autonomous marine vehicles to perform tedious and dangerous tasks, such as minesweeping. Hypothetically, groups of vehicles may leverage their numbers by cooperating. A fundamental form of cooperation is to perform tasks while maintaining a geometric formation. The formation behavior can then enable other cooperative behaviors. In this paper, we describe a leader-follower formation-flying control algorithm. This algorithm can be applied to o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
41
0
2

Year Published

2009
2009
2021
2021

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 115 publications
(43 citation statements)
references
References 6 publications
0
41
0
2
Order By: Relevance
“…Cost reduction can be considerable as followers are generally only concerned with their position relative to the leader, requiring less complex hardware. A leader vehicle may transmit concurrent coordinates to each follower or remain independent, and certain followers can be suitably equipped to replace leader vehicles for system robustness in the case of leader failure [14].…”
Section: Background and Overviewmentioning
confidence: 99%
“…Cost reduction can be considerable as followers are generally only concerned with their position relative to the leader, requiring less complex hardware. A leader vehicle may transmit concurrent coordinates to each follower or remain independent, and certain followers can be suitably equipped to replace leader vehicles for system robustness in the case of leader failure [14].…”
Section: Background and Overviewmentioning
confidence: 99%
“…Recalling the definition of the distance (6) and the definitions (8), (14), and (19), it is easy to show that for a robot with m vertices moving in an environment populated by polygonal obstacles with n vertices, the complexity of the distance computation is O(3 · m · n · 6) where 3 accounts for the three subproblems to be solved to determine the distance and 6 is the number of candidate shortest paths providing the value of the distance function.…”
Section: Case 2-amentioning
confidence: 99%
“…AUVs are capable of a wide range of applications, such as pipeline inspection [1,2], underwater search and rescue, mine-sweeping [3], and oceanographic exploration [4]. The tasks of current AUVs are relatively single, and in the future, AUVs will be able to perform a variety of tasks.…”
Section: Introductionmentioning
confidence: 99%