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

Guoqing Xia, Zhiwei Han, Bo Zhao and Xinwei Wang

Complexity, 2020, vol. 2020, 1-15

Abstract:

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.

Date: 2020
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2020/3095426.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2020/3095426.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:3095426

DOI: 10.1155/2020/3095426

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().