Solving constrained minimum‐time robot problems using the sequential gradient restoration algorithm

DOI10.1002/OCA.4660130205zbMATH Open0769.93056OpenAlexW2131831389WikidataQ113109183 ScholiaQ113109183MaRDI QIDQ4695641FDOQ4695641

Authors: Allan Y. Lee 

Publication date: 29 June 1993

Published in: Optimal Control Applications \& Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/oca.4660130205

Recommendations

• Reliable computation of minimum-time motions for manipulators moving in obstacle fields using a successive search for minimum-overload trajectories
• Minimum-time control of robotic manipulators with geometric path constraints
• Minimum-time trajectory planning of mechanical manipulators under dynamic constraints
• Time-Optimal Path Tracking for Robots: A Convex Optimization Approach
• A convex relaxation for the time-optimal trajectory planning of robotic manipulators along predetermined geometric paths
• scientific article; zbMATH DE number 1552907
• Real time trajectory optimization for nonlinear robotic systems: relaxation and convexification
• Planning the subminimum-time motion of a robotic manipulator which avoids obstacles
• scientific article; zbMATH DE number 2033370

zbMATH Keywords

two-link manipulatorconstrained minimum-time control problems

Mathematics Subject Classification ID

Automated systems (robots, etc.) in control theory (93C85)

Cited In (3)

• Properties of the sequential gradient-restoration algorithm (SGRA). I: Introduction and comparison with related methods
• A survey of methods available for the numerical optimization of continuous dynamic systems
• Optimization of dynamic control systems using water cycle algorithm

This page was built for publication: Solving constrained minimum‐time robot problems using the sequential gradient restoration algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4695641)