TMThomas Le Mézo

Thomas Le Mézo

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Thomas Le Mézo has a total of 16 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Bracketing largest invariant sets of dynamical systems : an application to drifting underwater robots in ocean currents

    by Thomas Le MézO

    Encadrement des plus grands ensembles invariants de systèmes dynamiques : une application aux robots sous-marins dérivant dans les courants océaniques: La vérification de la sûreté de fonctionnement des systèmes robotiques est une question fondamentale pour le développement de la robotique. Elle consiste, par exemple, à vérifier qu’une loi de commande d’un robot respectera toujours un ensemble de contraintes. Plus généralement, nous nous intéresserons ici à la vérification des propriétés de systèmes dynamiques, ces derniers permettant de modéliser l’évolution d’un robot. La contribution principale de cette thèse est d’apporter un nouveau moyen d’encadrer les ensembles invariants de systèmes dynamiques. Pour cela, un nouveau domaine abstrait, les mazes, et de nouveaux algorithmes sont présentés. Il est également montré, au travers de nombreux exemples, comment des problèmes classiques de validation peuvent être ramenés à un problème d’encadrement d’ensembles invariants. Enfin, les résultats sont étendus à l’encadrement des noyaux de viabilités.Cette thèse s’appuie également sur une application en robotique sous-marine. L’idée principale est d’utiliser les courants marins pour qu’un robot sous-marin puisse parcourir avec efficience de grandes distances. Un nouveau type de robot autonome bas coûts a été développé pour ce type de mission. Ce nouveau flotteur profileur hybride est capable de se réguler en profondeur grâce à une nouvelle loi de régulation, mais également de corriger sa trajectoire à l’aide de propulseurs auxiliaires. Ils permettent au robot de choisir la bonne veine de courant à emprunter.Les outils de validations précédemment introduits sont utilisés pour valider la sûreté du robot et de la mission. Des expérimentations en conditions réelles ont également permis de valider le prototype.


  • Open Access

    Unraveling Major Questions in Micronekton Ecology and Their Role in the Biological Carbon Pump Through Integrative Approaches and Autonomous Monitoring

    by Pavanee Annasawmy, Guillaume Chandelier, Thomas Le Mézo

    Micronekton consist of crustaceans, cephalopods, gelatinous organisms, and fishes that are 2–20 cm in size (Figure 1). These organisms have unique functional traits that impact their vertical migration patterns and ecosystem processes (Aparecido et al., 2023). Our understanding of their potential carbon transport and sequestration from the epipelagic (upper 200 m) to mesopelagic zones (200–1,000 m) or deeper (e.g., Boyd et al., 2019; Le Moigne, 2019; Cavan et al., 2019) is limited by the tools traditionally used to assess their biomass, diversity, and varied migration patterns (e.g., Annasawmy et al., 2019, 2024; Barbin et al., 2024; Eduardo et al., 2024). These knowledge gaps are notable considering that micronekton are ubiquitous throughout the world ocean.

  • Open Access

    Kleene Algebra to Compute Invariant Sets of Dynamical Systems

    by Thomas Le Mézo, Luc Jaulin, Damien Massé, Benoit Zerr

    In this paper, we show that a basic fixed point method used to enclose the greatest fixed point in a Kleene algebra will allow us to compute inner and outer approximations of invariant-based sets for continuous-time nonlinear dynamical systems. Our contribution is to provide the definitions and theorems that will allow us to make the link between the theory of invariant sets and the Kleene algebra. This link has never be done before and will allow us to compute rigorously sets that can be defined as a combination of positive invariant sets. Some illustrating examples show the nice properties of the approach.


  • Open Access

    Optimization of Acoustic Communication Links for a Swarm of AUVs: The COMET and NEMOSENS Examples

    by Camila M. G. Gussen, Christophe Laot, François-Xavier Socheleau, Benoît Zerr, Thomas Le Mézo, Raphaël Bourdon, Céline Le Berre

    Underwater acoustic communication is a key point for performance improvement in an autonomous underwater vehicle (AUV) swarm. The communication process is essential for improving the AUVs localization accuracy for navigation and is a convenient way for sharing information among the AUVs in a network. The objective of this work, which was developed in the COMET and NEMOSENS projects, is to address the communication process required in a mobile underwater wireless network, with a focus on the proposal of an adaptive physical layer methodology. We discuss about the employed channel access method, the frame structure, and we propose the usage of an adaptive guard interval in order to ameliorate the network usage rate. We explain the physical layer aspect of the communication: the data processing at the transmitter and receiver side. In addition to that, we propose the usage of smart communications among AUVs. We design a method for adapting some physical layer parameters. The proposed approach relies only on the knowledge of the transmission geometry, and it optimizes the number of subcarriers and the cyclic-prefix length of the Orthogonal Frequency-Division Multiplexing (OFDM) system. The obtained results show a performance improvement in terms of bit-error rate when compared with the case of random parameters selection. These results corroborate the benefits of our adaptive parameters approach.


  • Open Access

    Design and control of a low-cost autonomous profiling float

    by Thomas Le Mézo, Gilles Le Maillot, Thierry Ropert, Luc Jaulin, Aurélien Ponte, Benoît Zerr

    This paper presents the development made around the SeaBot, a new low-cost profiling float design for shallow water. We introduce a simplified dynamical model of the float and propose a state feedback depth controller coupled with an Extended Kalman Filter (EKF) to estimate model parameters. We show experimental results of the depth control that validate the model and the controller. We finally propose a loop design method to build low-cost floats by highlighting key design choices along with design rules.


  • Bracketing backward reach sets of a dynamical system

    by Thomas Le Mézo, Luc Jaulin, Benoît Zerr

    In this paper, we present a new method for bracketing (i.e. characterising from inside and from outside) backward reach set of the target region T of a continuous-time dynamical system. The principle of the method is to formalise the problem as a constraint network, where the variables are the trajectories (or paths) of the system. The resolution is made possible by using mazes which is a set of paths that contain all solutions of the problem. As a result, we will be able to derive a method able to compute a backward reach set for a huge class of systems without any knowledge of a parametric Lyapunov function and without assuming any linearity for our system. The method will be illustrated in several examples.


  • An Interval Approach to Compute Invariant Sets

    by Thomas Le Mezo, Luc Jaulin, Benoit Zerr

    This paper proposes an original interval-based method to compute an outer approximation of all invariant sets (such as limit cycles) of a continuous-time nonlinear dynamic system, which are included inside a prior set of the state space. Contrary to all other existing approaches, our method has the following properties: first, it is guaranteed (a solution cannot be lost); second, it is applicable to a large class of systems without any specific assumption such as the knowledge of a Lyapunov function or any partial linearity; and third, there is no need to integrate the system.


  • An interval approach to solve an initial value problem

    by Thomas Le Mézo, Luc Jaulin, Benoît Zerr

    This paper proposes an original guaranteed interval-based method to solve an Initial Value Problem (IVP) for ordinary differential equations (ODE). Our method uses the geometrical properties of the vector field given by the ODE and a state space discretization to compute an enclosure of the trajectories set that verifies the IVP problem.