My research

I am affiliated with the Complex Intelligent Systems Research Group (CIS), under the guidance of Professor Mario Pavone. My research interests include metaheuristics, complex systems, collective behaviors, agent-based models, and crowd models. My research predominantly revolves around two key areas: the analysis of optimization problems and the study of collective behaviors.

In the realm of optimization problems, the objective has been to develop an Ant Colony Optimization (ACO) algorithm tailored for dynamic network optimization. Specifically, I've undertaken a series of studies to analyze whether introducing competitive dynamics into an ant colony algorithm could amplify its efficiency. To accomplish this, I created an agent-based model using NetLogo software. In this model, two ant colonies—cooperative and competitive—navigate virtual environments of varying complexity, employing distinct actions based on their type. Cooperative ants assist the colony by repairing damaged paths, while competitive ants refrain from assistance and may disrupt paths. Interestingly, results revealed that a modest level of competition paradoxically benefits the entire colony, reducing travel times and costs while maximizing the number of ants reaching the exit.

In the study of collective behaviors, the aim was to pinpoint an appropriate abstraction process capable of translating ACO algorithm rules into concepts grounded in social dynamics and agent-based simulations. The goal was to use this abstraction to create an agent-based model for scrutinizing collective dynamics within crowds. More specifically, I analyzed the effects of different behavioral strategies within a crowd context, reaffirming that a slight degree of competition can benefit the entire group. However, this phenomenon holds true only when agents possess too much information about the environment they are exploring.

For a more detailed exploration of both research lines, I direct you to my Google Scholar profile, where a list of my published works is available.