Mobile Robot Navigation in Known Environment

Alex Galcík, František Duchon

Abstract


This article covers various aspects of mobile robot navigation in a familiar environment. It approximates use of mobile navigation in real life, games or other various technical simulations. It discusses some of different algorithms used in determining the robot's route in real time, along with the known advantages and disadvantages. It also compares individual configuration spaces that are used in this type of navigation. For a better overview, we will use algorithms from the area of oriented and non-oriented optimal navigation, which will include A * or Breadth First Search. We will also re-evaluate the success of using a modified A * algorithm in a known environment designed to avoid dynamic obstacles. Then we verify the behavior of the algorithms using 3D simulation.

DOI: 10.61416/ceai.v26i2.8969


Keywords


navigation in a known environment; searching algorithms; response to a dynamic environment; A*; BFS

Full Text: PDF