scholarly journals Local Path Planning for Unmanned Surface Vehicle Collision Avoidance Based on Modified Quantum Particle Swarm Optimization

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-15
Author(s):  
Guoqing Xia ◽  
Zhiwei Han ◽  
Bo Zhao ◽  
Xinwei Wang

An unmanned surface vehicle (USV) plans its global path before the mission starts. When dynamic obstacles appear during sailing, the planned global path must be adjusted locally to avoid collision. This study proposes a local path planning algorithm based on the velocity obstacle (VO) method and modified quantum particle swarm optimization (MQPSO) for USV collision avoidance. The collision avoidance model based on VO not only considers the velocity and course of the USV but also handles the variable velocity and course of an obstacle. According to the collision avoidance model, the USV needs to adjust its velocity and course simultaneously to avoid collision. Due to the kinematic constraints of the USV, the velocity window and course window of the USV are determined by the dynamic window approach (DWA). In summary, local path planning is transformed into a multiobjective optimization problem with multiple constraints in a continuous search space. The optimization problem is to obtain the USV’s optimal velocity variation and course variation to avoid collision and minimize its energy consumption under the rules of the International Regulations for Preventing Collisions at Sea (COLREGs) and the kinematic constraints of the USV. Since USV local path planning is completed in a short time, it is essential that the optimization algorithm can quickly obtain the optimal value. MQPSO is primarily proposed to meet that requirement. In MQPSO, the efficiency of quantum encoding in quantum computing and the optimization ability of representing the motion states of the particles with wave functions to cover the whole feasible solution space are combined. Simulation results show that the proposed algorithm can obtain the optimal values of the benchmark functions and effectively plan a collision-free path for a USV.

Robotica ◽  
2010 ◽  
Vol 29 (5) ◽  
pp. 683-690 ◽  
Author(s):  
G. Abbasnejad ◽  
H. M. Daniali ◽  
A. Fathi

SUMMARYThe main goal of this paper is the design of 4PUS+1PS parallel manipulator, using an optimization problem that takes into accounts the characteristics of the workspace and dexterity. The optimization problem is formulated considering constraints on actuated and passive joint limits. A comparison between quantum particle swarm Optimization (QPSO) and PSO is developed. Two numerical examples are presented, which reveal the advantages of QPSO to PSO. Moreover, it is shown that by introducing the dexterity index as a quality measure throughout the workspace, the parallel manipulator is improved at the cost of a minor reduction in its workspace.


2013 ◽  
Vol 760-762 ◽  
pp. 2018-2022
Author(s):  
De Xin Zhou ◽  
Xin Chao Ma ◽  
Teng Da Ma

Nowadays, it becomes a hot research topic for autonomous flight of Quadrotor in the complex environment and the realization of fully autonomous flight is still a big challenge. The path planning of unmanned aerial vehicle is a key problem for its autonomous flight. For the path planning of Quadrotor, using the quantum particle swarm optimization algorithm, and made a lot of simulation and actual flight experiments. The results of simulation and actual flight experiment show that the using of QPSO for the path planning of Quadrotor is able to obtain a satisfactory result.


Author(s):  
Shaorong Xie ◽  
Peng Wu ◽  
Hengli Liu ◽  
Peng Yan ◽  
Xiaomao Li ◽  
...  

Purpose – This paper aims to propose a new method for combining global path planning with local path planning, to provide an efficient solution for unmanned surface vehicle (USV) path planning despite the changeable environment. Path planning is the key issue of USV navigation. A lot of research works were done on the global and local path planning. However, little attention was given to combining global path planning with local path planning. Design/methodology/approach – A search of shortcut Dijkstra algorithm was used to control the USV in the global path planning. When the USV encounters unknown obstacles, it switches to our modified artificial potential field (APF) algorithm for local path planning. The combinatorial method improves the approach of USV path planning in complex environment. Findings – The method in this paper offers a solution to the issue of path planning in changeable or unchangeable environment, and was confirmed by simulations and experiments. The USV follows the global path based on the search of shortcut Dijkstra algorithm. Both USV achieves obstacle avoidances in the local region based on the modified APF algorithm after obstacle detection. Both the simulation and experimental results demonstrate that the combinatorial path planning method is more efficient in the complex environment. Originality/value – This paper proposes a new path planning method for USV in changeable environment. The proposed method is capable of efficient navigation in changeable and unchangeable environment.


Sign in / Sign up

Export Citation Format

Share Document