Algorithm For Autonomous Mobile Robot Research Articles

Modified Q-Learning Algorithm for Mobile Robot Real-Time Path Planning using Reduced States

Path planning is an essential algorithm in any autonomous mobile robot, including agricultural robots. One of the reinforcement learning methods that can be used for mobile robot path planning is the Q-Learning algorithm. However, the conventional Q-learning method explores all possible robot states in order to find the most optimum path. Thus, this method requires extensive computational cost especially when there are considerable grids to be computed. This study modified the original Q-Learning algorithm by removing the impassable area, so that these areas are not considered as grids to be computed. This modified Q-Learning method was simulated as path finding algorithm for autonomous mobile robot operated at the Agribusiness and Technology Park (ATP), IPB University. Two simulations were conducted to compare the original Q-Learning method and the modified Q-Learning method. The simulation results showed that the state reductions in the modified Q-Learning method can lower the computation cost to 50.71% from the computation cost of the original Q-Learning method, that is, an average computation time of 25.74s as compared to 50.75s, respectively. Both methods produce similar number of states as the robot’s optimal path, i.e. 56 states, based on the reward obtained by the robot while selecting the path. However, the modified Q-Learning algorithm is capable of finding the path to the destination point with a minimum learning rate parameter value of 0.2 when the discount factor value is 0.9.

Dynamic path planning algorithm for autonomous mobile robot with a minimum number of turns in unknown environment

Dynamic path planning algorithm for autonomous mobile robot with a minimum number of turns in unknown environment

Path planning for autonomous mobile robots using multi-objective evolutionary particle swarm optimization.

In this article, a new path planning algorithm is proposed. The algorithm is developed on the basis of the algorithm for finding the best value using multi-objective evolutionary particle swarm optimization, known as the MOEPSO. The proposed algorithm is used for the path planning of autonomous mobile robots in both static and dynamic environments. The paths must follow the determined criteria, namely, the shortest path, the smoothest path, and the safest path. In addition, the algorithm considers the degree of mutation, crossover, and selection to improve the efficiency of each particle. Furthermore, a weight adjustment method is proposed for the movement of particles in each iteration to increase the chance of finding the best fit solution. In addition, a method to manage feasible waypoints within the radius of obstacles or blocked by obstacles is proposed using a simple random method. The main contribution of this article is the development of a new path planning algorithm for autonomous mobile robots. This algorithm can build the shortest, smoothest, and safest paths for robots. It also offers an evolutionary operator to prevent falling into a local optimum. The proposed algorithm uses path finding simulation in a static environment and dynamic environment in conjunction with comparing performance to path planning algorithms in previous studies. In the static environment (4 obstacles), the shortest path obtained from the proposed algorithm is 14.3222 m. In the static environment (5 obstacles), the shortest path obtained from the proposed algorithm is 14.5989 m. In the static environment (6 obstacles), the shortest path obtained from the proposed algorithm is 14.4743 m. In the dynamic environment the shortest path is 12.2381 m. The results show that the proposed algorithm can determine the paths from the starting point to the destination with the shortest distances that require the shortest processing time.

A simultaneous localization and mapping algorithm for sensors with low sampling rate and its application to autonomous mobile robots

In this paper we suggest a Simultaneous Localization and Mapping (SLAM) algorithm for Autonomous Mobile Robots (AMRs) which have LiDAR (light detection and ranging) type planar sensors with low sampling rate, e.g., less than 1 Hz. The proposed method uses 2-dimensional point clouds for its internal occupancy map representation and applies Point Set Registration (PSR) algorithms for mapping and localization. The approach is validated on both synthetic and real-world data. The results demonstrate that the proposed method is efficient, even when the observations are imprecise as well as the difference between consecutive measurements is high in terms of position and orientation.

Adaptive relative velocity estimation algorithm for autonomous mobile robots using the measurements on acceleration and relative distance

