Newton methods for k-order Markov Constrained Motion Problems

Abstract

This is a documentation of a framework for robot motion optimization that aims to draw on classical constrained optimization methods. With one exception the underlying algorithms are classical ones: Gauss-Newton (with adaptive step size and damping), Augmented Lagrangian, log-barrier, etc. The exception is a novel any-time version of the Augmented Lagrangian. The contribution of this framework is to frame motion optimization problems in a way that makes the application of these methods efficient, especially by defining a very general class of robot motion problems while at the same time introducing abstractions that directly reflect the API of the source code.

Cited by in corpus (13)

• Motion Planning for Robotics: A Review for Sampling-based Planners
• Riemannian Motion Policies
• Robust Task and Motion Planning for Long-Horizon Architectural Construction Planning
• Learning Implicit Priors for Motion Optimization
• Physical problem solving: Joint planning with symbolic, geometric, and dynamic constraints
• Control-Tree Optimization: an approach to MPC under discrete Partial Observability
• A novel Skill-based Programming Paradigm based on Autonomous Playing and Skill-centric Testing
• Approximately Optimal Continuous-Time Motion Planning and Control via Probabilistic Inference
• Collaborative Behavior Models for Optimized Human-Robot Teamwork
• Visualization of Nonlinear Programming for Robot Motion Planning
• On the Fundamental Importance of Gauss-Newton in Motion Optimization
• Approximate Topological Optimization using Multi-Mode Estimation for Robot Motion Planning
• Identification of Unmodeled Objects from Symbolic Descriptions