Open Access

ARTICLE

An Improved Q-RRT* Algorithm Based on Virtual Light

Chengchen Zhuge^1,2,3,*, Qun Wang^1,2,3, Jiayin Liu^1,2,3, Lingxiang Yao⁴

1 Department of Computer Information and Cyber Security, Jiangsu Police Insitute, Nanjing, 210031, China
2 Jiangsu Electronic Data Forensics and Analysis Engineering Research Center, Jiangsu Police Insitute, Nanjing, 210031, China
3 Jiangsu Provincial Public Security Department Key Laboratory of Digital Forensics, Jiangsu Police Insitute, Nanjing, 210031, China
4 University of Technology Sydney, Sydney, 2007, Australia

* Corresponding Author: Chengchen Zhuge. Email:

Computer Systems Science and Engineering 2021, 39(1), 107-119. https://doi.org/10.32604/csse.2021.016273

Received 29 December 2020; Accepted 28 February 2021; Issue published 10 June 2021

Abstract

The Rapidly-exploring Random Tree (RRT) algorithm is an efficient path-planning algorithm based on random sampling. The RRT* algorithm is a variant of the RRT algorithm that can achieve convergence to the optimal solution. However, it has been proven to take an infinite time to do so. An improved Quick-RRT* (Q-RRT*) algorithm based on a virtual light source is proposed in this paper to overcome this problem. The virtual light-based Q-RRT* (LQ-RRT*) takes advantage of the heuristic information generated by the virtual light on the map. In this way, the tree can find the initial solution quickly. Next, the LQ-RRT* algorithm combines the heuristic information with the optimization capability of the Q-RRT* algorithm to find the approximate optimal solution. LQ-RRT* further optimizes the sampling space compared with the Q-RRT* algorithm and improves the sampling efficiency. The efficiency of the algorithm is verified by comparison experiments in different simulation environments. The results show that the proposed algorithm can converge to the approximate optimal solution in less time and with lower memory consumption.

---

Keywords

---