Skip to main navigation Skip to search Skip to main content

Adaptive dynamic collision checking based industrial robot motion planning algorithms

  • Mingjie Jin*
  • , Yunjiang Lou
  • , Guanfeng Liu
  • , Qiang Ling
  • *Corresponding author for this work
  • Harbin Institute of Technology Shenzhen
  • Guangdong University of Technology
  • University of Science and Technology of China

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

Abstract

This paper presents a novel motion planning algorithm for industrial robots based on the PRM (Probabilistic Roadmaps) algorithm. Unlike the traditional PRM algorithm this algorithm significantly reduces computational efforts by carrying out robot path calculations in both robot workspace and configuration space. This algorithm also includes a fast space division method for improving the sampling efficiency. Since both the robot and obstacles are modeled as cuboids, the static collision checking is formulated as a convex optimization problem. By applying adaptive dynamic collision checking method, the motion planning problem is solved efficiently and completely without loss of computation precision.

Original languageEnglish
Title of host publicationProceedings of the 31st Chinese Control Conference, CCC 2012
Pages4450-4455
Number of pages6
StatePublished - 2012
Externally publishedYes
Event31st Chinese Control Conference, CCC 2012 - Hefei, China
Duration: 25 Jul 201227 Jul 2012

Publication series

NameChinese Control Conference, CCC
ISSN (Print)1934-1768
ISSN (Electronic)2161-2927

Conference

Conference31st Chinese Control Conference, CCC 2012
Country/TerritoryChina
CityHefei
Period25/07/1227/07/12

Keywords

  • Collision Checking
  • Industrial Robot
  • Motion Planning
  • Space Division

Fingerprint

Dive into the research topics of 'Adaptive dynamic collision checking based industrial robot motion planning algorithms'. Together they form a unique fingerprint.

Cite this