No Cover Image

Journal article 95 views 21 downloads

Target-biased informed trees: sampling-based method for optimal motion planning in complex environments

Xianpeng Wang, Xinglu Ma, Xiaoxu Li, Xiaoyu Ma, Chunxu Li Orcid Logo

Journal of Computational Design and Engineering, Volume: 9, Issue: 2, Pages: 755 - 771

Swansea University Author: Chunxu Li Orcid Logo

  • 65998.VoR.pdf

    PDF | Version of Record

    Copyright: TheAuthor(s) 2022. This is an Open Access article distributed under the terms of the Creative Commons Attribution License.

    Download (6.31MB)

Check full text

DOI (Published version): 10.1093/jcde/qwac025

Abstract

Aiming at the problem that the progressively optimized Rapidly-exploring Random Trees Star (RRT*) algorithm generates a large number of redundant nodes, which causes slow convergence and low search efficiency in high-dimensional and complex environments. In this paper we present Target-biased Inform...

Full description

Published in: Journal of Computational Design and Engineering
ISSN: 2288-5048
Published: Oxford University Press (OUP) 2022
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa65998
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2024-04-10T08:21:28Z
last_indexed 2024-04-10T08:21:28Z
id cronfa65998
recordtype SURis
fullrecord <?xml version="1.0" encoding="utf-8"?><rfc1807 xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xsd="http://www.w3.org/2001/XMLSchema"><bib-version>v2</bib-version><id>65998</id><entry>2024-04-09</entry><title>Target-biased informed trees: sampling-based method for optimal motion planning in complex environments</title><swanseaauthors><author><sid>e6ed70d02c25b05ab52340312559d684</sid><ORCID>0000-0001-7851-0260</ORCID><firstname>Chunxu</firstname><surname>Li</surname><name>Chunxu Li</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2024-04-09</date><deptcode>ACEM</deptcode><abstract>Aiming at the problem that the progressively optimized Rapidly-exploring Random Trees Star (RRT*) algorithm generates a large number of redundant nodes, which causes slow convergence and low search efficiency in high-dimensional and complex environments. In this paper we present Target-biased Informed Trees (TBIT*), an improved RRT* path planning algorithm based on target-biased sampling strategy and heuristic optimization strategy. The algorithm adopts a combined target bias strategy in the search phase of finding the initial path to guide the random tree to grow rapidly toward the target direction, thereby reducing the generation of redundant nodes and improving the search efficiency of the algorithm; after the initial path is searched, heuristic sampling is used to optimize the initial path instead of optimizing the random tree, which can benefit from reducing useless calculations, and improve the convergence capability of the algorithm. The experimental results show that the algorithm proposed in this article changes the randomness of the algorithm to a certain extent, and the search efficiency and convergence capability in complex environments have been significantly improved, indicating that the improved algorithm is feasible and efficient.</abstract><type>Journal Article</type><journal>Journal of Computational Design and Engineering</journal><volume>9</volume><journalNumber>2</journalNumber><paginationStart>755</paginationStart><paginationEnd>771</paginationEnd><publisher>Oxford University Press (OUP)</publisher><placeOfPublication/><isbnPrint/><isbnElectronic/><issnPrint/><issnElectronic>2288-5048</issnElectronic><keywords>path planning, rapidly exploring random trees, improved RRT*, target bias, heuristic</keywords><publishedDay>14</publishedDay><publishedMonth>4</publishedMonth><publishedYear>2022</publishedYear><publishedDate>2022-04-14</publishedDate><doi>10.1093/jcde/qwac025</doi><url/><notes/><college>COLLEGE NANME</college><department>Aerospace, Civil, Electrical, and Mechanical Engineering</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>ACEM</DepartmentCode><institution>Swansea University</institution><apcterm>Another institution paid the OA fee</apcterm><funders/><projectreference/><lastEdited>2024-05-22T16:27:27.7583150</lastEdited><Created>2024-04-09T20:05:11.7831247</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Aerospace, Civil, Electrical, General and Mechanical Engineering - Mechanical Engineering</level></path><authors><author><firstname>Xianpeng</firstname><surname>Wang</surname><order>1</order></author><author><firstname>Xinglu</firstname><surname>Ma</surname><order>2</order></author><author><firstname>Xiaoxu</firstname><surname>Li</surname><order>3</order></author><author><firstname>Xiaoyu</firstname><surname>Ma</surname><order>4</order></author><author><firstname>Chunxu</firstname><surname>Li</surname><orcid>0000-0001-7851-0260</orcid><order>5</order></author></authors><documents><document><filename>65998__30444__45e0e7842e364b61850d7bda64e66a9c.pdf</filename><originalFilename>65998.VoR.pdf</originalFilename><uploaded>2024-05-22T16:25:48.4523698</uploaded><type>Output</type><contentLength>6612981</contentLength><contentType>application/pdf</contentType><version>Version of Record</version><cronfaStatus>true</cronfaStatus><documentNotes>Copyright: TheAuthor(s) 2022. This is an Open Access article distributed under the terms of the Creative Commons Attribution License.</documentNotes><copyrightCorrect>true</copyrightCorrect><language>eng</language><licence>https://creativecommons.org/licenses/by/4.0/</licence></document></documents><OutputDurs/></rfc1807>
spelling v2 65998 2024-04-09 Target-biased informed trees: sampling-based method for optimal motion planning in complex environments e6ed70d02c25b05ab52340312559d684 0000-0001-7851-0260 Chunxu Li Chunxu Li true false 2024-04-09 ACEM Aiming at the problem that the progressively optimized Rapidly-exploring Random Trees Star (RRT*) algorithm generates a large number of redundant nodes, which causes slow convergence and low search efficiency in high-dimensional and complex environments. In this paper we present Target-biased Informed Trees (TBIT*), an improved RRT* path planning algorithm based on target-biased sampling strategy and heuristic optimization strategy. The algorithm adopts a combined target bias strategy in the search phase of finding the initial path to guide the random tree to grow rapidly toward the target direction, thereby reducing the generation of redundant nodes and improving the search efficiency of the algorithm; after the initial path is searched, heuristic sampling is used to optimize the initial path instead of optimizing the random tree, which can benefit from reducing useless calculations, and improve the convergence capability of the algorithm. The experimental results show that the algorithm proposed in this article changes the randomness of the algorithm to a certain extent, and the search efficiency and convergence capability in complex environments have been significantly improved, indicating that the improved algorithm is feasible and efficient. Journal Article Journal of Computational Design and Engineering 9 2 755 771 Oxford University Press (OUP) 2288-5048 path planning, rapidly exploring random trees, improved RRT*, target bias, heuristic 14 4 2022 2022-04-14 10.1093/jcde/qwac025 COLLEGE NANME Aerospace, Civil, Electrical, and Mechanical Engineering COLLEGE CODE ACEM Swansea University Another institution paid the OA fee 2024-05-22T16:27:27.7583150 2024-04-09T20:05:11.7831247 Faculty of Science and Engineering School of Aerospace, Civil, Electrical, General and Mechanical Engineering - Mechanical Engineering Xianpeng Wang 1 Xinglu Ma 2 Xiaoxu Li 3 Xiaoyu Ma 4 Chunxu Li 0000-0001-7851-0260 5 65998__30444__45e0e7842e364b61850d7bda64e66a9c.pdf 65998.VoR.pdf 2024-05-22T16:25:48.4523698 Output 6612981 application/pdf Version of Record true Copyright: TheAuthor(s) 2022. This is an Open Access article distributed under the terms of the Creative Commons Attribution License. true eng https://creativecommons.org/licenses/by/4.0/
title Target-biased informed trees: sampling-based method for optimal motion planning in complex environments
spellingShingle Target-biased informed trees: sampling-based method for optimal motion planning in complex environments
Chunxu Li
title_short Target-biased informed trees: sampling-based method for optimal motion planning in complex environments
title_full Target-biased informed trees: sampling-based method for optimal motion planning in complex environments
title_fullStr Target-biased informed trees: sampling-based method for optimal motion planning in complex environments
title_full_unstemmed Target-biased informed trees: sampling-based method for optimal motion planning in complex environments
title_sort Target-biased informed trees: sampling-based method for optimal motion planning in complex environments
author_id_str_mv e6ed70d02c25b05ab52340312559d684
author_id_fullname_str_mv e6ed70d02c25b05ab52340312559d684_***_Chunxu Li
author Chunxu Li
author2 Xianpeng Wang
Xinglu Ma
Xiaoxu Li
Xiaoyu Ma
Chunxu Li
format Journal article
container_title Journal of Computational Design and Engineering
container_volume 9
container_issue 2
container_start_page 755
publishDate 2022
institution Swansea University
issn 2288-5048
doi_str_mv 10.1093/jcde/qwac025
publisher Oxford University Press (OUP)
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Aerospace, Civil, Electrical, General and Mechanical Engineering - Mechanical Engineering{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Aerospace, Civil, Electrical, General and Mechanical Engineering - Mechanical Engineering
document_store_str 1
active_str 0
description Aiming at the problem that the progressively optimized Rapidly-exploring Random Trees Star (RRT*) algorithm generates a large number of redundant nodes, which causes slow convergence and low search efficiency in high-dimensional and complex environments. In this paper we present Target-biased Informed Trees (TBIT*), an improved RRT* path planning algorithm based on target-biased sampling strategy and heuristic optimization strategy. The algorithm adopts a combined target bias strategy in the search phase of finding the initial path to guide the random tree to grow rapidly toward the target direction, thereby reducing the generation of redundant nodes and improving the search efficiency of the algorithm; after the initial path is searched, heuristic sampling is used to optimize the initial path instead of optimizing the random tree, which can benefit from reducing useless calculations, and improve the convergence capability of the algorithm. The experimental results show that the algorithm proposed in this article changes the randomness of the algorithm to a certain extent, and the search efficiency and convergence capability in complex environments have been significantly improved, indicating that the improved algorithm is feasible and efficient.
published_date 2022-04-14T16:27:26Z
_version_ 1799767087246213120
score 11.016258

Similar Items