2016
DOI: 10.20943/01201604.110
|View full text |Cite
|
Sign up to set email alerts
|

Path planning and Obstacle avoidance approaches for Mobile robot

Abstract: A new path planning method for Mobile Robots (MR) has been developed and implemented. On the one hand, based on the shortest path from the start point to the goal point, this path planner can choose the best moving directions of the MR, which helps to reach the target point as soon as possible. On the other hand, with an intelligent obstacle avoidance, our method can find the target point with the near-shortest path length while avoiding some infinite loop traps of several obstacles in unknown environments. Th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0
1

Year Published

2016
2016
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(4 citation statements)
references
References 17 publications
(22 reference statements)
0
3
0
1
Order By: Relevance
“…У дослідженні [4] описано метод згладжування шляху A* для мобільного роботу. Представлена схема згладила шлях, створений A*, як показано в результатах, але запропонований метод не вирішив проблему часу обчислення шляху.…”
Section: інформаційні технологіїunclassified
“…У дослідженні [4] описано метод згладжування шляху A* для мобільного роботу. Представлена схема згладила шлях, створений A*, як показано в результатах, але запропонований метод не вирішив проблему часу обчислення шляху.…”
Section: інформаційні технологіїunclassified
“…In this Section, we introduce some of these researches, which relate to our study. Bug algorithms [16][17] are known as the simplest obstacle avoidance algorithms. In Bug1 algorithm, in order to pass the obstacles OBi, robot walks along the obstacle boundary from the "hit point" (Hi -the first point when robot hit the obstacle OBi) to find the "leave point" (Li), which has the shortest distance to the goal point first, then from the hit point Hi robot goes back to the "leave point" Li before leaving to the goal point.…”
Section: Related Workmentioning
confidence: 99%
“…This Section compares the performance of the proposed NSPMR algorithm with other related studies, Bug1, Bug2 algorithms [17], and approaches [19][20].…”
Section: Performance Studymentioning
confidence: 99%
See 1 more Smart Citation