Damien Massé

Dr. Damien Massé

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 June 2018 in Advances in Operations Research
Verified
Journal Article
Open access
PDF file
LLLaurent Lemarchand
Laurent Lemarchand
DMDamien Massé
Damien Massé
PRPascal Rebreyend
Pascal Rebreyend
JHJohan Håkansson
Johan Håkansson
We propose modelling for a facilities localization problem in the context of multimode transportation. The applicative goal is to locate service facilities such as schools or hospitals while optimizing the different transportation modes to these facilities. We formalize the School Problem and solve it first exactly using an adapted ϵ-constraint multiobjective method. Because of the size of the instances considered, we have also explored the use of heuristic methods based on evolutionary multiobjective frameworks, namely, NSGA2 and a modified version of PAES. Those methods are mixed with an original local search technique to provide better results. Numerical comparisons of solutions sets quality are made using the hypervolume metric. Based on the results for test-cases that can be solved exactly, efficient implementation for PAES and NSGA2 allows execution times comparison for large instances. Results show good performances for the heuristic approaches as compared to the exact algorithm for small test-cases. Approximate methods present a scalable behavior on largest problem instances. A master/slave parallelization scheme also helps to reduce execution times significantly for the modified PAES approach.

8 March 2022 in Algorithms
Verified
Journal Article
Open access
PDF file
TMThomas Le Mezo
Thomas Le Mezo
LJLuc Jaulin
Luc Jaulin
DMDamien Massé
Damien Massé
BZBenoit Zerr
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.

19 December 2025 in Acta Cybernetica
Verified
Journal Article
Open access
PDF file
MGMaël Godard
Maël Godard
LJLuc Jaulin
Luc Jaulin
DMDamien Massé
Damien Massé
Calculating directly the inner and outer approximation of the image of a set by a function can be challenging. Then, it is sometimes preferred to compute the image of the boundary of the set instead. However, boundary-based methods are subject to the apparition of fake boundaries in the image set. These fake boundaries add pessimism when characterizing the inner approximation of the image set. This paper then introduces the notion of Box Chains to simplify the detection and the suppression of the fake boundaries. The characterization of the inner and outer approximation of the image set in the case of a function from the unit disk D to R2 will be considered, with two examples.

17 June 2026 in International Journal of Approximate Reasoning
Verified
Journal Article
Closed access
MGMaël Godard
Maël Godard
LJLuc Jaulin
Luc Jaulin
DMDamien Massé
Damien Massé

26 November 2024 in arXiv
Verified
Preprint
Open access
PDF file
MGMaël Godard
Maël Godard
LJLuc Jaulin
Luc Jaulin
DMDamien Massé
Damien Massé
In engineering, models are often used to represent the behavior of a system. Estimators are then needed to approximate the values of the model's parameters based on observations. This approximation implies a difference between the values predicted by the model and the observations that have been made. It creates an uncertainty that can lead to dangerous decision making. Interval analysis tools can be used to guarantee some properties of an estimator, even when the estimator itself doesn't rely on interval analysis (Adam, 2019) (Adam, 2015). This paper contributes to this dynamic by proposing an interval-based and guaranteed method to validate a nonlinear estimator. It is based on the Moore-Skelboe algorithm (van Emden, 2004). This method returns a guaranteed maximum error that the estimator will never exceed. We will show that we can guarantee properties even when working with non-guaranteed estimators such as neural networks.