The determination of nonconvex workspaces of generally constrained planar Stewart platforms
From MaRDI portal
Publication:1591940
DOI10.1016/S0898-1221(00)85015-4zbMath0970.70006OpenAlexW1979106874MaRDI QIDQ1591940
Publication date: 14 January 2001
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0898-1221(00)85015-4
planar parallel manipulatordynamic constrained optimization algorithmnonconvex workspaceplanar Stewart platform
Numerical optimization and variational techniques (65K10) Kinematics of mechanisms and robots (70B15)
Related Items (3)
The chord method for the determination of nonconvex workspaces of planar parallel manipulators ⋮ Optimal structural design of a planar parallel platform for machining ⋮ A geometrical alternative to Jacobian rank deficiency method for planar workspace characterisation
Cites Work
- An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
- A new and dynamic method for unconstrained minimization
- A dynamic penalty function method for the solution of structural optimization problems
- The LFOPC leap-frog algorithm for constrained optimization
This page was built for publication: The determination of nonconvex workspaces of generally constrained planar Stewart platforms
