2016 IEEE Conference on Control Applications (CCA) 2016
DOI: 10.1109/cca.2016.7587879
|View full text |Cite
|
Sign up to set email alerts
|

A modified dynamic window algorithm for horizontal collision avoidance for AUVs

Abstract: Abstract-Much research has been done on the subject of collision avoidance (COLAV). However, few results are presented that consider vehicles with second-order nonholonomic constraints, such as autonomous underwater vehicles (AUVs). This paper considers the dynamic window (DW) algorithm for reactive horizontal COLAV for AUVs, and uses the HUGIN 1000 AUV in a case study. The DW algorithm is originally developed for vehicles with first-order nonholonomic constraints and is hence not directly applicable for AUVs … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
33
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
3
2
2

Relationship

5
2

Authors

Journals

citations
Cited by 41 publications
(33 citation statements)
references
References 10 publications
0
33
0
Order By: Relevance
“…Here, we describe a step-by-step design procedure for a simplified version of the dynamic window (DW) algorithm presented in [4] by removing the collision avoidance part of the algorithm.…”
Section: A Simplified Dynamic Window Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…Here, we describe a step-by-step design procedure for a simplified version of the dynamic window (DW) algorithm presented in [4] by removing the collision avoidance part of the algorithm.…”
Section: A Simplified Dynamic Window Algorithmmentioning
confidence: 99%
“…The DW algorithm is modified for AUVs in [4] and shows promising results for handling magnitude and rate constraints for the actuators. In this paper, we consider a simplification of the DW algorithm in [4], by removing the collision avoidance part of the algorithm.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…This section presents a mathematical analysis of the closed-loop control system (1), (10), including the switching between guidance mode where ψ d in (10) is given by (11), and CA mode where ψ d is given by (17), according to the switching rule in Section IV-C. In particular, for a static obstacle we will show, as stated in the following lemma, that a vehicle maintaining v β (j) (t) (12) will converge to a circle around the obstacle.…”
Section: Mathematical Analysismentioning
confidence: 99%
“…The dynamic window algorithm [10], [11] incorporates such constraints by searching through a set of valid vehicle trajectories to find a safe control input. Again, only static obstacles are considered.…”
mentioning
confidence: 99%