Variational Path Optimization of Linear Pentapods with a Simple Singularity Variety
October 10, 2019 Β· Declared Dead Β· π Mechanism and Machine Theory
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Arvin Rasoulzadeh, Georg Nawratil
arXiv ID
1910.04810
Category
math.OC: Optimization & Control
Cross-listed
cs.RO
Citations
9
Venue
Mechanism and Machine Theory
Last Checked
4 months ago
Abstract
The class of linear pentapods with a simple singularity variety is obtained by imposing architectural restrictions on the design in such a way that the manipulators singularity variety is linear in orientation position variables. It turns out that such simplification leads to crucial computational advantages while maintaining the machines applications in some fundamental industrial tasks such as five axis milling and laser cutting. We assume that a path between a given start and end pose of the end effector is known which is singularity free and within the manipulators workspace. An optimization process of the initial path is proposed in such a way that the parallel robot increases its distance to the singularity loci while the motion is being smoothed. In our case the computation time of the optimization is improved as we are dealing with pentapods having simple singularity varieties allowing a closed form solution for the local exterma of the singularity distance function. Formally this process is called variational path optimization which is the systematic optimization of a path by manipulating its variations of energy and distance to the obstacle which in this case is the singularity variety. In this process some physical limits of the mechanical joints are also taken into account.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Optimization & Control
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Local SGD Converges Fast and Communicates Little
R.I.P.
π»
Ghosted
On Lazy Training in Differentiable Programming
π
π
The Cartographer
A Review on Bilevel Optimization: From Classical to Evolutionary Approaches and Applications
R.I.P.
π»
Ghosted
Learned Primal-dual Reconstruction
R.I.P.
π»
Ghosted
On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transport
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted