Mathieu Balesdent
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Mathieu Balesdent has a total of 71 co-authors. Here are the top co-authors by number of shared publications:
- Loïc Brevault
ONERA DTIS, Université Paris-Saclay, Paris, France
14 shared publications Loïc Brevault
9 shared publications- Jérôme Morio
Université de Toulouse
4 shared publications - Annafederica Urbano
Fédération ENAC ISAE-SUPAERO ONERA, Université de Toulouse, Toulouse, France
3 shared publications - Rodolphe Le Riche
CNRS, Saint-Etienne, France
3 shared publications Sébastien Defoort
3 shared publications
Latest Publications
- Open Access
- 22 October 2026
- Published by Elsevier in Acta Astronautica
- Vol. 251, 652-674
A methodology for integrating Life Cycle Assessment into a Multidisciplinary Design Analysis and Optimization framework for sustainable launcher development
- 22 October 2026
- Published by Elsevier in Acta Astronautica
- Vol. 251, 652-674
Open AccessA methodology for integrating Life Cycle Assessment into a Multidisciplinary Design Analysis and Optimization framework for sustainable launcher development
- 9 September 2026
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 463
Active learning strategy for excursion-set confidence regions of functional simulator outputs
- 9 September 2026
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 463
Active learning strategy for excursion-set confidence regions of functional simulator outputs
- Open Access
- 2 September 2026
- Published by The Open Journal in Journal of Open Source Software
- Vol. 11 (125) , 10484
OpenTURNS: A Python package for uncertainty quantification
- 2 September 2026
- Published by The Open Journal in Journal of Open Source Software
- Vol. 11 (125) , 10484
Open AccessOpenTURNS: A Python package for uncertainty quantification
- Open Access
- 22 August 2026
- Published by Elsevier in Aerospace Science and Technology
- Vol. 179
Enhancing the diversity of solutions in system design optimization
- 22 August 2026
- Published by Elsevier in Aerospace Science and Technology
- Vol. 179
Open AccessEnhancing the diversity of solutions in system design optimization
- 16 November 2025
- Published by Springer Nature in Optimization and Engineering
- Vol. 27 (2) , 1161-1206
Bayesian Quality-Diversity optimization for conditional search-space problems
- 16 November 2025
- Published by Springer Nature in Optimization and Engineering
- Vol. 27 (2) , 1161-1206
Bayesian Quality-Diversity optimization for conditional search-space problems
- 1 January 2025
- Published by Research Publishing Services
- p. 375-382
Adaptive Gaussian Process-Based strategies for Solving the NASA-DNV UQ Challenge 2025
- 1 January 2025
- Published by Research Publishing Services
- p. 375-382
Adaptive Gaussian Process-Based strategies for Solving the NASA-DNV UQ Challenge 2025
- Open Access
- 13 December 2024
- Published by Springer Nature in Research Square
Bayesian Quality-Diversity optimization for conditional search-space problems
The preliminary design and optimization of aerospace systems often requires to make architectural and technological choices and to perform computationally expensive numerical simulations. In early design phases, the decision makers may be interested in obtaining a set of valuable solutions presenting a diversity of characteristics. This paper proposes two approaches tackling these challenges by formulating and solving a particular optimization problem. The latter is called Conditional Search-Space Problem because architectural and technological choices are represented by design variables, called conditional, which are acting on the structure of the optimization problem (e.g., number of design variables and constraints). To produce a broad diversity of solutions, a Quality-Diversity (QD) algorithm adapted to deal with conditional variables and expensive functions is developed. The proposed methods consist in decomposing the optimization problem in several subproblems that have a non-conditional structure. A Bayesian optimization strategy coupled with a QD algorithm is used to search for potential solutions among the subproblems. The most performing potential solutions are then evaluated with the exact functions. The methodology is tested on two analytical and an aerospace system design problems.
- 13 December 2024
- Published by Springer Nature in Research Square
Open AccessBayesian Quality-Diversity optimization for conditional search-space problems
The preliminary design and optimization of aerospace systems often requires to make architectural and technological choices and to perform computationally expensive numerical simulations. In early design phases, the decision makers may be interested in obtaining a set of valuable solutions presenting a diversity of characteristics. This paper proposes two approaches tackling these challenges by formulating and solving a particular optimization problem. The latter is called Conditional Search-Space Problem because architectural and technological choices are represented by design variables, called conditional, which are acting on the structure of the optimization problem (e.g., number of design variables and constraints). To produce a broad diversity of solutions, a Quality-Diversity (QD) algorithm adapted to deal with conditional variables and expensive functions is developed. The proposed methods consist in decomposing the optimization problem in several subproblems that have a non-conditional structure. A Bayesian optimization strategy coupled with a QD algorithm is used to search for potential solutions among the subproblems. The most performing potential solutions are then evaluated with the exact functions. The methodology is tested on two analytical and an aerospace system design problems.
- Open Access
- 10 September 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (18) , 8120
Two-Level Approach for Simultaneous Component Assignment and Layout Optimization with Applications to Spacecraft Optimal Layout
Optimal layout problems consist in positioning a given number of components in order to minimize an objective function while satisfying geometrical or functional constraints. Such kinds of problems appear in the design process of aerospace systems such as satellite or spacecraft design. These problems are NP-hard, highly constrained and dimensional. This paper describes a two-stage algorithm combining a genetic algorithm and a quasi-physical approach based on a virtual-force system in order to solve multi-container optimal layout problems such as satellite modules. In the proposed approach, a genetic algorithm assigns the components to the containers while a quasi-physical algorithm based on a virtual-force system is developed for positioning the components in the assigned containers. The proposed algorithm is experimented and validated on the satellite module layout problem benchmark. Its global performance is compared with previous algorithms from the literature.
- 10 September 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (18) , 8120
Open AccessTwo-Level Approach for Simultaneous Component Assignment and Layout Optimization with Applications to Spacecraft Optimal Layout
Optimal layout problems consist in positioning a given number of components in order to minimize an objective function while satisfying geometrical or functional constraints. Such kinds of problems appear in the design process of aerospace systems such as satellite or spacecraft design. These problems are NP-hard, highly constrained and dimensional. This paper describes a two-stage algorithm combining a genetic algorithm and a quasi-physical approach based on a virtual-force system in order to solve multi-container optimal layout problems such as satellite modules. In the proposed approach, a genetic algorithm assigns the components to the containers while a quasi-physical algorithm based on a virtual-force system is developed for positioning the components in the assigned containers. The proposed algorithm is experimented and validated on the satellite module layout problem benchmark. Its global performance is compared with previous algorithms from the literature.
- Open Access
- 15 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 139-142
Two-Level Algorithm Combining Bayesian Optimization and Swarm Intelligence for Variable-Size Optimal Layout Problems
- 15 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 139-142
Open AccessTwo-Level Algorithm Combining Bayesian Optimization and Swarm Intelligence for Variable-Size Optimal Layout Problems