M. Lourenço Baptista
Please Note
13 records found
1
Synthetic Data for Smarter RUL Prediction
Deep Generative Models in Turbofan Analysis
combination of computer vision (CV) and deep learning (DL) provides a compelling alternative. However, as DL models increase in capability, their large parameter spaces require substantial data to
achieve robust training. Therefore, this study explores the use of two Auxiliary Classifier Generative Adversarial Networks (AC-GANs) to augment proprietary datasets for two failure modes: (a) a 3-
channel red-green-blue (RGB) model for obstructed holes, and (b) a 4-channel RGB plus depth (RGBD) model for foreign object damage, with the depth reconstructed using monocular depth estimation. A Differential Evolution Optimizer (DEO) was used for hyperparameter optimization of a ResNet-18 classification target model. In the obstructed hole dataset, GAN-based augmentation showed significantly improved accuracy, recall, F1, and AUC-ROC (p < 0.05), competing with traditional methods using less augmentation. In the foreign object damage dataset, the inclusion of depth information significantly enhanced accuracy, precision, F1, and AUC-ROC performance (p < 0.05). However, the RGBD augmentation mainly resulted in a trade-off between precision and recall, without statistically significant differences (p > 0.05). ...
combination of computer vision (CV) and deep learning (DL) provides a compelling alternative. However, as DL models increase in capability, their large parameter spaces require substantial data to
achieve robust training. Therefore, this study explores the use of two Auxiliary Classifier Generative Adversarial Networks (AC-GANs) to augment proprietary datasets for two failure modes: (a) a 3-
channel red-green-blue (RGB) model for obstructed holes, and (b) a 4-channel RGB plus depth (RGBD) model for foreign object damage, with the depth reconstructed using monocular depth estimation. A Differential Evolution Optimizer (DEO) was used for hyperparameter optimization of a ResNet-18 classification target model. In the obstructed hole dataset, GAN-based augmentation showed significantly improved accuracy, recall, F1, and AUC-ROC (p < 0.05), competing with traditional methods using less augmentation. In the foreign object damage dataset, the inclusion of depth information significantly enhanced accuracy, precision, F1, and AUC-ROC performance (p < 0.05). However, the RGBD augmentation mainly resulted in a trade-off between precision and recall, without statistically significant differences (p > 0.05).
Prognostics of Proton-exchange Membrane Fuel Cell
Remaining useful life prediction of proton-exchange membrane fuel cell tested under static and quasi-dynamic operating conditions
monotonic constraints at a preprocessing stage. A non-monotonic trend carries complex information which has outliers and nonessential signal values. The goal of the project is to motivate the usage of monotonic constraints to treat non-monotonic signals of a degrading component. The problem is presented as follows: Determining if the monotonic constrained method at a preprocessing step shall assist prognostics to estimate the remaining useful life of a component accurately. To explore this research, a monotonic constraint - Average Conditional Displacement (ACD) is used at the preprocessing step of a model, in comparison with regular preprocessing methods. The model is experimented on the NASAs simulated C-MAPSS datasets of turbofan engine and modelled with two prognostics algorithms. The model performance is measured
with performance metrics. The results showcase that by treating non-monotonic trends with monotonic constraints does improve the prognostics. However, they are not significantly advanced compared to other preprocessing steps. ...
monotonic constraints at a preprocessing stage. A non-monotonic trend carries complex information which has outliers and nonessential signal values. The goal of the project is to motivate the usage of monotonic constraints to treat non-monotonic signals of a degrading component. The problem is presented as follows: Determining if the monotonic constrained method at a preprocessing step shall assist prognostics to estimate the remaining useful life of a component accurately. To explore this research, a monotonic constraint - Average Conditional Displacement (ACD) is used at the preprocessing step of a model, in comparison with regular preprocessing methods. The model is experimented on the NASAs simulated C-MAPSS datasets of turbofan engine and modelled with two prognostics algorithms. The model performance is measured
with performance metrics. The results showcase that by treating non-monotonic trends with monotonic constraints does improve the prognostics. However, they are not significantly advanced compared to other preprocessing steps.
Solving a flexible resource-constrained project scheduling problem for an e-grocery fulfilment centre: a meta-heuristic approach
Master thesis Aerospace Engineering
The demand for online shopping has grown tremendously in the last couple of years. Picnic, a major player in the online grocery industry, is struggling to achieve long-term growth within its current operations. Scheduling and planning are key drivers for maintaining operational efficiency. The Fulfilment Centre (FC) and Distribution Centre (DC) costs heavily depend on efficient operations. This research focuses on improving the scheduling process in an e-grocery FC and DC. The main objective of the model is to maximise the quality of the schedule, which is achieved through two lexicographical objectives. First, the make span is minimised to improve efficiency and to calculate the number of employees required to fulfil the workload. The make span of a schedule is defined as the time between the first scheduled activity i and the last activity j in a schedule s. Next, the number of switches between activities is reduced. The second objective is to increase overall productivity since switching moments cause slack in the operations. Two solution methods are proposed to solve the Flexible Resource Constrained Project Scheduling Problem (FRCPSP). The first solution method is a Mixed Integer Linear Programming (MILP) formulation that is solved with a Branch & Cut (B&C) algorithm. Next, a meta-heuristic is proposed named Variable Neighbourhood Search (VNS). The initial solution is computed by solving the MILP for one objective, minimising the make span. Next, the VNS uses nested neighbourhoods to modify the answer resulting in fewer switches per schedule. For small instances, the exact formulation outperforms the meta-heuristic in most cases. Conversely, the meta- heuristic features a higher efficacy and efficiency when tackling more significant instances, being the only solution method capable of yielding feasible solutions for real-world scheduling problems. Despite the effectiveness of the proposed meta-heuristic, some operational adjustments are still required before implementing the proposed decision-making tool. ...
The demand for online shopping has grown tremendously in the last couple of years. Picnic, a major player in the online grocery industry, is struggling to achieve long-term growth within its current operations. Scheduling and planning are key drivers for maintaining operational efficiency. The Fulfilment Centre (FC) and Distribution Centre (DC) costs heavily depend on efficient operations. This research focuses on improving the scheduling process in an e-grocery FC and DC. The main objective of the model is to maximise the quality of the schedule, which is achieved through two lexicographical objectives. First, the make span is minimised to improve efficiency and to calculate the number of employees required to fulfil the workload. The make span of a schedule is defined as the time between the first scheduled activity i and the last activity j in a schedule s. Next, the number of switches between activities is reduced. The second objective is to increase overall productivity since switching moments cause slack in the operations. Two solution methods are proposed to solve the Flexible Resource Constrained Project Scheduling Problem (FRCPSP). The first solution method is a Mixed Integer Linear Programming (MILP) formulation that is solved with a Branch & Cut (B&C) algorithm. Next, a meta-heuristic is proposed named Variable Neighbourhood Search (VNS). The initial solution is computed by solving the MILP for one objective, minimising the make span. Next, the VNS uses nested neighbourhoods to modify the answer resulting in fewer switches per schedule. For small instances, the exact formulation outperforms the meta-heuristic in most cases. Conversely, the meta- heuristic features a higher efficacy and efficiency when tackling more significant instances, being the only solution method capable of yielding feasible solutions for real-world scheduling problems. Despite the effectiveness of the proposed meta-heuristic, some operational adjustments are still required before implementing the proposed decision-making tool.
A Digitised Exploration into the Design Space of Naval Power Plants
Optimal Power Plant Selection based on Ship and Client
Assessing the Impact Damage Risk on Composite Structures
A method of predicting impact damage risk on composite aircraft fuselage by combining probability of detection and a decision risk matrix