A real-time motion planning algorithm for a hyper-redundant set of mechanisms

Nir Shvalb, Boaz Ben Moshe, Oded Medina

Research output: Contribution to journalArticlepeer-review

33 Scopus citations

Abstract

We introduce a novel probabilistic algorithm (CPRM) for real-time motion planning in the configuration space. Our algorithm differs from a probabilistic road map (PRM) algorithm in the motion between a pair of anchoring points (local planner) which takes place on the boundary of the obstacle subspace. We define a varying potential field f on ∂ as a Morse function and followf . We then exemplify our algorithm on a redundant worm climbing robot with n degrees of freedom and compare our algorithm running results with those of the PRM.

Original languageEnglish
Pages (from-to)1327-1335
Number of pages9
JournalRobotica
Volume31
Issue number8
DOIs
StatePublished - 1 Dec 2013
Externally publishedYes

Keywords

  • Climbing robots
  • Legged robots
  • Motion planning
  • Open chain
  • Path planning
  • Redundant manipulators
  • Serial manipulator design and kinematics

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Software
  • Computational Mechanics
  • General Mathematics
  • Modeling and Simulation
  • Rehabilitation
  • Mechanical Engineering
  • Computer Vision and Pattern Recognition
  • Computer Science Applications
  • Control and Optimization
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'A real-time motion planning algorithm for a hyper-redundant set of mechanisms'. Together they form a unique fingerprint.

Cite this