2014
DOI: 10.24846/v23i1y201410
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Algorithm for Collision Avoidance in Environments Having U and H Shaped Obstacles

Abstract: This paper proposes a novel obstacle avoidance algorithm for autonomous mobile robot control. The proposed approach brings a solution to the problem of robot traversal in critical shaped environments and offers several advantages compared to the reported approaches. The algorithmic approach, named as, Intelligent Follow the Gap Method (IFGM) is based on improved Intelligent Bug Algorithm (IBA) and Follow the Gap Method (FGM). The robot field of view is taken into consideration. The IBA avoids obstacles by foll… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
29
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
4
3
1

Relationship

2
6

Authors

Journals

citations
Cited by 37 publications
(29 citation statements)
references
References 12 publications
0
29
0
Order By: Relevance
“…Obstacles avoidance algorithm for mobile robot control that combines intelligent bug algorithm and follow the gap method, named intelligent follows the gap method (IFGM), was proposed in [33]. The IFGM has the ability to dynamically adjust path and avoid U and H shape obstacles.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Obstacles avoidance algorithm for mobile robot control that combines intelligent bug algorithm and follow the gap method, named intelligent follows the gap method (IFGM), was proposed in [33]. The IFGM has the ability to dynamically adjust path and avoid U and H shape obstacles.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Advancements in various technological domains during the last two decades have transformed 'fiction' robots in reality (Zohaib et al, 2014). Robotics lies in the category of industrial automation .…”
Section: Introductionmentioning
confidence: 99%
“…Robots in the bug family algorithms have two states while moving: "move to goal ", and "obstacle avoidance" [46]. When a robot is in " move to goal " state, it can move freely.…”
Section: Bug Familymentioning
confidence: 99%
“…In this case, the leaving point is selected when the distance between the next position around the obstacle and the goal position is greater than the distance between the current position and the goal. When the robot finds the leaving point it switches to "move to goal " state [44,46]. This algorithm is a greedy algorithm because it always selects the path that minimize the current distance.…”
Section: Dist-bugmentioning
confidence: 99%
See 1 more Smart Citation