Rapid approximation for optimal paths in phase space
- 1 July 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 766-771
Abstract
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.Keywords
This publication has 20 references indexed in Scilit:
- Approximately bisimilar discrete abstractions of nonlinear systems using variable-resolution quantizers2010
- Planning 3-D Collision-Free Dynamic Robotic Motion Through Iterative ReshapingIEEE Transactions on Robotics, 2008
- On-line planning of time-optimal, jerk-limited trajectories2008
- Reinforcement learning of a continuous motor sequence with hidden statesAdvanced Robotics, 2007
- Graph Based Model Predictive Control of a Planar Bipedal RobotJournal of the Robotics Society of Japan, 2006
- Nonholonomic multibody mobile robots: controllability and motion planning in the presence of obstacles2002
- Randomized Kinodynamic PlanningThe International Journal of Robotics Research, 2001
- Energy based control of the PendubotIEEE Transactions on Automatic Control, 2000
- Kinodynamic motion planningJournal of the ACM, 1993
- Planning a dynamic trajectory via path finding in discretized phase spaceLecture Notes in Computer Science, 1987