Adaptive guided salp swarm algorithm with velocity clamping mechanism for solving optimization problems

Background: Path planning technology has a wide range of applications in many fields. Applications in the field of high technology include: autonomous and touchless action of robots; obstacle avoidance and defense flight of drones; cruise missiles to avoid radar search, anti- bouncing attacks, and to complete the task of sudden defense and demolition. Applications in daily life include: GPS navigation; road planning based on GIS system; urban road network planning and navigation. Applications in the field of decision-making management include: vehicle problem (VRP) in logistics management and similar resource allocation problems in resource management. Routing problems in the field of communication technology. Any planning problem that can be topologized as a point and line network can basically be solved by the method of path planning. Different intelligent algorithms have different characteristics, and their application scope and fields are also different, so it is of great significance for the development of path planning technology to study the path planning intelligent algorithms from the characteristics of the algorithms themselves and their applications. Objective: Analyze the advantages and disadvantages of various types of planning algorithms, look forward to the future development trend of mobile robot path planning, and provide certain ideas for the research of mobile robot path planning. Methods: Search journals, patents, conferences, and papers related to mobile robot path planning, and summarize and analyze the advantages and disadvantages of various planning algorithms. Results: Based on the research results of many scholars, this study summarizes different mobile robot path planning methods. It is divided into four categories: traditional planning, intelligent search, artificial intelligence and local obstacle avoidance. This paper introduces and analyzes the latest research results of these types, including their design ideas, advantages and disadvantages, and improvement measures. The research methods adopted are analyzed in order to maximize the advantages of each algorithm and expand the application field of robot path planning to provide ideas and references. Conclusion: This paper provides guidance for the design and optimization of robot path planning. Finally, this paper summarizes the future development trend of robot path planning, and looks forward to the future development trend and key areas of robot path planning.

In complicated environments, which include dynamic and narrow areas, the path planning of Autonomous Mobile Robots (AMRs) encounters challenges, like slow model convergence and limited representational capabilities, often resulting in the robot taking longer, less efficient paths or even colliding with obstacles. To tackle these challenges, the Gated Attention Prioritized Experience Replay Soft Actor-Critic (GAP_ SAC) algorithm is proposed. Key improvements include expanding the state space for better perception, designing a dynamic heuristic reward function to more effectively guide the AMR in achieving its path planning objectives and integrating Prioritized Experience Replay (PER) to improve sample efficiency and accelerate convergence. Additionally, a gated attention mechanism is also introduced to focus on critical environmental features, enhancing the models’ perception capability. Comparative experiments validate that the proposed GAP_SAC algorithm outperforms TD3, SAC and SAC’s variant, demonstrating superior robustness and generalization in complicated environments.

A novel collaborative path planning algorithm for 3-wheel omnidirectional Autonomous Mobile Robot

-By using the two methods of Lyapunov exponent and power spectra analysis, it is tested and verified that Chaotic phenomenon exists in time sequence of distance information that autonomous mobile robot has got from sensors between robots and obstacles. The complexity of path planning for autonomous mobile robot through sensors is explained under dynamic environments by use of chaotic phenomenon. The existence of chaotic phenomenon makes the path planning for autonomous mobile robot under dynamic environments NP-hard and also lays the foundation for revealing why navigation of autonomous mobile robot under dynamic environments is NP-hard.

Path planning is an important aspect in autonomous mobile robots. Various fuzzy logic methods are conveniently employed for path planning of mobile robots as they are most helpful in handling uncertain data. In this work the robot starts from a fixed initial location towards a goal destination without colliding with obstacles in between within a shortest path possible both in static as well as dynamic environment. Here an analysis of fuzzy rules for path planning of a mobile robot for various membership funcions is done. Both simulation results and real time implementations on I Robot create platform are shown in this paper. Fuzzy tool box in Matlab is used for simulation. Three combinations of membership functions with 24 rules are considered. These include-Trapezoidal and Triangular, Bell and Trapezoidal and finally triangular and Bell. The error between the calculated value and actual value indicate that the combination of Trapezoidal and Triangular is least.

As the basic system of the rescue robot, the SLAM system largely determines whether the rescue robot can complete the rescue mission. Although the current 2D Lidar-based SLAM algorithm, including its application in indoor rescue environment, has achieved much success, the evaluation of SLAM algorithms combined with path planning for indoor rescue has rarely been studied. This paper studies mapping and path planning for mobile robots in an indoor rescue environment. Combined with path planning algorithm, this paper analyzes the applicability of three SLAM algorithms (GMapping algorithm, Hector-SLAM algorithm, and Cartographer algorithm) in indoor rescue environment. Real-time path planning is studied to test the mapping results. To balance path optimality and obstacle avoidance, A ∗ algorithm is used for global path planning, and DWA algorithm is adopted for local path planning. Experimental results validate the SLAM and path planning algorithms in simulated, emulated, and competition rescue environments, respectively. Finally, the results of this paper may facilitate researchers quickly and clearly selecting appropriate algorithms to build SLAM systems according to their own demands.

The path of the mobile robot is a multi-objective optimization problem. The traditional ant colony algorithm is introduced into the path planning of the mobile robot. Due to the complexity of the robot path, the large search space and the low efficiency, it is easy to fall into the local optimum and even deadlock and other defeats. In order to enhance the efficiency and accuracy of path planning, a path planning algorithm of mobile robot based on ant colony algorithm is proposed. The path planning of mobile robot is simulated under grid environment. The experimental results show that the improved algorithm can improve the efficiency of path planning for mobile robot, safely avoid obstacles and find all the optimal solutions in the shortest time.

In complex dynamic environments, robot path planning faces challenges in multi‐objective optimization, such as path length, smoothness and obstacle avoidance capability. To address this, this paper proposes an improved sparrow search algorithm based on chaotic initialization and the golden positive cosine strategy for multi‐objective path planning. Diverse initial populations are generated through chaotic mapping to enhance global search capability and avoid falling into local optima. The golden positive cosine strategy optimizes individual position updates to accelerate convergence and ensure path smoothness. Results demonstrate that the proposed method outperforms sparrow search algorithm (SSA), with improvements of 21.1% in path length, 16.3% in smoothness and 14.2% in obstacle avoidance capability. After achieving global path optimization, the improved dynamic window approach (IDWA) is employed for real‐time obstacle avoidance in dynamic environments, dynamically adjusting the window size based on robot speed, obstacle density and target distance to adaptively expand or shrink the search space, thereby improving obstacle avoidance flexibility and efficiency. Simulation results show that the proposed method surpasses SSA in terms of path length, smoothness, obstacle avoidance capability and computational efficiency in both static and dynamic environments.

Mobile robots, as a new type of automated equipment, are widely utilized in intelligent manufacturing production lines. This study focuses on addressing issues such as slow convergence speed, low solution accuracy, and susceptibility to local optima in the traditional whale optimization algorithm (WOA) for mobile robot path planning in intelligent manufacturing production lines. This paper presents a multi-population WOA method that integrates orthogonal learning. This algorithm effectively avoids the impact of local optima through orthogonal learning-based information exchange, enhances convergence speed through reverse learning strategies, and improves solution accuracy via nonlinear convergence factors and adaptive weighting strategies. Simulation results demonstrate significant advantages in search performance for path planning with the improved algorithm, validating its effectiveness and superiority in enhancing intelligent manufacturing efficiency. This research offers a more efficient and accurate solution to the path planning problem, which holds great significance in enhancing the efficiency and accuracy of path planning for mobile robots.

The construction of a smart autonomous mobile robot system that can operate in an anonymous environment can be difficult. Building an autonomous mobile robot requires collecting data from sensors and cameras in order to recognize the surrounding environment, get knowledge of existing landmarks, and figure out its position and orientation. Many research studies have been carried out in recent years providing algorithms for achieving autonomous motion of mobile robot systems and object detection. The most common platform utilized for robot motion design is ROS (Robot Operating System) and for object detection YOLO (You Only Look Once) is a common choice. Additionally, the autonomous system needs motion planning in a systematic way to avoid obstacles by using LIDAR or other sensing methods generating the feedback signals required for control of motion around occupied spaces. One of the most effective and versatile feedback systems for mobile robot control can be constructed using visual feedback, which relies on a high-resolution camera that processes the image in real-time and the result is fed back to the control system for decision making. Visual feedback can be employed alone without sensors for feedback control of autonomous mobile robots, and it can be used for multiple tasks like path planning, obstacle avoidance, object detection, object recognition in addition to motion control. In this research, results of design and construction of an autonomous mobile rescue robot for finding victims through video data are presented. It is aimed to find victims via applying video as a data collection and feedback generation tool in the autonomous mobile robot control system. The visual feedback and YOLO v3 are used not only for finding victims but also for motion control. Our autonomous mobile robot is designed to move smoothly to the victim's direction and avoids obstacles by using ROS Global Planner. The robot is tested in multiple scenarios in different locations, various obstacle and victim numbers, and satisfactory results with good performances are obtained.

