By Topic

Jacobian-based motion planning for climbing robots

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

This paper proposes a two-stage planning algorithm for 3-leg free-climbing robots. The algorithm consists of global path planner and local motion planner. Firstly, the proposed algorithm distributes climbing points to Delaunay triangle mesh. The global planner plans a sequence of Delaunay triangles from the start configuration to goal configuration. Then, the latter plans the transition configurations between two adjacent triangles of the trajectory. The local motion algorithm uses the inverse Jacobian matrix to derive the positions and angles of joints for all configurations. Since the proposed algorithm directly uses spatial information of the workspace to plan a path, it is more efficient than configuration-space based approaches. Simulation results show that the proposed algorithm works well.

Published in:

Information Security and Intelligence Control (ISIC), 2012 International Conference on

Date of Conference:

14-16 Aug. 2012