A heuristic obstacle avoidance algorithm using vanishing point and obstacle angle

Although there exists a class of algorithms for coping with unknown obstacles in mobile robot navigation, most of them produce rather conservative paths because the varying density of obstacles is not directly considered in the real-time motion planning stage. In this paper, we develop a heuristic o...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Intelligent service robotics Ročník 8; číslo 3; s. 175 - 183
Hlavní autoři: Kim, Yongkuk, Kwon, SangJoo
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2015
Springer Nature B.V
Témata:
Algorithms
Artificial Intelligence
Control
Dynamical Systems
Engineering
Heuristic
Mechatronics
Motion planning
Obstacle avoidance
Original Research Paper
Real time
Robotics
Robotics and Automation
Robots
User Interfaces and Human Computer Interaction
Velocity
Vibration
Mobile robot navigation
Lane following
Obstacle avoidance
Vanishing point
ISSN:1861-2776, 1861-2784
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Although there exists a class of algorithms for coping with unknown obstacles in mobile robot navigation, most of them produce rather conservative paths because the varying density of obstacles is not directly considered in the real-time motion planning stage. In this paper, we develop a heuristic obstacle avoidance method in terms of the vanishing point and obstacle angle (VP–OA) to compromise through an adjustable weighting factor between the lane tracking and the obstacle avoidance performance depending on the frequency of emerging obstacles. The suggested algorithm has the advantage of generating smooth local paths close to a human’s car driving. Comparison simulations and experiments with other popular algorithms validate the effectiveness of the proposed scheme.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1861-2776
1861-2784
DOI:10.1007/s11370-015-0171-4