Simon Rohou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Simon Rohou has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Luc Jaulin
ENSTA Bretagne
7 shared publications - Fabrice Le Bars
ENSTA Bretagne
3 shared publications Luc Jaulin
3 shared publications- Andreas Rauh
Carl von Ossietzky Universität Oldenburg
2 shared publications Abderahmane Bedouhene
Univ. Gustave Eiffel, CNRS
1 shared publication- Alexandre Goldsztejn
CNRS, LINA, UMR 6241, Nantes, France
1 shared publication
Latest Publications
- 2 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Localisation fiable de robots : une approche de programmation par contraintes sur des systèmes dynamiques
Reliable robot localization : a constraint programming approach over dynamical systems: Aujourd’hui, la localisation de robots sous-marins demeure une tâche complexe. L’utilisation de capteurs habituels est impossible sous la surface, tels que ceux reposant sur les systèmes de géolocalisation par satellites. Les approches inertielles sont quant à elles limitées par leur forte dérive dans le temps. De plus, les fonds marins sont généralement homogènes et non structurés, rendant difficile l’utilisation de méthodes SLAM connues, qui couplent la localisation et la cartographie de manière simultanée. Il devient donc nécessaire d’explorer de nouvelles alternatives. Notre approche consiste à traiter un problème de SLAM de manière purement temporelle. L’originalité de ce travail est de représenter le temps comme une variable classique qu’il faut estimer. Cette stratégie soulève de nouvelles opportunités dans le domaine de l’estimation d’état, permettant de traiter de nombreux problèmes sous un autre angle. Toutefois, une telle résolution temporelle demande un ensemble d’outils théoriques qu’il convient de développer. Cette thèse n’est donc pas seulement une contribution dans le monde de la robotique mobile, elle propose également une nouvelle démarche dans les domaines de la propagation de contraintes et des méthodes ensemblistes. Cette étude apporte de nouveaux outils de programmation par contracteurs qui permettent le développement de solveurs pour des systèmes dynamiques. Les composants étudiés sont mis en application tout au long de ce document autours de problèmes robotiques concrets.
- 2 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Localisation fiable de robots : une approche de programmation par contraintes sur des systèmes dynamiques
Reliable robot localization : a constraint programming approach over dynamical systems: Aujourd’hui, la localisation de robots sous-marins demeure une tâche complexe. L’utilisation de capteurs habituels est impossible sous la surface, tels que ceux reposant sur les systèmes de géolocalisation par satellites. Les approches inertielles sont quant à elles limitées par leur forte dérive dans le temps. De plus, les fonds marins sont généralement homogènes et non structurés, rendant difficile l’utilisation de méthodes SLAM connues, qui couplent la localisation et la cartographie de manière simultanée. Il devient donc nécessaire d’explorer de nouvelles alternatives. Notre approche consiste à traiter un problème de SLAM de manière purement temporelle. L’originalité de ce travail est de représenter le temps comme une variable classique qu’il faut estimer. Cette stratégie soulève de nouvelles opportunités dans le domaine de l’estimation d’état, permettant de traiter de nombreux problèmes sous un autre angle. Toutefois, une telle résolution temporelle demande un ensemble d’outils théoriques qu’il convient de développer. Cette thèse n’est donc pas seulement une contribution dans le monde de la robotique mobile, elle propose également une nouvelle démarche dans les domaines de la propagation de contraintes et des méthodes ensemblistes. Cette étude apporte de nouveaux outils de programmation par contracteurs qui permettent le développement de solveurs pour des systèmes dynamiques. Les composants étudiés sont mis en application tout au long de ce document autours de problèmes robotiques concrets.
- Open Access
- 20 June 2025
- Published by Elsevier in Mechatronics
- Vol. 110
Natural efficient gaits from Nonholonomic Locomotion Nonlinear Normal Mode (NL-NNM): The Pendrivencar case
- 20 June 2025
- Published by Elsevier in Mechatronics
- Vol. 110
Open AccessNatural efficient gaits from Nonholonomic Locomotion Nonlinear Normal Mode (NL-NNM): The Pendrivencar case
- 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.
- 22 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 68 (11) , 6937-6943
Brunovsky Decomposition for Dynamic Interval Localization
This article proposes a new set-membership method for estimating the trajectories of dynamical systems, when the states are completely unknown and only nonlinear observations are available. The first part of the proposed method is symbolic and follows the decomposition of Brunovsky, i.e., it decomposes the set of differential equations describing the dynamical system into two blocks of constraints: one block gathers nonlinear analytical equations that do not involve differential operators, while the other block is composed of linear chains of integrators. The second part of the method, which relies on the symbolic decomposition, is numerical and based on a contractor approach. It involves a specific optimal operator for narrowing the sets of feasible solutions. This approach is shown to be efficient on a difficult problem of dynamic localization of a mobile robot, without any prior knowledge about its states.
- 22 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 68 (11) , 6937-6943
Brunovsky Decomposition for Dynamic Interval Localization
This article proposes a new set-membership method for estimating the trajectories of dynamical systems, when the states are completely unknown and only nonlinear observations are available. The first part of the proposed method is symbolic and follows the decomposition of Brunovsky, i.e., it decomposes the set of differential equations describing the dynamical system into two blocks of constraints: one block gathers nonlinear analytical equations that do not involve differential operators, while the other block is composed of linear chains of integrators. The second part of the method, which relies on the symbolic decomposition, is numerical and based on a contractor approach. It involves a specific optimal operator for narrowing the sets of feasible solutions. This approach is shown to be efficient on a difficult problem of dynamic localization of a mobile robot, without any prior knowledge about its states.
- Open Access
- 1 April 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (7) , 1130
Proving Feasibility of a Docking Mission: A Contractor Programming Approach
Recent advances in computational power, algorithms, and sensors allow robots to perform complex and dangerous tasks, such as autonomous missions in space or underwater. Given the high operational costs, simulations are run beforehand to predict the possible outcomes of a mission. However, this approach is limited as it is based on parameter space discretization and therefore cannot be considered a proof of feasibility. To overcome this limitation, set-membership methods based on interval analysis, guaranteed integration, and contractor programming have proven their efficiency. Guaranteed integration algorithms can predict the possible trajectories of a system initialized in a given set in the form of tubes of trajectories. The contractor programming consists in removing the trajectories violating predefined constraints from a system’s tube of possible trajectories. Our contribution consists in merging both approaches to allow for the usage of differential constraints in a contractor programming framework. We illustrate our method through examples related to robotics. We also released an open-source implementation of our algorithm in a unified library for tubes, allowing one to combine it with other constraints and increase the number of possible applications.
- 1 April 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (7) , 1130
Open AccessProving Feasibility of a Docking Mission: A Contractor Programming Approach
Recent advances in computational power, algorithms, and sensors allow robots to perform complex and dangerous tasks, such as autonomous missions in space or underwater. Given the high operational costs, simulations are run beforehand to predict the possible outcomes of a mission. However, this approach is limited as it is based on parameter space discretization and therefore cannot be considered a proof of feasibility. To overcome this limitation, set-membership methods based on interval analysis, guaranteed integration, and contractor programming have proven their efficiency. Guaranteed integration algorithms can predict the possible trajectories of a system initialized in a given set in the form of tubes of trajectories. The contractor programming consists in removing the trajectories violating predefined constraints from a system’s tube of possible trajectories. Our contribution consists in merging both approaches to allow for the usage of differential constraints in a contractor programming framework. We illustrate our method through examples related to robotics. We also released an open-source implementation of our algorithm in a unified library for tubes, allowing one to combine it with other constraints and increase the number of possible applications.
- Open Access
- 25 March 2022
- Published by Frontiers Media SA in Frontiers in Control Engineering
- Vol. 3
An Ellipsoidal Predictor–Corrector State Estimation Scheme for Linear Continuous-Time Systems With Bounded Parameters and Bounded Measurement Errors
For linear time-invariant dynamic systems with exactly known coefficients of their system matrices for which measurements with bounded errors are available at discrete time instants, an optimal polygonal state estimation scheme was recently published. This scheme allows for tightly enclosing all possible state trajectories in presence of uncertain, but bounded, system inputs which may be varying arbitrarily within in their bounds. Moreover, this approach is also capable of accounting for uncertainty related to the measurement time instants. However, the drawback of this polygonal technique is its rapidly increasing complexity for larger system dimensions. For that reason, the polygonal state enclosures are replaced by a computationally less expensive, but nearly optimal, ellipsoidal enclosure technique in this paper. Numerical simulations for representative benchmark examples focusing both on applications with precisely known and uncertain parameters conclude this contribution.
- 25 March 2022
- Published by Frontiers Media SA in Frontiers in Control Engineering
- Vol. 3
Open AccessAn Ellipsoidal Predictor–Corrector State Estimation Scheme for Linear Continuous-Time Systems With Bounded Parameters and Bounded Measurement Errors
For linear time-invariant dynamic systems with exactly known coefficients of their system matrices for which measurements with bounded errors are available at discrete time instants, an optimal polygonal state estimation scheme was recently published. This scheme allows for tightly enclosing all possible state trajectories in presence of uncertain, but bounded, system inputs which may be varying arbitrarily within in their bounds. Moreover, this approach is also capable of accounting for uncertainty related to the measurement time instants. However, the drawback of this polygonal technique is its rapidly increasing complexity for larger system dimensions. For that reason, the polygonal state enclosures are replaced by a computationally less expensive, but nearly optimal, ellipsoidal enclosure technique in this paper. Numerical simulations for representative benchmark examples focusing both on applications with precisely known and uncertain parameters conclude this contribution.
- 1 July 2021
- Published by Elsevier in Systems & Control Letters
- Vol. 153
Exact bounded-error continuous-time linear state estimator
- 1 July 2021
- Published by Elsevier in Systems & Control Letters
- Vol. 153
Exact bounded-error continuous-time linear state estimator
- Open Access
- 2 September 2020
- Published by Springer Nature
- p. 548-565
Towards a Generic Interval Solver for Differential-Algebraic CSP
- 2 September 2020
- Published by Springer Nature
- p. 548-565
Open AccessTowards a Generic Interval Solver for Differential-Algebraic CSP
- Open Access
- 1 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4393-4399
Set-membership state estimation by solving data association
This paper deals with the localization problem of a robot in an environment made of indistinguishable landmarks, and assuming the initial position of the vehicle is unknown. This scenario is typically encountered in underwater applications for which landmarks such as rocks all look alike. Furthermore, the position of the robot may be lost during a diving phase, which obliges us to consider unknown initial position. We propose a deterministic approach to solve simultaneously the problems of data association and state estimation, without combinatorial explosion. The efficiency of the method is shown on an actual experiment involving an underwater robot and sonar data.
- 1 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4393-4399
Open AccessSet-membership state estimation by solving data association
This paper deals with the localization problem of a robot in an environment made of indistinguishable landmarks, and assuming the initial position of the vehicle is unknown. This scenario is typically encountered in underwater applications for which landmarks such as rocks all look alike. Furthermore, the position of the robot may be lost during a diving phase, which obliges us to consider unknown initial position. We propose a deterministic approach to solve simultaneously the problems of data association and state estimation, without combinatorial explosion. The efficiency of the method is shown on an actual experiment involving an underwater robot and sonar data.