SummaryIn this article, an adaptive algorithm is proposed for online velocity estimation of the autonomous mobile robots (AMRs) without positioning data received from a Global Positioning System (GPS) module or other means for odometry. Unlike the popular Kalman and particle filters that use the measurements on vectors of global (or local) position and acceleration of a mobile robot, the proposed adaptive relative velocity estimation (ARVE) algorithm requires the scalar value of measured distance to a beacon agent and also the measurement on acceleration vector, in order to generate an online estimation of the global velocity vector of a mobile robot. Combining the ARVE algorithm with the recently proposed adaptive relative position estimation (ARPE) algorithm provides a solution for online estimation of the translational states of a mobile robot without accessing the GPS data, which makes the package applicable in both indoor and outdoor environments. The stability of the ARVE algorithm is analyzed with LaSalle‐Yoshizawa theorem. In addition, two simulation studies are provided to show the application of the proposed estimation package (ARVE+ARPE) for aerial AMRs in two cases corresponding to the stationary and moving beacon agents. In the simulation results, it is shown that the estimation package can be used in conjunction with the recently proposed adaptive model‐free control (AMFC) algorithm to achieve desired tracking objective in autonomous movement of a quadrotor, without requiring the information on the internal dynamics of the robot.

Hybrid Path Planning Algorithm Based on Membrane Pseudo-Bacterial Potential Field for Autonomous Mobile Robots

A hybrid path planning algorithm based on membrane pseudo-bacterial potential field (MemPBPF) is proposed. Membrane-inspired algorithms can reach an evolutionary behavior based on biochemical processes to find the best parameters for generating a feasible and safe path. The proposed MemPBPF algorithm uses a combination of the structure and rules of membrane computing. In that sense, the proposed MemPBPF algorithm contains dynamic membranes that include a pseudo-bacterial genetic algorithm for evolving the required parameters in the artificial potential field method. This hybridization between membrane computing, the pseudo-bacterial genetic algorithm, and the artificial potential field method provides an outperforming path planning algorithm for autonomous mobile robots. Computer simulation results demonstrate the effectiveness of the proposed MemPBPF algorithm in terms of path length considering collision avoidance and smoothness. Comparisons with two different versions employing a different number of elementary membranes and with other artificial potential field based algorithms are presented. The proposed MemPBPF algorithm yields improved performance in terms of time execution by using a parallel implementation on a multi-core computer. Therefore, the MemPBPF algorithm achieves high performance yielding competitive results for autonomous mobile robot navigation in complex and real scenarios.

Path Planning inside Multi-Storey Buildings: an Algorithm for Autonomous Mobile Robot

Abstract A mobile robot travels inside a multi-storey building. The robot does not know an environment a priory; it explores each floor via lidar and SLAM method. As a result, it has access to the map of the entire building. The robot can also determine staircases and move along them using data from RGB-D camera. The objective is to reach a given location, which is specified by the operator based on the resulting map. We present a navigation and guidance strategy under which the robot autonomously reaches the desired location combining 2D path planning algorithm with staircase overpassing. Effectiveness of such strategy is also confirmed by real-world experiments with tracked robotic platform.

Fast Obstacle Detection for Monocular Autonomous Mobile Robots

This paper proposes a monocular vision based obstacle detection algorithm for autonomous mobile robots. Our main algorithm consists of two stages. In the first stage, we use an inverse perspective ...

New Lane Detection Algorithm that Emulates Human Color Recognition

<div class=""abs_img""> <img src=""[disp_template_path]/JRM/abst-image/00270004/08.jpg"" width=""300"" /> New lane detection algorithm</div> The perception of color by the human eye is different from that of cameras. This is due to the optical illusion and color constancy characteristics of human vision. In spite of these characteristics, people can drive cars without the danger of overturning. In this paper, we describe a new white lane detection algorithm for autonomous mobile robots, one based on a method similar to the color perception of human beings. In order to drive safely, we emulate human color perception to reduce the effects of lighting and shadow on the course. The validity of the proposed image compensation method is confirmed by actual while line detection. </span>

Design an Optimal PID Controller using Artificial Bee Colony and Genetic Algorithm for Autonomous Mobile Robot

