The present work deals with the design of intelligent path planning algorithms for a mobile robot in static and dynamic environments based on swarm intelligence optimization. Two modifications are ...

https://journals.sagepub.com/doi/pdf/10.1177/1729881420929498

Autonomous navigation and obstacle avoidance of an omnidirectional mobile robot using swarm optimization and sensors deployment

Robots that can move autonomously and can make intelligent decisions by perceiving their environments and surrounding objects are known as autonomous mobile robots. Such robots have rapidly moved from laboratories to automated industries to fill a variety of roles in our lives, homes, offices, hospitals, industries, and even on the streets. The interest in mobile robots is growing rapidly, prompting an enormous amount of research over the last 30 years, on critical factors of mobile robots such as locomotion, perception, localization, mapping, ego-motion tracking, and dynamic navigation. This article surveys these essential factors of autonomous mobile robots in terms of mathematical modeling, control issues, and challenging factors. Brief discussions are provided on the fundamentals of these technologies, popular algorithms in comprehensive mode, future challenges, and promising directions to guide the construction of an autonomous mobile robot with high accuracy and effectiveness. Since it is difficult to find complete coverage of those topics in a single location, this article provides a guideline for researchers entering the field or for innovators in the mobile robotics sector. The paper also examines open challenges in indoor mobile robots and identifies potential futures for autonomous mobile robots.

/pdf/critical-design-and-control-issues-of-indoor-autonomous-2em5147ys5.pdf

Critical Design and Control Issues of Indoor Autonomous Mobile Robots: A Review

A review of path planning algorithms in maritime autonomous surface ships: Navigation safety perspective

An improved ant colony optimization algorithm for unmanned surface vehicle local path planning with multi-modality constraints

In many areas, such as mobile robots, video games and driverless vehicles, path planning has always attracted researchers’ attention. In the field of mobile robotics, the path planning problem is to plan one or more viable paths to the target location from the starting position within a given obstacle space. Evolutionary algorithms can effectively solve this problem. The non-dominated sorting genetic algorithm (NSGA-II) is currently recognized as one of the evolutionary algorithms with robust optimization capabilities and has solved various optimization problems. In this paper, NSGA-II is adopted to solve multi-objective path planning problems. Three objectives are introduced. Besides the usual selection, crossover and mutation operators, some practical operators are applied. Moreover, the parameters involved in the algorithm are studied. Additionally, another evolutionary algorithm and quality metrics are employed for examination. Comparison results demonstrate that non-dominated solutions obtained by the algorithm have good characteristics. Subsequently, the path corresponding to the knee point of non-dominated solutions is shown. The path is shorter, safer and smoother. This path can be adopted in the later decision-making process. Finally, the above research shows that the revised algorithm can effectively solve the multi-objective path planning problem in static environments.

https://www.mdpi.com/2076-3417/8/11/2253/pdf

Mobile Robot Path Planning with a Non-Dominated Sorting Genetic Algorithm

Good path planning technology of mobile robot can not only save a lot of time, but also reduce the wear and capital investment of mobile robot. Several methodologies have been proposed and reported in the literature for the path planning of mobile robot. Although these methodologies do not guarantee an optimal solution, they have been successfully applied in their works. The purpose of this paper is to review the modeling, optimization criteria and solution algorithms for the path planning of mobile robot. The survey shows GA (genetic algorithm), PSO (particle swarm optimization algorithm), APF (artificial potential field), and ACO (ant colony optimization algorithm) are the most used approaches to solve the path planning of mobile robot. Finally, future research is discussed which could provide reference for the path planning of mobile robot.

/pdf/path-planning-for-the-mobile-robot-a-review-52e8lq6p4b.pdf

Wei-ming Lin

Papers

Path Planning for the Mobile Robot: A Review