Skip to main navigation Skip to search Skip to main content

Obstacle avoidance criteria based motion planning for dual-arm mobile robot moving within truss

  • Weiguo Wu*
  • , Peng Wu
  • *Corresponding author for this work
  • School of Mechatronics Engineering, Harbin Institute of Technology

Research output: Contribution to journalArticlepeer-review

Abstract

Motion planning approach for dual-arm mobile robot within a truss is studied based on the obstacle avoidance requirements when moving in truss. The collision-free path search algorithm for end-effector in Cartesian coordinate space is proposed based on state-space model, which avoids the problem of complexity growing exponentially in Configuration space (C space) and achieves the requirement of truss bar could either be a target or and obstacle. Obstacle avoidance criteria within the plane for three-arm of dual-arm mobile robot is established, which solves the problem that robot's arms collide with truss bar when the robot moves in truss space. According to the obstacle avoidance criteria within the plane and arm configurations signs, the analytical solution of each joint angle is obtained, which solves the problem that the numerical solution is not closed. The gesture of end-effector in each moment is interpolated linearly by general rotation transformation formula. Matlab is used to model and simulate the dual-arm mobile robot's motion in the truss to verify the feasibility of the obstacle avoidance approach for the motion in the truss.

Original languageEnglish
Pages (from-to)1-7
Number of pages7
JournalJixie Gongcheng Xuebao/Chinese Journal of Mechanical Engineering
Volume48
Issue number13
DOIs
StatePublished - 5 Jul 2012
Externally publishedYes

Keywords

  • Mobile robot
  • Motion planning
  • Obstacle avoidance criteria
  • Redundant degree of freedom
  • Truss

Fingerprint

Dive into the research topics of 'Obstacle avoidance criteria based motion planning for dual-arm mobile robot moving within truss'. Together they form a unique fingerprint.

Cite this