2007
DOI: 10.1109/robot.2007.363613
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic window based approach to mobile robot motion control in the presence of moving obstacles

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
118
0
1

Year Published

2011
2011
2022
2022

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 211 publications
(130 citation statements)
references
References 14 publications
0
118
0
1
Order By: Relevance
“…assuming that people keep moving with a constant speed. This is known to be a reasonable approximation for short-term behavior, used for collision avoidance [12,13] and tracking algorithms [14]. The method does not need any knowledge about the environment or the previous trajectory, but it is not reliable for long term prediction ignoring environmental constraints or influence .…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…assuming that people keep moving with a constant speed. This is known to be a reasonable approximation for short-term behavior, used for collision avoidance [12,13] and tracking algorithms [14]. The method does not need any knowledge about the environment or the previous trajectory, but it is not reliable for long term prediction ignoring environmental constraints or influence .…”
Section: Related Workmentioning
confidence: 99%
“…We compute the following transition probabilities based on observed trajectories. (12) We also compute transition model with n-1 step histories (n-gram model) We computed these transitions for values of n up to 6, a compromise between computational economy and completeness of description of the environment.…”
Section: ) Computing a Series Of Past Sub-goals From A Fullyobservedmentioning
confidence: 99%
“…The solutions to these two problems provide the base for the appropriate response to the obstacle. Strategies employed for avoiding obstacles in patterns include potential field (Wang et al, 2006), dynamic window (Fox et al, 1997) (Seder & Petrovic, 2007) (Ogren & Leonard, 2003) and flow field method (Shao et al, 2006).…”
Section: Obstacle Avoidancementioning
confidence: 99%
“…Nowadays, scholars have put forward many different obstacle avoidance theories according to different navigation environment. The typical methods include Curvature rate method [1] ,Vector field histogram method [2][3] , Dynamic window method [4][5] , Neighborhood histogram method [6] , Limit cycle method [7] , these methods can improve the robustness of obstacle avoidance in different degrees, but they all need time to calculate the optimal path or the optimal solution, it will sacrifice some time. Even deadlock or shock phenomenon, affect the real-time robot obstacle avoidance.…”
Section: Introductionmentioning
confidence: 99%