Eduardo Feo Flushing

Eduardo Feo Flushing

Auto-generated profile, based on publicly available information

Eduardo Feo Flushing

Department of Computer Science, Carnegie Mellon University at Qatar, Doha, Qatar

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
1 May 2021 in Computer Networks
Verified
Journal Article
Closed access
MAMohammad Aazam
Mohammad Aazam
SZSherali Zeadally
Sherali Zeadally
EFEduardo Feo Flushing
Eduardo Feo Flushing

29 July 2024 in IEEE Access
Verified
Journal Article
Open access
IAIshaq Ansari
Ishaq Ansari
AMAbubakr Mohammed
Abubakr Mohammed
YAYaqoob Ansari
Yaqoob Ansari
MAMohammed Yusuf Ansari
Mohammed Yusuf Ansari
SRSaquib Razak
Saquib Razak
EFEduardo Feo Flushing
Eduardo Feo Flushing
In our research, we address the problem of coordination and planning in heterogeneous multi-robot systems for missions that consist of spatially localized tasks. Conventionally, this problem has been framed as a task allocation problem that maps tasks to robots. However, all previous work assumes that tasks are atomic procedures. In this work, we relax this assumption and adopt a non-atomic model of tasks that enables robots to accomplish mission tasks incrementally over disjoint periods, precisely to account for the possibility of having a task serviced by numerous individual contributions over time. We propose a cooperative, load-balancing task allocation and scheduling algorithm based on sequential single-item auctions (CoLoSSI) that explicitly considers the non-atomicity of tasks, promotes synergies between agents, and enables cooperation while maintaining computational tractability. We also propose a fully distributed variant of CoLoSSI that tackles sparse, communication-restricted scenarios. Computational and simulation results confirm the efficacy of the proposed approaches for generating good-quality mission plans with low computational effort.

30 April 2021 in IEEE Access
Verified
Journal Article
Open access
EFEduardo Feo-Flushing
Eduardo Feo-Flushing
LGLuca Maria Gambardella
Luca Maria Gambardella
GCGianni A. Di Caro
Gianni A. Di Caro
This work is about mission planning in teams of mobile autonomous agents. We consider tasks that are spatially distributed, non-atomic, and provide an utility for integral and also partial task completion. Agents are heterogeneous, therefore showing different efficiency when dealing with the tasks. The goal is to define a system-level plan that assigns tasks to agents to maximize mission performance. We define the mission planning problem through a model including multiple sub-problems that are addressed jointly: task selection and allocation, task scheduling, task routing, control of agent proximity over time. The problem is proven to be NP-hard and is formalized as a mixed integer linear program (MILP). Two solution approaches are proposed: one heuristic and one exact method. Both combine a generic MILP solver and a genetic algorithm, resulting in efficient anytime algorithms. To support performance scalability and to allow the effective use of the model when online continual replanning is required, a decentralized and fully distributed architecture is defined top-down from the MILP model. Decentralization drastically reduces computational requirements and shows good scalability at the expenses of only moderate losses in performance. Lastly, we illustrate the application of the mission planning framework in two demonstrators. These implementations show how the framework can be successfully integrated with different platforms, including mobile robots (ground and aerial), wearable computers, and smart-phone devices.

4 November 2020
Verified
Conference Paper
Closed access
IAIshaq Ansari
Ishaq Ansari
AMAbubakr Mohamed
Abubakr Mohamed
EFEduardo Feo Flushing
Eduardo Feo Flushing
SRSaquib Razak
Saquib Razak
In our research, we address the problem of coordination and planning in heterogeneous multi-robot systems for missions that consists of a set of spatially localized tasks. Conventionally, this problem has been framed as a task allocation problem that maps tasks to robots. However, all previous work assume that tasks are atomic procedures. In this work we relax this assumption and adopt a non-atomic model of tasks that enables robot accomplishing mission tasks in an incremental manner over disjoint periods of time, precisely to account for the possibility of having a task being serviced by multiple individual contributions over time. This model can be useful in search and rescue scenarios: the same portion of the environment can be explored at different times by different agents using different sensors. We propose a cooperative, load-balancing task allocation and scheduling algorithm based on sequential single-item auctions (CoLoSSI). Our approach explicitly considers the non-atomicity of tasks and promotes synergies between agents enabling cooperation while at the same time maintaining computational tractability. We also study a fully distributed implementation of the task allocation approach in sparse, communication-restricted scenarios, and propose an effective strategy to enhance its computational efficiency. A computational and simulation validation is also carried out, confirming the efficacy of the proposed approach for generating good quality mission plans with low computational effort.

3 November 2025
Verified
Conference Paper
Open access
YAYaqoob Ansari
Yaqoob Ansari
AKAmmar Karkour
Ammar Karkour
EFEduardo Feo Flushing
Eduardo Feo Flushing
KHKhaled A. Harras
Khaled A. Harras

3 June 2026 in IEEE Open Journal of Signal Processing
Verified
Journal Article
Open access
MAMohammed Yusuf Ansari
Mohammed Yusuf Ansari
RIRabiul Islam
Rabiul Islam
MIMohammed Ishaq
Mohammed Ishaq
IAIbrahim Al-Muteb
Ibrahim Al-Muteb
MYMohammed Yaqoob
Mohammed Yaqoob
MQMarwa Qaraqe
Marwa Qaraqe
Electrocardiography (ECG) is a widely used, non-invasive tool for assessing cardiac function, but conventional disease-centric models do not fully capture overall cardiovascular health. Recent work has introduced the concept of ECG age: a neural network–predicted age derived from ECG signals. Its difference from chronological age, known as delta age ($\Delta$Age), has emerged as a surrogate marker of cardiovascular well-being. While deep learning approaches have shown promise for ECG age estimation, their computational complexity and lack of interpretability limit deployment in compute-constrained clinical environments. Kolmogorov–Arnold Networks (KANs) offer parameter efficiency and improved interpretability, yet existing variants remain compute-heavy, underexplored for regression tasks, and unable to disentangle contributions from individual ECG leads. To address these challenges, we propose LeadKAN, a lightweight and explainable KAN architecture for ECG age estimation. LeadKAN is built on LoRKAN layers, a novel layer design that replaces fully connected layers with low-rank bilinear mixing followed by an RBF-kernelized top, significantly reducing parameter count and computation. LeadKAN achieves ECG age estimation performance (MSE $\approx$ 112; MAE $\approx$ 8.25 years) comparable to state-of-the-art models, while requiring 16× fewer parameters and 45× fewer multiply–add operations. Additionally, lead-specific encoders enable attribution analysis, thereby enhancing clinical interpretability. These results position LeadKAN as an efficient and explainable framework for ECG age estimation, with strong potential for deployment in real-world, compute-limited settings.