By Topic

Rapid approximation for optimal paths in phase space

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

3 Author(s)
Chyon Hae Kim ; Honda Res. Inst. Japan Co., Ltd., Wako, Japan ; Tsujino, H. ; Sugano, S.

This paper addresses optimal motion for general machines. Approximation for optimal motion needs a global path planning algorithm that precisely calculates the whole dynamics of a machine in a brief calculation. We propose a path planning algorithm that is composed of a path searching algorithm and a pruning algorithm. The pruning algorithm is based on our analysis for the resemblances of states. To confirm the precision, calculation cost, optimality, and applicability of the proposed algorithm, we conducted several shortest time path planning examinations for the dynamic models of double inverted pendulums. The precision to reach the goal state of the pendulums was better than other algorithms. The calculation was at least 58 times faster. There was a positive correlation between the optimality and the resolutions of the proposed algorithm. As a result of torque based feedback control simulation, we confirmed applicability of the proposed algorithm under noisy situation.

Published in:

Advanced Intelligent Mechatronics (AIM), 2011 IEEE/ASME International Conference on

Date of Conference:

3-7 July 2011