tracking is a serious function for an autonomous mobile robot navigating in unknown environments such as disaster areas, projects sites, and any dangerous place which the human cannot reach. This paper deals with modified the parameters of PID controller using Artificial Bee Colony (ABC) and Genetic Algorithm (GA) for path tracking of autonomous mobile robot. Two PID control are designed, one for speed control and the other for azimuth control. The MATLAB program is used to simulate the autonomous mobile robot model with optimal PID controllers, ABC algorithm and GA. To test the effectiveness of the proposed controllers, two path trajectories have been chosen: circular path and sine wave path. The results have clearly shown the effectiveness and good performances of the PID controllers which are tuned using ABC algorithm than using GA.

Study on Improved APF Algorithm for Autonomous Mobile Robot

In algorithms of obstacle avoidance for autonomous mobile robot, APF algorithm is simple, real-time and smooth, but has some limitations for solving problems. For example, the local minimum point may trap mobile robots before reaching its goal. Even though many improved APF algorithms have been put forward, few articles describe the process in detail to show how these algorithms are applied. Considering above factors, this paper focuses on embodiment of abstract improved theory for APF algorithm by showing some changes with formulas and parameters. The whole work has been done in simulation environment. According to the results this paper draws a conclusion.

가상 탄성력을 이용한 자율이동로봇 경로생성 방법

본 논문에서는 그리드 기반의 맵에서 자율이동로봇의 경로생성방법 및 가상 탄성력을 이용한 경로최적화 방법을 다룬다. 경로계획의 목적은 로봇이 주어진 환경에서 효율적으로 목표점을 향해 이동할 수 있도록 정보 생성하는 것이다. 그리드 기반의 경로계획기법으로 AStar 알고리즘이 대표적인 방법이며 본 논문에서는 AStar 알고리즘에 의해 작성된 경로를 가상 탄성력 알고리즘을 이용하여 경로를 최적화하는 알고리즘을 제안하고 있으며 그 결과를 비교한다. 가상 탄성력은 생성된 경로를 더 짧고 부드럽게 생성해주는 장점을 가지고 있으며 그리드 기반의 경로를 최적화 하는데 매우 유리하다. This paper describes a global path planning method and path optimization algorithm for autonomous mobile robot based on the virtual elastic force in a grid map environment. A goal of a path planning is information for a robot to go its goal point from start point by a effective way. The AStar algorithm is a well-known method for a grid based path planning. This paper suggest a path optimization method by a virtual elastic force and compare the algorithm with a orignal AStar method. The virtual elastic force makes a shorter and smoother path. It is a profitable algorithm to optimize a path in a grid environment.

Research on Navigation and Obstacle Avoidance Algorithm for Autonomous Mobile Robot in Narrow Area

In order to improve the accuracy and security when autonomous mobile robot moves in narrow area, a real-time navigation and obstacle avoidance algorithm is put forward. The feature extraction method is used to search for the path points, and the angle potential field method is used to search for the target angle. Based on the two methods more accurate environment modeling and navigation for mobile robot in narrow area is realized. The algorithm has been used successfully in the household robot, and the experiment results show it’s accurate and real-time.

A Localization Algorithm for Autonomous Mobile Robots via a Fuzzy Tuned Extended Kalman Filter

The capability to acquire the position and orientation of an autonomous mobile robot is an important element for achieving specific tasks requiring autonomous exploration of the workplace. In this paper, we present a localization method that is based on a fuzzy tuned extended Kalman filter (FT-EKF) without a priori knowledge of the state noise model. The proposed algorithm is employed in a mobile robot equipped with 16 Polaroid sonar sensors and tested in a structured indoor environment. The state noise model is estimated and adapted by a fuzzy rule-based scheme. The proposed algorithm is compared with other EKF localization methods through simulations and experiments. The simulation and experimental studies demonstrate the improved performance of the proposed FT-EKF localization method over those using the conventional EKF algorithm.

Robot navigation: implications from search strategies in exploring crayfish

