Combining discrete and continuous optimization to solve kinodynamic motion planning problems

DOI10.1007/s11081-015-9291-0zbMath1364.49053OpenAlexW2223813397MaRDI QIDQ2358063

Yanyan Li

Publication date: 21 June 2017

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11081-015-9291-0

zbMATH Keywords

optimal control problemroboticscollision avoidancetrajectory planninginitializationgraph search algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Applications of optimal control and differential games (49N90) Automated systems (robots, etc.) in control theory (93C85) Existence theories for optimal control problems involving ordinary differential equations (49J15) Robot dynamics and control of rigid bodies (70E60) Discrete approximations in optimal control (49M25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonsmooth optimization via quasi-Newton methods
• The control parameterization method for nonlinear optimal control: a survey
• Optimal control of ODEs and DAEs.
• A survey of motion planning algorithms from the perspective of autonomous UAV guidance
• Optimal control problems with a continuous inequality constraint on the state and the control
• Path planning and collision avoidance for robots
• On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function
• An adjoint-based SQP algorithm with quasi-Newton Jacobian updates for inequality constrained optimization
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• Kinodynamic motion planning
• On the Global Convergence of a Filter--SQP Algorithm
• Path-Planning with Collision Avoidance in Automotive Industry
• Planning Algorithms
• Trajectory modeling of robot manipulators in the presence of obstacles
• Nonlinear programming without a penalty function.

This page was built for publication: Combining discrete and continuous optimization to solve kinodynamic motion planning problems