2019
DOI: 10.1016/j.robot.2019.05.003
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic window based approaches for avoiding obstacles in moving

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
30
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 70 publications
(32 citation statements)
references
References 15 publications
0
30
0
Order By: Relevance
“…However, avoiding them like static ones can result in non-optimal trajectories and risky situations, especially if the measurements of the environment are not accurate enough or even the obstacles’ direction suddenly change. To take into account these matters, in our previous work [ 15 ] we proposed two algorithms that deals with dynamic obstacles.…”
Section: Test Bed and Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…However, avoiding them like static ones can result in non-optimal trajectories and risky situations, especially if the measurements of the environment are not accurate enough or even the obstacles’ direction suddenly change. To take into account these matters, in our previous work [ 15 ] we proposed two algorithms that deals with dynamic obstacles.…”
Section: Test Bed and Resultsmentioning
confidence: 99%
“…In this section, we test the improvement of using iDOMap in Dynamic Curvature Velocity Method or DCVM [ 37 ] and Dynamic Window for Dynamic Obstacles or DW4DO [ 15 ] avoidance algorithms.…”
Section: Test Bed and Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…where x(t) and y(t) are the UE's coordinate at time t in the cartesian coordinate system, while the UE's orientation is dictated by θ(t) and t 0 is the initial time while t n can be any time when the UE is moving. The motion of the UE is constrained in a way that the translational velocity v always leads in the steering direction θ of the UE, which is called a non-holonomic constraint [42]. In the DWA, the search for commands controlling the UE is carried out directly in the space of velocities.…”
Section: Ue Trajectory Prediction Designmentioning
confidence: 99%
“…Local obstacle avoidance techniques are employed online in the absence of global information, typically via popular methods such as artificial potential fields (APFs) [11], vector field histograms (VFH) [12], and the dynamic window approach (DWA) [13], which extends local avoidance approaches on account of kinematics constraints. Literature is abundant with various strategies proposed to address the problem of obstacle avoidance of automated robots [14]- [23].…”
Section: Introductionmentioning
confidence: 99%