activity
20222024
most citedDeciding Cuspidality of Manipulators through Computer Algebra and Algorithms in Real Algebraic Geometry

6 citations · 8 across the 4 of their papers we have counts for

collaborators

5 papers

cs.SC2024

Algebraic and Algorithmic Methods for Computing Polynomial Loop Invariants

Erdenebayar Bayarmagnai, Fatemeh Mohammadi, Rémi Prébet

Loop invariants are properties of a program loop that hold both before and after each iteration of the loop. They are often used to verify programs and ensure that algorithms consi…

cs.SC2024

Computing roadmaps in unbounded smooth real algebraic sets II: algorithm and complexity

Rémi Prébet, Mohab Safey El Din, Éric Schost

A roadmap for an algebraic set defined by polynomials with coefficients in the field of rational numbers is an algebraic curve contained in whose intersection…

cs.SC2023★ 2 cited

Algorithm for connectivity queries on real algebraic curves

Md Nazrul Islam, Adrien Poteaux, Rémi Prébet

We consider the problem of answering connectivity queries on a real algebraic curve. The curve is given as the real trace of an algebraic curve, assumed to be in generic position,…

cs.SC2022★ 6 cited

Deciding Cuspidality of Manipulators through Computer Algebra and Algorithms in Real Algebraic Geometry

Damien Chablat, Rémi Prébet, Mohab Safey El Din +2

Cuspidal robots are robots with at least two inverse kinematic solutions that can be connected by a singularity-free path. Deciding the cuspidality of generic 3R robots has been st…

cs.SC2022

Computing roadmaps in unbounded smooth real algebraic sets I: connectivity results

Rémi Prébet, Mohab Safey El Din, Éric Schost

Answering connectivity queries in real algebraic sets is a fundamental problem in effective real algebraic geometry that finds many applications in e.g. robotics where motion plann…