Real-time modification of collision-free paths
Real-time modification of collision-free paths
Convex Optimization
Manifold Stochastic Dynamics for Bayesian Learning
Neural Computation
ICML '06 Proceedings of the 23rd international conference on Machine learning
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Logarithmic regret algorithms for online convex optimization
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Iterative MILP methods for vehicle-control problems
IEEE Transactions on Robotics
Bounding on rough terrain with the LittleDog robot
International Journal of Robotics Research
Optimization and learning for rough terrain legged locomotion
International Journal of Robotics Research
Learning, planning, and control for quadruped locomotion over challenging terrain
International Journal of Robotics Research
Optimization-based approach to path planning for closed chain robot systems
International Journal of Applied Mathematics and Computer Science
International Journal of Robotics Research
Gait detection based stable locomotion control system for biped robots
Computers & Mathematics with Applications
Collision-free and smooth trajectory computation in cluttered environments
International Journal of Robotics Research
International Journal of Robotics Research
Legibility and predictability of robot motion
Proceedings of the 8th ACM/IEEE international conference on Human-robot interaction
A policy-blending formalism for shared control
International Journal of Robotics Research
CHOMP: Covariant Hamiltonian optimization for motion planning
International Journal of Robotics Research
Interaction learning for dynamic movement primitives used in cooperative robotic tasks
Robotics and Autonomous Systems
Hi-index | 0.00 |
Existing high-dimensional motion planning algorithms are simultaneously overpowered and underpowered. In domains sparsely populated by obstacles, the heuristics used by sampling-based planners to navigate "narrow passages" can be needlessly complex; furthermore, additional post-processing is required to remove the jerky or extraneous motions from the paths that such planners generate. In this paper, we present CHOMP, a novel method for continuous path refinement that uses covariant gradient techniques to improve the quality of sampled trajectories. Our optimization technique both optimizes higher-order dynamics and is able to converge over a wider range of input paths relative to previous path optimization strategies. In particular, we relax the collision-free feasibility prerequisite on input paths required by those strategies. As a result, CHOMP can be used as a standalone motion planner in many real-world planning queries. We demonstrate the effectiveness of our proposed method in manipulation planning for a 6-DOF robotic arm as well as in trajectory generation for a walking quadruped robot.