Assessment and Review of the Reactive Mobile Robot Navigation | ||
| Al-Rafidain Engineering Journal (AREJ) | ||
| Article 31, Volume 26, Issue 2, October 2021, Pages 340-355 PDF (1.5 M) | ||
| Document Type: Review Paper | ||
| DOI: 10.33899/rengj.2021.129484.1082 | ||
| Authors | ||
| Zead Mohammed Yosif* 1; Basil Shukr Mahmood2; Saad Zaghlul Al-khayyt1 | ||
| 1Mechatronics Engineering Department, Collage of Engineering, University of Mosul | ||
| 2Computer Engineering Department, Collage of Engineering, University of Mosul | ||
| Abstract | ||
| Nowadays, the mobile robot can be seen in different fields of engineering and science. The mobile robot can do some tasks that are so difficult or very risky to be performed by a human. Most of the works currently focus on implementing artificially intelligent algorithms and other algorithms that depend on the behaviour of nature. These approaches have been used in mobile robot navigation along uncertain manner. Mobile robot navigation strategies can be divided into two approaches: the classical approach and reactive approach. The classical approach related to static environment, whiles the reactive navigation is based on an unstructured environment. Path planning is one of the most important parts of the navigation system. In this paper, review and assessment of path planning strategies that can concern with the reactive approach are discussed, because it deal with the problem of dynamic environment. Numerous reactive methods have been introduced. Most of these presented works were concerned with simulation and a few of them have shown experimental implementation. Many papers tried to make a combination between two algorithms or more to increase the efficiency. It is concluded that reactive algorithms need more learning phases, complex in design, and require large memory storage. | ||
| Keywords | ||
| Mobile robot navigation; path planning; reactive navigation; artificial intelligent algorithms; optimization algorithms | ||
|
Statistics Article View: 414 PDF Download: 368 |
||