A Method for the Complete Set of Solutions of the Finite-Position Synthesis Problem
View/Open
CompleteFPSynthesisFinal.pdf (709,2Kb) (Restricted access)
Request copy
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Cita com:
hdl:2117/376314
Document typePart of book or chapter of book
Defense date2022
PublisherSpringer
Rights accessRestricted access - publisher's policy
This work is protected by the corresponding intellectual and industrial property rights.
Except where otherwise noted, its contents are licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 4.0 International
Abstract
The equations that appear in the formulation of finite-position synthesis problems tend to increase their complexity and become quite large when solving for multiple-joint systems. In this work, we create a new set of equations that are suited to find all solutions for very large synthesis problems, targeting interval branch-and-cut algorithms. We obtain a system of equations in which all the variables are naturally bounded. Here we present the formulation and preliminary results, while its application to interval analysis is still a work in progress.
CitationPerez Gracia, A. A Method for the Complete Set of Solutions of the Finite-Position Synthesis Problem. A: "Advances in Robot Kinematics 2022". Berlín: Springer, 2022, p. 286-293.
ISBN978-3-031-08140-8
Publisher versionhttps://link.springer.com/book/10.1007/978-3-031-08140-8
Files | Description | Size | Format | View |
---|---|---|---|---|
CompleteFPSynthesisFinal.pdf![]() | 709,2Kb | Restricted access |