Aiming at disadvantages of particle swarm optimization in the path planning of mobile robots, such as low convergence accuracy and easy maturity, this paper proposes an improved particle swarm optimization algorithm based on differential evolution. First, the concept of corporate governance is introduced, adding adaptive adjustment weights and acceleration coefficients to improve the traditional particle swarm optimization and increase the algorithm convergence speed. Then, in order to improve the performance of the differential evolution algorithm, the size of the mutation is controlled by adding adaptive parameters. Moreover, a “high-intensity training” mode is developed to use the improved differential evolution algorithm to intensively train the global optimal position of the particle swarm optimization, which can improve the search precision of the algorithm. Finally, the mathematical model for robot path planning is devised as a two-objective optimization with two indices, i.e., the path length and the degree of danger to optimize the path planning. The proposed algorithm is applied to different experiments for path planning simulation tests. The results demonstrate the feasibility and effectiveness of it in solving a mobile robot path-planning problem.

An improved TD3 algorithm is studied for the low success rate and slow learning speed of TD3(Twin Delayed Deep Deterministic Policy Gradients) algorithm in mobile robot path planning. Prioritized experience replay is added and dynamic delay update strategy is designed which can reduce the impact of value estimation errors to improve the success rate of path planning, and reduce training time. Based on the ROS melodic operating system and the Gazebo simulation software, the Turtlebot3 robot model and simulation experimental environment are established. The effectiveness of the improved TD3 algorithm is verified by comparative experiments. For the path planning task of the mobile robot, the simulation results show that compared with TD3 algorithm, the success rate of the improved TD3 algorithm is increased by 15.6%, and the training navigation time is shortened by 20%. It indicates that the improved TD3 algorithm achieves better performance in the path planning of mobile robot with continuous action space.

A Machine Learning approach for collision avoidance and path planning of mobile robot under dense and cluttered environments

In the task of path planning, the unmanned surface vessels (USV) are required to reach the destination while avoiding obstacle. However, it is difficult for USV to prioritize the two sub-target tasks of destination arrival and obstacle avoidance in a complex dynamic environment using traditional path planning methods. Based on the above considerations, a path planning method for USVs based on strategy integration is proposed. Firstly, the path planning scenario containing dynamic obstacles and two sub-target scenarios are set up. In order to strengthen its ability to reach the destination and avoid dynamic obstacles, the dynamic obstacles and the destination are removed separately in the two sub-target scenarios. Furthermore, the model for strategy selection is trained on action decisions in sub-target scenarios through double deep Q-Network with prioritized experience replay. Finally, a framework for strategy integration is designed to optimize strategy selection for USV. The simulation results show that the proposed method achieves a good overall performance and a higher path planning success rate than the traditional path planning method.

Autonomous Mobile Robots (AMRs) are utilized for handling goods and workpieces in factories and warehouses. The advantages of AMRs are completing automated tasks, reducing labour costs, improving efficiency and increasing convenience. In order to enable AMRs to navigate and move faster in all directions, this study focuses on the implementation of an AMR equipped with four Mecanum wheels to execute path planning tasks for a human-robot collaboration work. To achieve the path planning tasks, the AMR employs a Simultaneous Localization and Mapping (SLAM) algorithm based on the Robot Operating System (ROS) and light detection and ranging (LIDAR) sensors are used for mapping. With omnidirectional mobility of the AMR, a global path planning method is crucial to ensure the AMR’s navigation in the environment. This study adopts the A* algorithm and Voronoi diagram as the global path planning method; it can find the shortest path for navigation of the AMR. To improve the efficiency of AMR path planning, the Voronoi diagram is used to describe the map and the shortest path is built by Dijkstra algorithm. The collision-free A* algorithm will avoid collisions effectively and find the optimal path according to the shortest path tree. Voronoi algorithm is more suitable for use in factory environments with obstacles. Data fusion technology significantly improves positioning accuracy through the integration of visual odometers, IMUs, and traditional odometers.