Leonardo Lai

Leonardo Lai

Auto-generated profile, based on publicly available information

Leonardo Lai

Department of Information Engineering, University of Pisa, Pisa, Italy

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
29 March 2021 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
LLLeonardo Lai
Leonardo Lai
LFLorenzo Fiaschi
Lorenzo Fiaschi
Marco CococcioniMarco Cococcioni
Marco Cococcioni
Kalyanmoy DebKalyanmoy Deb
Kalyanmoy Deb
This article concerns the study of mixed Pareto-lexicographic multiobjective optimization problems where the objectives must be partitioned in multiple priority levels (PLs). A PL is a group of objectives having the same importance in terms of optimization and subsequent decision making, while between PLs a lexicographic ordering exists. A naive approach would be to define a multilevel dominance relationship and apply a standard EMO/EMaO algorithm, but the concept does not conform to a stable optimization process as the resulting dominance relationship violates the transitive property needed to achieve consistent comparisons. To overcome this, we present a novel approach that merges a custom nondominance relation with the Grossone methodology, a mathematical framework to handle infinite and infinitesimal quantities. The proposed method is implemented on a popular multiobjective optimization algorithm (NSGA-II), deriving a generalization of it called by us PL-NSGA-II. We also demonstrate the usability of our strategy by quantitatively comparing the results obtained by PL-NSGA-II against other priority and nonpriority-based approaches. Among the test cases, we include two real-world applications: one 10-objective aircraft design problem and one 3-objective crash safety vehicle design task. The obtained results show that PL-NSGA-II is more suited to solve lexicographical many-objective problems than the general purpose EMaO algorithms.

16 August 2022 in Natural Computing
Verified
Journal Article
Open access
PDF file
LLLeonardo Lai
Leonardo Lai
LFLorenzo Fiaschi
Lorenzo Fiaschi
Marco CococcioniMarco Cococcioni
Marco Cococcioni
Kalyanmoy DebKalyanmoy Deb
Kalyanmoy Deb
This work aims at reviewing the state of the art of the field of lexicographic multi/many-objective optimization. The discussion starts with a review of the literature, emphasizing the numerous application in the real life and the recent burst received by the advent of new computational frameworks which work well in such contexts, e.g., Grossone Methodology. Then the focus shifts on a new class of problems proposed and studied for the first time only recently: the priority-levels mixed-pareto-lexicographic multi-objective-problems (PL-MPL-MOPs). This class of programs preserves the original preference ordering of pure many-objective lexicographic optimization, but instantiates it over multi-objective problems rather than scalar ones. Interestingly, PL-MPL-MOPs seem to be very well qualified for modeling real world tasks, such as the design of either secure or fast vehicles. The work also describes the implementation of an evolutionary algorithm able to solve PL-MPL-MOPs, and reports its performance when compared against other popular optimizers.


9 November 2021
Verified
Conference Paper
Closed access
LLLeonardo Lai
Leonardo Lai
GAGabriele Ara
Gabriele Ara
TCTommaso Cucinotta
Tommaso Cucinotta
KKKoteswararao Kondepu
Koteswararao Kondepu
LVLuca Valcarenghi
Luca Valcarenghi
This paper introduces UDPDK, a novel middleware easing the implementation of ultra-low-latency communications among software components, based on the well-known DPDK framework, by which one can bypass the in-kernel networking stack of the operating system, with direct access to the networking devices from the application. DPDK functionality is exposed to applications with an API resembling the standard POSIX primitives for UDP. The usefulness of UDPDK is demonstrated by integrating it in the OpenAirInterface open-source software stack for RAN communications, modifying its F1-U component to use UDPDK primitives. Experimental results on an LTE test-bed show a reduction of 69% of the end-to-end latency when using the new primitives. The achieved results are of foremost importance for the realization of ultra-low-latency communications in future 5G scenarios.