SUMMARYBiomimetic applications play an important role in informing the field of robotics. One aspect is navigation – a skill automobile robots require to perform useful tasks. A sub-area of this is search strategies, e.g. for search and rescue, demining, exploring surfaces of other planets or as a default strategy when other navigation mechanisms fail. Despite that, only a few approaches have been made to transfer biological knowledge of search mechanisms on surfaces along the ground into biomimetic applications. To provide insight for robot navigation strategies, this study describes the paths a crayfish used to explore terrain. We tracked movement when different sets of sensory input were available. We then tested this algorithm with a computer model crayfish and concluded that the movement of C. destructor has a specialised walking strategy that could provide a suitable baseline algorithm for autonomous mobile robots during navigation.

퍼지-뉴럴 네트워크를 이용한 자율 이동로봇의 운항

본 논문은 장애물에 대한 사전 정보를 가지고 있지 않은 미지의 공간에서 장애불의 회피와 지정된 목표점으로 이동할 수 있는 자율이동로봇을 위한 퍼지-뉴럴 네트워크를 이용한 지능제어 알고리즘을 제안하고, 제안된 제어기의 효용성을 모의실험과 실제 로봇의 구동실험을 통하여 검증을 한다. 제시한 지능제어기는 계층구조의 알고리즘으로 로봇이 목표에 도달하기 위한 퍼지 알고리즘과 주행 중 만날 수 있는 장애물들에 대한 회피를 수행하는 퍼지-뉴럴 알고리즘으로 구성된 계층과, 로봇이 이동하면서 만날 수 있는 여러 가지 상황에 따라 장애물 회피동작과 목표점 도달동작을 수행할 수 있도록 두 알고리즘에 적당한 가중치를 부여하는 가중치 퍼지 알고리즘으로 구성되어 있다. 그리고 로봇의 현재 운동정보와 장애물까지의 거리정보를 바탕으로 가중치 퍼지 알고리즘의 출력부 소속도 함수를 조절함으로서 오목한 장애물에 대해서도 장애물 회피 동작을 수행하도록 하였다. 제작된 로봇으로 제시한 알고리즘의 실효성을 검증하였다.

ブースティングアルゴリズムを用いた自律移動ロボットの制御ルール獲得

ブースティングアルゴリズムを用いた自律移動ロボットの制御ルール獲得

미지 환경에서 이동로봇의 주행 알고리즘

본 논문에서는 자율이동로봇이 주위 환경을 알지 못하는 상황에서 목표점까지 안전하게 주행하게 하는 주행 알고리즘에 대해 연구한다. 주행 알고리즘에서 가장 고려해야할 부분이 장애물 회피 알고리즘인데, 본 논문에서는 장애물 회피 알고리즘인 VFH(Vector Field Histogram) 알고리즘과 퍼지 알고리즘을 조합하여 여러 가지 형태의 환경에서 최적의 성능을 내도록 한다. 로봇이 처한 환경에 따라 상위 레벨의 supervisor가 위의 두 가지 장애물 회피 알고리즘 중 적절한 것을 선택하도록 조합하고, 다양한 환경에서 모의실험을 수행함으로써 제안된 로봇주행 알고리즘의 성능을 검증한다. This paper deals with problems of safe and efficient navigation algorithm for autonomous mobile robots in unknown environments. Since the obstacle avoidance algorithms are very important in mobile robot navigation, two obstacle avoidance algorithms: VFH(vector field histogram) algorithm and a fuzzy algorithm are combined to have optimal performance in various environments. And a upper-level supervisor is to select the proper one from VFH algorithm and the fuzzy algorithm according to the situations the robot faces. Computer simulation results show the effectiveness of the proposed navigation algorithm for autonomous mobile robots.

Behavior-decision fuzzy algorithm for autonomous mobile robots

The ambiguous state recognition when an autonomous mobile robot moves around a complex environment is one of the most important problems in robot control. We propose a construction method of the behavior-decision system using fuzzy algorithms capable of expressing sequence flow that includes a mixture of both crisp and fuzzy processing. We also propose in this paper a method of tuning algorithms for giving robots the autonomous ability to judge purposes of actions like humans. In this method, we try to express ambiguous situations that a robot will encounter and decision algorithm flows by using fuzzy algorithms with fuzzy branch-controlled threshold, which we call the behavior-decision fuzzy algorithm. Finally, we report some results of computer simulations and experiments concerning an evaluation of this method in supposed simple indoor environments.