Real time trajectory optimization for nonlinear robotic systems: relaxation and convexification
From MaRDI portal
Recommendations
- The convex feasible set algorithm for real time optimization in motion planning
- Trajectory planning based on non-convex global optimization for serial manipulators
- A convex relaxation for the time-optimal trajectory planning of robotic manipulators along predetermined geometric paths
- Inter-sample avoidance in trajectory optimizers using mixed-integer linear programming
- Sequential virtual motion camouflage method for nonlinear constrained optimal trajectory control
Cites work
- scientific article; zbMATH DE number 5066287 (Why is no real title available?)
- A new technique for inconsistent QP problems in the SQP method
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Revisions of constraint approximations in the successive QP method for nonlinear programming problems
Cited in
(4)- Time-Optimal Path Tracking for Robots: A Convex Optimization Approach
- The convex feasible set algorithm for real time optimization in motion planning
- Solving constrained minimum‐time robot problems using the sequential gradient restoration algorithm
- Tree Based Trajectory Optimization Based on Local Linearity of Continuous Non-Linear Dynamics
This page was built for publication: Real time trajectory optimization for nonlinear robotic systems: relaxation and convexification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1678576)