Skip to main navigation Skip to search Skip to main content

Finding Better Robot Trajectory by Linear Constrained Quadratic Programming

  • Yizhou Liu
  • , Fusheng Zha
  • , Mantian Li
  • , Wei Guo*
  • , Xin Wang*
  • , Wangqiang Jia
  • , Darwin Caldwell
  • *Corresponding author for this work

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

Abstract

Finding feasible motion for robots with high-dimensional configuration space is a fundamental problem in robotics. Sampling-based motion planning (SBMP) algorithms have been shown to be effective for these high-dimensional systems. But the biggest flaw of SBMP methods is that the trajectory is a combination of multiple linear paths under configuration space, which causes a lot of unnecessary acceleration and jerk. So how to optimize the solution of SBMPs efficiently is a key to improve the robot trajectory quality. In this paper, a robot trajectory optimization method based on linear constrained quadratic programming is proposed, which only need collision query, no distance or penetration calculations, and no prior knowledge of the environment. We use a series of simulation to prove the effectiveness and correctness of the methods.

Original languageEnglish
Title of host publicationICARM 2020 - 2020 5th IEEE International Conference on Advanced Robotics and Mechatronics
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages252-256
Number of pages5
ISBN (Electronic)9781728164793
DOIs
StatePublished - Dec 2020
Event5th IEEE International Conference on Advanced Robotics and Mechatronics, ICARM 2020 - Shenzhen, China
Duration: 18 Dec 202021 Dec 2020

Publication series

NameICARM 2020 - 2020 5th IEEE International Conference on Advanced Robotics and Mechatronics

Conference

Conference5th IEEE International Conference on Advanced Robotics and Mechatronics, ICARM 2020
Country/TerritoryChina
CityShenzhen
Period18/12/2021/12/20

Fingerprint

Dive into the research topics of 'Finding Better Robot Trajectory by Linear Constrained Quadratic Programming'. Together they form a unique fingerprint.

Cite this