OACRR-PSO Algorithm for Anti-ship Missile Path Planning

2012 ◽  
Vol 38 (9) ◽  
pp. 1528 ◽  
Author(s):  
Gang LIU ◽  
Song-Yang LAO ◽  
Can YUAN ◽  
Lv-Lin HOU ◽  
Dong-Feng TAN
Keyword(s):  
Path Planning ◽  
Pso Algorithm

Optimal path planning of a disinfection mobile robot against COVID-19 in a ROS-based research platform

2021 ◽  
Vol 16 (4) ◽  
pp. 405-417
Author(s):  
L. Banjanovic-Mehmedovic ◽  
I. Karabegovic ◽  
J. Jahic ◽  
M. Omercic
Keyword(s):  
Path Planning ◽  
Optimal Path ◽  
Pso Algorithm ◽  
Optimal Path Planning ◽  
Localization And Mapping ◽  
Increasing Demand ◽  
Window Approach ◽  
Path Planner ◽  
Hardware Platforms ◽  
Reactive Collision

Due to COVID-19 pandemic, there is an increasing demand for mobile robots to substitute human in disinfection tasks. New generations of disinfection robots could be developed to navigate in high-risk, high-touch areas. Public spaces, such as airports, schools, malls, hospitals, workplaces and factories could benefit from robotic disinfection in terms of task accuracy, cost, and execution time. The aim of this work is to integrate and analyse the performance of Particle Swarm Optimization (PSO) algorithm, as global path planner, coupled with Dynamic Window Approach (DWA) for reactive collision avoidance using a ROS-based software prototyping tool. This paper introduces our solution – a SLAM (Simultaneous Localization and Mapping) and optimal path planning-based approach for performing autonomous indoor disinfection work. This ROS-based solution could be easily transferred to different hardware platforms to substitute human to conduct disinfection work in different real contaminated environments.

Research on Manipulator Path Planning Based on PSO Algorithm

2021 ◽  
pp. 302-309
Author(s):  
Yulin Li ◽  
Dong Guo ◽  
Weier Qin
Keyword(s):  
Path Planning ◽  
Pso Algorithm

Path planning for intelligent robot based on switching local evolutionary PSO algorithm

2016 ◽  
Vol 36 (2) ◽  
pp. 120-126 ◽  
Author(s):  
Nianyin Zeng ◽  
Hong Zhang ◽  
Yanping Chen ◽  
Binqiang Chen ◽  
Yurong Liu
Keyword(s):  
Markov Chain ◽  
Path Planning ◽  
Three Dimensional ◽  
Grid Method ◽  
Pso Algorithm ◽  
Planning Problem ◽  
Homogeneous Markov Chain ◽  
Intelligent Robot ◽  
Environment Modeling ◽  
Content Type

Purpose This paper aims to present a novel particle swarm optimization (PSO) based on a non-homogeneous Markov chain and differential evolution (DE) for path planning of intelligent robot when having obstacles in the environment. Design/methodology/approach The three-dimensional path surface of the intelligent robot is decomposed into a two-dimensional plane and the height information in z axis. Then, the grid method is exploited for the environment modeling problem. After that, a recently proposed switching local evolutionary PSO (SLEPSO) based on non-homogeneous Markov chain and DE is analyzed for the path planning problem. The velocity updating equation of the presented SLEPSO algorithm jumps from one mode to another based on the non-homogeneous Markov chain, which can overcome the contradiction between local and global search. In addition, DE mutation and crossover operations can enhance the capability of finding a better global best particle in the PSO method. Findings Finally, the SLEPSO algorithm is successfully applied to the path planning in two different environments. Comparing with some well-known PSO algorithms, the experiment results show the feasibility and effectiveness of the presented method. Originality/value Therefore, this can provide a new method for the area of path planning of intelligent robot.

A Glowworm Swarm Optimization Algorithm for Uninhabited Combat Air Vehicle Path Planning

