Edoardo David Santi

Edoardo David Santi

Auto-generated profile, based on publicly available information

Edoardo David Santi

Department of Electrical and Electronic Engineering, Imperial College London, London, U.K.

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
9 April 2025 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
PTPietro Talli
Pietro Talli
ESEdoardo David Santi
Edoardo David Santi
FCFederico Chiariotti
Federico Chiariotti
TSTouraj Soleymani
Touraj Soleymani
Federico MasonFederico Mason
Federico Mason
DGDeniz Gunduz
Deniz Gunduz
Pragmatic or goal-oriented communication can optimize communication decisions beyond the reliable transmission of data, instead aiming at directly affecting application performance with the minimum channel utilization. In this paper, we develop a general theoretical framework for the remote control of finite-state Markov processes, using pragmatic communication over a costly zero-delay communication channel. To that end, we model a cyber-physical system composed of an encoder, which observes and transmits the states of a process in real-time, and a decoder, which receives that information and controls the behavior of the process. The encoder and the decoder should cooperatively optimize the trade-off between the control performance (i.e., reward) and the communication cost (i.e., channel use). This scenario underscores a pragmatic (i.e., goal-oriented) communication problem, where the purpose is to convey only the data that is most valuable for the underlying task, taking into account the state of the decoder (hence, the pragmatic aspect). We investigate two different decision-making architectures: in pull-based remote control, the decoder is the only decision-maker, while in push-based remote control, the encoder and the decoder constitute two independent decision-makers, leading to a multi-agent scenario. We propose three algorithms to optimize our system (i.e., design the encoder and the decoder policies), discuss the optimality guarantees ofs the algorithms, and shed light on their computational complexity and fundamental limits.