4,563 research outputs found
A Branch and Prune Algorithm for the Computation of Generalized Aspects of Parallel Robots
International audienceParallel robots enjoy enhanced mechanical characteristics that have to be contrasted with a more complicated design. In particular, they often have parallel singularities at some poses, and the robots may become uncontrollable, and could even be damaged, in such configurations. The computation of the connected components in the set of nonsingular reachable configurations, called generalized aspects, is therefore a key issue in their design. This paper introduces a new method, based on numerical constraint programming, to compute a certified enclosure of the generalized aspects. Though this method does not allow counting their number rigorously, it constructs inner approximations of the nonsingular workspace that allow commanding parallel robots safely. It also provides a lower-bound on the exact number of generalized aspects. It is moreover the first general method able to handle any parallel robot in theory, though its computational complexity currently restricts its usage to robots with three degrees of freedom. Finally, the contraint programming paradigm it relies on makes it possible to consider various additional constraints (e.g., collision avoidance), making it suitable for practical considerations
Solution intervals for variables in spatial RCRCR linkages
© 2019. ElsevierAn analytic method to compute the solution intervals for the input variables of spatial RCRCR linkages and their inversions is presented. The input-output equation is formulated as the intersection of a single ellipse with a parameterized family of ellipses, both related with the possible values that certain dual angles determined by the configuration of the mechanism can take. Bounds for the angles of the input pairs of the RCRCR and RRCRC inversions are found by imposing the tangency of two ellipses, what reduces to analyzing the discriminant of a fourth degree polynomial. The bounds for the input pair of the RCRRC inversion is found as the intersection of a single ellipse with the envelope of the parameterized family of ellipses. The method provides the bounds of each of the assembly modes of the mechanism as well as the local extrema that may exist for the input variablePeer ReviewedPostprint (author's final draft
Probabilistic constraint reasoning with Monte Carlo integration to robot localization
This work studies the combination of safe and probabilistic reasoning through the hybridization of Monte Carlo integration techniques with continuous constraint programming. In continuous constraint programming there are variables ranging over continuous domains (represented as intervals) together with constraints over them (relations between variables) and the goal is to find values for those variables that satisfy all the constraints (consistent scenarios). Constraint programming “branch-and-prune” algorithms produce safe enclosures of all consistent scenarios. Special proposed algorithms for probabilistic constraint reasoning compute the probability of sets of consistent scenarios which imply the calculation of an integral over these sets (quadrature). In this work we propose to extend the “branch-and-prune” algorithms with Monte Carlo integration techniques to compute such probabilities. This approach can be useful in robotics for localization problems. Traditional approaches are based on probabilistic techniques that search the most likely scenario, which may not satisfy the model constraints. We show how to apply our approach in order to cope with this problem and provide functionality in real time
An algebraic method to check the singularity-free paths for parallel robots
Trajectory planning is a critical step while programming the parallel
manipulators in a robotic cell. The main problem arises when there exists a
singular configuration between the two poses of the end-effectors while
discretizing the path with a classical approach. This paper presents an
algebraic method to check the feasibility of any given trajectories in the
workspace. The solutions of the polynomial equations associated with the
tra-jectories are projected in the joint space using Gr{\"o}bner based
elimination methods and the remaining equations are expressed in a parametric
form where the articular variables are functions of time t unlike any numerical
or discretization method. These formal computations allow to write the Jacobian
of the manip-ulator as a function of time and to check if its determinant can
vanish between two poses. Another benefit of this approach is to use a largest
workspace with a more complex shape than a cube, cylinder or sphere. For the
Orthoglide, a three degrees of freedom parallel robot, three different
trajectories are used to illustrate this method.Comment: Appears in International Design Engineering Technical Conferences &
Computers and Information in Engineering Conference , Aug 2015, Boston,
United States. 201
Workspace Computation of Planar Continuum Parallel Robots
Continuum parallel robots (CPRs) comprise several flexible beams connected in parallel to an end-effector. They combine the inherent compliance of continuum robots with the high payload capacity of parallel robots. Workspace characterization is a crucial point in the performance evaluation of CPRs. In this paper, we propose a methodology for the workspace evaluation of planar continuum parallel robots (PCPRs), with focus on the constant-orientation workspace. An explorative algorithm, based on the iterative solution of the inverse geometrico-static problem is proposed for the workspace computation of a generic PCPR. Thanks to an energy-based modelling strategy, and derivative approximation by finite differences, we are able to apply the Kantorovich theorem to certify the existence, uniqueness, and convergence of the solution of the inverse geometrico-static problem at each step of the procedure. Three case studies are shown to demonstrate the effectiveness of the proposed approach
- …