2015 ◽  
Vol 24 (1) ◽  
pp. 69-83 ◽  
Author(s):  
Zhonghua Tang ◽  
Yongquan Zhou
Keyword(s):  
Path Planning ◽  
Heuristic Algorithms ◽  
Optimization Methods ◽  
Pso Algorithm ◽  
Population Based ◽  
Computational Accuracy ◽  
Swarm Optimization ◽  
Glowworm Swarm Optimization ◽  
Air Vehicle ◽  
The Individual

AbstractUninhabited combat air vehicle (UCAV) path planning is a complicated, high-dimension optimization problem. To solve this problem, we present in this article an improved glowworm swarm optimization (GSO) algorithm based on the particle swarm optimization (PSO) algorithm, which we call the PGSO algorithm. In PGSO, the mechanism of a glowworm individual was modified via the individual generation mechanism of PSO. Meanwhile, to improve the presented algorithm’s convergence rate and computational accuracy, we reference the idea of parallel hybrid mutation and local search near the global optimal location. To prove the performance of the proposed algorithm, PGSO was compared with 10 other population-based optimization methods. The experiment results show that the proposed approach is more effective in UCAV path planning than most of the other meta-heuristic algorithms.

scholarly journals A Novel Three-Dimensional Path Planning Method for Fixed-Wing UAV Using Improved Particle Swarm Optimization Algorithm

2021 ◽  
Vol 2021 ◽  
pp. 1-19
Author(s):  
Chen Huang
Keyword(s):  
Particle Swarm Optimization ◽  
Path Planning ◽  
Three Dimensional ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Planning Problem ◽  
Dimensional Problem ◽  
Complex Environment ◽  
Swarm Optimization ◽  
Path Planning Problem

This paper proposed an improved particle swarm optimization (PSO) algorithm to solve the three-dimensional problem of path planning for the fixed-wing unmanned aerial vehicle (UAV) in the complex environment. The improved PSO algorithm (called DCA ∗ PSO) based dynamic divide-and-conquer (DC) strategy and modified A ∗ algorithm is designed to reach higher precision for the optimal flight path. In the proposed method, the entire path is divided into multiple segments, and these segments are evolved in parallel by using DC strategy, which can convert the complex high-dimensional problem into several parallel low-dimensional problems. In addition, A ∗ algorithm is adopted to generated an optimal path from the particle swarm, which can avoid premature convergence and enhance global search ability. When DCA ∗ PSO is used to solve the large-scale path planning problem, an adaptive dynamic strategy of the segment selection is further developed to complete an effective variable grouping according to the cost. To verify the optimization performance of DCA ∗ PSO algorithm, the real terrain data is utilized to test the performance for the route planning. The experiment results show that the proposed DCA ∗ PSO algorithm can effectively obtain better optimization results in solving the path planning problem of UAV, and it takes on better optimization ability and stability. In addition, DCA ∗ PSO algorithm is proved to search a feasible route in the complex environment with a large number of the waypoints by the experiment.

scholarly journals A Novel Particle Swarm Optimization Algorithm Based on Reinforcement Learning Mechanism for AUV Path Planning

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Haoqian Huang ◽  
Chao Jin
Keyword(s):  
Particle Swarm Optimization ◽  
Reinforcement Learning ◽  
Path Planning ◽  
Autonomous Underwater Vehicle ◽  
Synthesis Method ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Feedback Mechanism ◽  
Swarm Optimization ◽  
Learning Mechanism

In order to solve the problems of rapid path planning and effective obstacle avoidance for autonomous underwater vehicle (AUV) in 2D underwater environment, this paper proposes a path planning algorithm based on reinforcement learning mechanism and particle swarm optimization (RMPSO). A feedback mechanism of reinforcement learning is embedded into the particle swarm optimization (PSO) algorithm by using the proposed RMPSO to improve the convergence speed and adaptive ability of the PSO. Then, the RMPSO integrates the velocity synthesis method with the Bezier curve to eliminate the influence of ocean currents and save energy for AUV. Finally, the path is developed rapidly and obstacles are avoided effectively by using the RMPSO. Simulation and experiment results show the superiority of the proposed method compared with traditional methods.

Sign in / Sign up

Export Citation Format

Share Document