7 citations · 17 across the 8 of their papers we have counts for
9 papers
First-Order Quantification over Automata
Bernard Boigelot, Pascal Fontaine, Baptiste Vergain
Deciding formulas mixing arithmetic and uninterpreted predicates is of practical interest, notably for applications in verification. Some decision procedures consist in building by…
Decidability of Difference Logic over the Reals with Uninterpreted Unary Predicates
Bernard Boigelot, Pascal Fontaine, Baptiste Vergain
First-order logic fragments mixing quantifiers, arithmetic, and uninterpreted predicates are often undecidable, as is, for instance, Presburger arithmetic extended with a single un…
An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention
Bernard Boigelot, Isabelle Mainz, Victor Marsault +1
Given an integer base , a set of integers is represented in base by a language over . The set is said to be -recognisable if its representation is a re…
From Constrained Delaunay Triangulations to Roadmap Graphs with Arbitrary Clearance
Stéphane Lens, Bernard Boigelot
This work studies path planning in two-dimensional space, in the presence of polygonal obstacles. We specifically address the problem of building a roadmap graph, that is, an abstr…
Efficient Path Interpolation and Speed Profile Computation for Nonholonomic Mobile Robots
Stéphane Lens, Bernard Boigelot
This paper studies path synthesis for nonholonomic mobile robots moving in two-dimensional space. We first address the problem of interpolating paths expressed as sequences of stra…
Min Max Generalization for Two-stage Deterministic Batch Mode Reinforcement Learning: Relaxation Schemes
Raphael Fonteneau, Damien Ernst, Bernard Boigelot +1
We study the minmax optimization problem introduced in [22] for computing policies for batch mode reinforcement learning in a deterministic setting. First, we show that this proble…