Fabrice Le Bars
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Fabrice Le Bars has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Luc Jaulin
ENSTA Bretagne
4 shared publications - Simon Rohou
ENSTA Bretagne, Lab-STICC, UMR CNRS, Brest, France
3 shared publications Luc Jaulin
ENSTA
2 shared publications- Quentin Brateau
ENSTA
2 shared publications Benoît Desrochers
ENSTA Bretagne
1 shared publication- Damien Esnault1 shared publication
Latest Publications
- 1 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Oceanic Engineering
- Vol. 51 (2) , 1129-1138
Navigation Without Localization Using Stable Cycles
Navigating autonomous robots in GNSS-denied environments, such as underwater, remains a fundamental challenge due to the lack of reliable localization. Classical approaches rely on exteroceptive sensors and complex state estimation pipelines, which are often computationally expensive, not-precise, and unsuitable for stealthy or resource-constrained platforms. In this article, we propose a novel, frugal navigation paradigm based on stable cycles, inspired by biological navigation strategies observed in migratory animals. Our method enables a robot to follow and stabilize a predefined cycle in the environment without requiring explicit state estimation. A timed automaton is used to generate control inputs that drive the robot along a discretized cycle, which is then stabilized in the world frame using sparse environmental measurements. We formally describe this cycle-based control framework, provide a proof of its stability, and validate the approach experimentally on a real robot. This work opens a new direction for low-cost, low-observability robotic navigation in unstructured and GNSS-denied environments.
- 1 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Oceanic Engineering
- Vol. 51 (2) , 1129-1138
Navigation Without Localization Using Stable Cycles
Navigating autonomous robots in GNSS-denied environments, such as underwater, remains a fundamental challenge due to the lack of reliable localization. Classical approaches rely on exteroceptive sensors and complex state estimation pipelines, which are often computationally expensive, not-precise, and unsuitable for stealthy or resource-constrained platforms. In this article, we propose a novel, frugal navigation paradigm based on stable cycles, inspired by biological navigation strategies observed in migratory animals. Our method enables a robot to follow and stabilize a predefined cycle in the environment without requiring explicit state estimation. A timed automaton is used to generate control inputs that drive the robot along a discretized cycle, which is then stabilized in the world frame using sparse environmental measurements. We formally describe this cycle-based control framework, provide a proof of its stability, and validate the approach experimentally on a real robot. This work opens a new direction for low-cost, low-observability robotic navigation in unstructured and GNSS-denied environments.
- Open Access
- 26 November 2025
- Published by University of Szeged in Acta Cybernetica
- Vol. 27 (3) , 475-492
Considering Adjacent Sets for Computing the Visibility Region
This paper explores the problem of the paving of the union of adjacent contractors. The focus is first put on the analysis of the topology of a set operator, which can be stable or not stable. Then, depending on the stability of the union operator, solutions are proposed to avoid fake boundaries in stable and non-stable union of sets. For stable unions of sets, a boundary preserving form will be developed to add a set overlapping the fake boundary in the expression of the union, whereas for non-stable union of sets, a boundary approach will be developed to avoid fake boundaries. Some problem-specific solutions are also developed to avoid fake boundaries. As an example, an enhancement of the separator on the visibility constraint is proposed. This avoids fake boundaries while characterizing the set of non-visible points from an observation point relative to a polygon.
- 26 November 2025
- Published by University of Szeged in Acta Cybernetica
- Vol. 27 (3) , 475-492
Open AccessConsidering Adjacent Sets for Computing the Visibility Region
This paper explores the problem of the paving of the union of adjacent contractors. The focus is first put on the analysis of the topology of a set operator, which can be stable or not stable. Then, depending on the stability of the union operator, solutions are proposed to avoid fake boundaries in stable and non-stable union of sets. For stable unions of sets, a boundary preserving form will be developed to add a set overlapping the fake boundary in the expression of the union, whereas for non-stable union of sets, a boundary approach will be developed to avoid fake boundaries. Some problem-specific solutions are also developed to avoid fake boundaries. As an example, an enhancement of the separator on the visibility constraint is proposed. This avoids fake boundaries while characterizing the set of non-visible points from an observation point relative to a polygon.
- 21 March 2024
- Published by University of Szeged in Acta Cybernetica
- Vol. 26 (4) , 871-887
The Codac Library
Codac (Catalog Of Domains And Contractors) is a C++/Python library providing tools for constraint programming over reals, trajectories and sets. It has many applications in parameter estimation, guaranteed integration or robot localization and provides reliable outputs by computing sets of feasible solutions according to the constraints defining the problem. This paper provides a brief overview of the library and its Contractor Network approach, illustrated on a convincing robotic application.
- 21 March 2024
- Published by University of Szeged in Acta Cybernetica
- Vol. 26 (4) , 871-887
The Codac Library
Codac (Catalog Of Domains And Contractors) is a C++/Python library providing tools for constraint programming over reals, trajectories and sets. It has many applications in parameter estimation, guaranteed integration or robot localization and provides reliable outputs by computing sets of feasible solutions according to the constraints defining the problem. This paper provides a brief overview of the library and its Contractor Network approach, illustrated on a convincing robotic application.
- 1 January 2020
- Published by University of Szeged in Acta Cybernetica
- Vol. 24 (3) , 431-448
Characterizing Sliding Surfaces of Cyber-Physical Systems
When implementing a non-continuous controller for a cyber-physical system, it may happen that the evolution function of the closed-loop system is not anymore piecewise continuous along the trajectory, mainly due to if statements inside the control algorithm. As a consequence, an unwanted chattering effect may occur. This behavior is often difficult to observe even in simulation. We propose here a set-membership method based on interval analysis to detect different types of discontinuities. One of them is the sliding surface where the state trajectory jumps indefinitely between two distinct behaviors. As an application, we consider the validation of a sailboat controller. We show that our approach is able to detect and explain some unwanted sliding effects that may be observed in rare and specific situations on our actual sailboat robots.
- 1 January 2020
- Published by University of Szeged in Acta Cybernetica
- Vol. 24 (3) , 431-448
Characterizing Sliding Surfaces of Cyber-Physical Systems
When implementing a non-continuous controller for a cyber-physical system, it may happen that the evolution function of the closed-loop system is not anymore piecewise continuous along the trajectory, mainly due to if statements inside the control algorithm. As a consequence, an unwanted chattering effect may occur. This behavior is often difficult to observe even in simulation. We propose here a set-membership method based on interval analysis to detect different types of discontinuities. One of them is the sliding surface where the state trajectory jumps indefinitely between two distinct behaviors. As an application, we consider the validation of a sailboat controller. We show that our approach is able to detect and explain some unwanted sliding effects that may be observed in rare and specific situations on our actual sailboat robots.
- Open Access
- 1 July 2017
- Published by Elsevier in Robotics and Autonomous Systems
- Vol. 93, 76-84
Guaranteed computation of robot trajectories
- 1 July 2017
- Published by Elsevier in Robotics and Autonomous Systems
- Vol. 93, 76-84
Open AccessGuaranteed computation of robot trajectories
- Open Access
- 1 March 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Using interval methods in the context of robust localization of underwater robots
In this paper we will apply interval methods to solve the problem of robust localization of an underwater robot. The localization problem is cast into a constraint satisfaction problem (CSP) where constraint propagation algorithms are particularly efficient. The method is designed to work in real environments with numerous outliers. Besides, we used a new approach to represent the map by a binary image. This allow us to represent even unstructured maps. We tested the algorithm on a real data set gathered by an underwater robot in a marina located in Costa Brava.
- 1 March 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Open AccessUsing interval methods in the context of robust localization of underwater robots
In this paper we will apply interval methods to solve the problem of robust localization of an underwater robot. The localization problem is cast into a constraint satisfaction problem (CSP) where constraint propagation algorithms are particularly efficient. The method is designed to work in real environments with numerous outliers. Besides, we used a new approach to represent the map by a binary image. This allow us to represent even unstructured maps. We tested the algorithm on a real data set gathered by an underwater robot in a marina located in Costa Brava.