Ieee Icca 2010 2010
DOI: 10.1109/icca.2010.5524302
|View full text |Cite
|
Sign up to set email alerts
|

The bubble rebound obstacle avoidance algorithm for mobile robots

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
3
2
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(9 citation statements)
references
References 7 publications
0
8
0
Order By: Relevance
“… It is compatible with some simple, reactive, obstacle avoidance algorithms, like the one described in ( [16]).  It is also compatible with several localization systems.…”
Section: Discussionmentioning
confidence: 78%
“… It is compatible with some simple, reactive, obstacle avoidance algorithms, like the one described in ( [16]).  It is also compatible with several localization systems.…”
Section: Discussionmentioning
confidence: 78%
“…And FAHP based weight vector is calculated by following equations (22)- (30). Then the multi-objective decision making is conducted according to the equations (6)- (10). In Figure 9, FAHP based simulation results are displayed.…”
Section: Simulation II (Fahp Based Path Planning)mentioning
confidence: 99%
“…of each heading candidates. Also many of path planning research has been conducted such as bubble rebound algorithm [10], particle swarm optimization [11], dynamic window approach [12], ect. Nevertheless, on-line path planning method for efficient operation of mobile robots is still under study.…”
Section: Introductionmentioning
confidence: 99%
“…Inspired by bubble based approach (BBT) [11], Susnea et al presented BRA. In this algorithm [12], the robot detects obstacles within an area named as sensitivity bubble. After detecting an obstacle, the robot moves in the direction of lowest density.…”
Section: Review and Analysis Of Reported Algorithmsmentioning
confidence: 99%
“…assumes the robot as a point without considering its dimensions [12,14]  The robot's path is only a function of minimum distance to destination [14]  The trajectories followed are sometimes very long and thus the robot may take more time to reach the goal [8,12]  Unidirectional obstacle avoidance approach may further increase traversal time [8]  The strategy does not consider other obstacles during the edge detection process.…”
Section: Features/limitationsmentioning
confidence: 99%