Computing roadmaps in unbounded smooth real algebraic sets I: connectivity results - Sorbonne Université Access content directly
Preprints, Working Papers, ... Year : 2022

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

Abstract

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 planning issues are topical. This computational problem is tackled through the computation of so-called \emph{roadmaps} which are real algebraic subsets of the set $V$ under study, of dimension at most one, and which have a connected intersection with all semi-algebraically connected components of $V$. Algorithms for computing roadmaps rely on statements establishing connectivity properties of some well-chosen subsets of $V$, assuming that $V$ is bounded. In this paper, we extend such connectivity statements by dropping the boundedness assumption on $V$. This exploits properties of so-called \emph{generalized polar varieties}, which are critical loci of $V$ for some well-chosen polynomial maps.
Fichier principal
Vignette du fichier
main.pdf (3.01 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03508000 , version 1 (03-01-2022)
hal-03508000 , version 2 (07-03-2022)
hal-03508000 , version 3 (07-06-2023)

Identifiers

  • HAL Id : hal-03508000 , version 2

Cite

Rémi Prébet, Mohab Safey El Din, Éric Schost. Computing roadmaps in unbounded smooth real algebraic sets I: connectivity results. 2022. ⟨hal-03508000v2⟩
235 View
136 Download

Share

Gmail Facebook X LinkedIn More