Francisco Suárez

AI
3papers
1citation
Novelty48%
AI Score37

3 Papers

15.4ETMay 29
BERS: Locally Optimal Continuous Algorithm for Maritime Weather Routing with Just-in-Time Arrival

Daniel Precioso, Francisco Suárez, Javier Jiménez de la Jara et al.

Maritime weather routing must optimize route geometry under dynamic wind-wave conditions, obstacle constraints, and fixed-arrival requirements. We present Bézier Evolve and Refine Strategy (\name{}), a two-stage framework that combines global evolutionary search (CMA-ES) with local variational refinement (FMS). Routes are parametrized as Bézier curves and evaluated with dense along-path sampling, enabling smooth trajectories while preserving practical feasibility constraints and accounting for mid-segment effects. We evaluate \name{} on synthetic benchmarks designed to stress seven operational criteria: continuity, obstacle avoidance, dynamic adaptation, flexible objective design, constant-load feasibility, just-in-time arrival, and local optimality. Across these tests, \name{} matches or improves published baselines while maintaining robust convergence under challenging flow fields and land geometries. We then validate the method on real ocean data using hourly ERA5 forcing over 366 daily departures in 2024 for two trans-oceanic corridors (Atlantic and Pacific), with a physics-based model of an 88~m cargo vessel with optional rigid wingsails. In real-ocean experiments, route optimization alone reduces mean propulsive energy by 23--59\% versus great-circle baselines of the same propulsion mode. Combined with wind-assisted propulsion, total savings reach up to 75\%. These results show that \name{} provides a practical and scalable foundation for just-in-time, energy-efficient weather routing in maritime decarbonization workflows.

AISep 28, 2021
Explainable Machine Larning for liver transplantation

Pedro Cabalar, Brais Muñiz, Gilberto Pérez et al.

In this work, we present a flexible method for explaining, in human readable terms, the predictions made by decision trees used as decision support in liver transplantation. The decision trees have been obtained through machine learning applied on a dataset collected at the liver transplantation unit at the Coruña University Hospital Center and are used to predict long term (five years) survival after transplantation. The method we propose is based on the representation of the decision tree as a set of rules in a logic program (LP) that is further annotated with text messages. This logic program is then processed using the tool xclingo (based on Answer Set Programming) that allows building compound explanations depending on the annotation text and the rules effectively fired when a given input is provided. We explore two alternative LP encodings: one in which rules respect the tree structure (more convenient to reflect the learning process) and one where each rule corresponds to a (previously simplified) tree path (more readable for decision making).

LOSep 18, 2019
A Rule-Based System for Explainable Donor-Patient Matching in Liver Transplantation

Felicidad Aguado, Pedro Cabalar, Jorge Fandinno et al.

In this paper we present web-liver, a rule-based system for decision support in the medical domain, focusing on its application in a liver transplantation unit for implementing policies for donor-patient matching. The rule-based system is built on top of an interpreter for logic programs with partial functions, called lppf, that extends the paradigm of Answer Set Programming (ASP) adding two main features: (1) the inclusion of partial functions and (2) the computation of causal explanations for the obtained solutions. The final goal of web-liver is assisting the medical experts in the design of new donor-patient matching policies that take into account not only the patient severity but also the transplantation utility. As an example, we illustrate the tool behaviour with a set of rules that implement the utility index called SOFT.