Alessandro Trapasso

Alessandro Trapasso

Auto-generated profile, based on publicly available information

Alessandro Trapasso

Dept. of Computer Control and Management Engineering, Sapienza University of Rome, Roma, Italy

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
27 March 2023
Verified
Conference Paper
Open access
ATAlessandro Trapasso
Alessandro Trapasso
SSSofia Santilli
Sofia Santilli
LILuca Iocchi
Luca Iocchi
FPFabio Patrizi
Fabio Patrizi
We present a formalization of multi-agent planning problems in which agents are explicitly represented. In contrast with previous formalisations, we discuss the advantages of representing agents explicitly and show the implementation in the Unified Planning formalism and some practical examples. The proposed formalism is equivalent to other models, in particular to Multi Agent Planning Domain Definition Language (MA-PDDL), and can thus be compiled into it and solved by existing multi-agent planning solvers. Moreover, we present a further extension to define more complex multi-agent problems with explicit models of other agents.

2 September 2026
Verified
Book Chapter
Open access
PDF file
FFFrancesco Frattolillo
Francesco Frattolillo
FMFlavio Maiorana
Flavio Maiorana
ATAlessandro Trapasso
Alessandro Trapasso
ACAndrea Cadoli
Andrea Cadoli
FVFrancesco Vincelli
Francesco Vincelli
LILuca Iocchi
Luca Iocchi
The use of Unmanned Aerial Vehicle (UAVs) in deep reinforcement learning (DRL) applications is growing rapidly, as DRL is effective in handling complex environments. One major challenge is designing effective reward signals, as sparse rewards hinder the learning process of DRL. On the other hand, tabular reinforcement learning (RL) approaches, while faster, are typically limited to small, discrete environments and do not scale well to more complex settings. This work presents a hierarchical approach combining the strengths of both methods. We apply tabular RL to derive an optimal value function for a discrete abstract version of the original environment, and use it as a heuristic to generate a denser reward signal for the DRL algorithm, in the original environment. We empirically demonstrate that our approach significantly reduces the number of samples the DRL algorithm needs to achieve the same level of performance in a multi-UAV scenario, compared to traditional methods.