A Novel Version of Sampling-based Motion Planner for Manipulation with Faster Initial Solution and Convergence

Guoqiang Zhao*, Xiangzhou Wang, Shuhua Zheng, Qian Han

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

This paper presents, Anytime Fast-BIT∗ (AFBIT∗), a sampling based, asymptotically optimal manipulation motion planner which quickly finds an initial feasible path and rapidly improves the path quality toward optimality. AFBIT∗ is guided by modified heuristics in task space for faster first solution. A local optimization method is adopted at the end of every round to optimize the current best path and generate the next vertex and edge for the global path while a new round begins to improve the quality of the remaining path. Simulation results suggest AFBIT∗ is more efficient and effective on manipulation problems than BIT∗ and Fast-BIT∗.

Original languageEnglish
Title of host publicationProceedings of the 34th Chinese Control and Decision Conference, CCDC 2022
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages357-363
Number of pages7
ISBN (Electronic)9781665478960
DOIs
Publication statusPublished - 2022
Event34th Chinese Control and Decision Conference, CCDC 2022 - Hefei, China
Duration: 15 Aug 202217 Aug 2022

Publication series

NameProceedings of the 34th Chinese Control and Decision Conference, CCDC 2022

Conference

Conference34th Chinese Control and Decision Conference, CCDC 2022
Country/TerritoryChina
CityHefei
Period15/08/2217/08/22

Keywords

  • Industrial robots
  • Manipulation motion planning
  • Sampling-Based Algorithm

Fingerprint

Dive into the research topics of 'A Novel Version of Sampling-based Motion Planner for Manipulation with Faster Initial Solution and Convergence'. Together they form a unique fingerprint.

Cite this