Alessandro Farinelli

Alessandro Farinelli

Auto-generated profile, based on publicly available information

Alessandro Farinelli

University of Verona

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
20 September 2004 in IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
Verified
Journal Article
Closed access
AFA. Farinelli
A. Farinelli
LILuca Iocchi
Luca Iocchi
DND. Nardi
D. Nardi
Multirobot systems (MRS) are, nowadays, an important research area within robotics and artificial intelligence and a growing number of systems have recently been presented in the literature. Since application domains and tasks that are faced by MRS are of increasing complexity, the ability of the robots to cooperate can be regarded as a fundamental feature. In this paper, we present a survey of the recent work in the area by specifically examining the forms of cooperation and coordination realized in the MRS. In particular, we propose a new taxonomy for classification of the approaches to coordination in MRS and we describe some systems, which we consider representative in our taxonomy. We finally discuss the outcomes of our analysis and try to highlight future trends of the research on MRS.

9 June 2016 in Autonomous Robots
Verified
Journal Article
Closed access
PDF file
AFAlessandro Farinelli
Alessandro Farinelli
LILuca Iocchi
Luca Iocchi
DNDaniele Nardi
Daniele Nardi

1 February 2011 in Artificial Intelligence
Verified
Journal Article
Closed access
ARA. Rogers
A. Rogers
AFA. Farinelli
A. Farinelli
RSR. Stranders
R. Stranders
NJN.R. Jennings
N.R. Jennings

1 April 2017 in Robotics and Autonomous Systems
Verified
Journal Article
Closed access
AFAlessandro Farinelli
Alessandro Farinelli
NBNicolo’ Boscolo
Nicolo’ Boscolo
EZElena Zanotto
Elena Zanotto
EPEnrico Pagello
Enrico Pagello

24 March 2010 in The Computer Journal
Verified
Journal Article
Closed access
PDF file
Sarvapali D. RamchurnSarvapali D. Ramchurn
Sarvapali D. Ramchurn
AFAlessandro Farinelli
Alessandro Farinelli
KMKathryn S. Macarthur
Kathryn S. Macarthur
NJNicholas R. Jennings
Nicholas R. Jennings
Emergency responders are faced with a number of significant challenges when managing major disasters. First, the number of rescue tasks posed is usually larger than the number of responders (or agents) and the resources available to them. Second, each task is likely to require a different level of effort in order to be completed by its deadline. Third, new tasks may continually appear or disappear from the environment, thus requiring the responders to quickly recompute their allocation of resources. Fourth, forming teams or coalitions of multiple agents from different agencies is vital since no single agency will have all the resources needed to save victims, unblock roads and extinguish the fires which might erupt in the disaster space. Given this, coalitions have to be efficiently selected and scheduled to work across the disaster space so as to maximize the number of lives and the portion of the infrastructure saved. In particular, it is important that the selection of such coalitions should be performed in a decentralized fashion in order to avoid a single point of failure in the system. Moreover, it is critical that responders communicate only locally given they are likely to have limited battery power or minimal access to long-range communication devices. Against this background, we provide a novel decentralized solution to the coalition formation process that pervades disaster management. More specifically, we model the emergency management scenario defined in the RoboCup Rescue disaster simulation platform as a coalition formation with spatial and temporal constraints (CFST) problem where agents form coalitions to complete tasks, each with different demands. To design a decentralized algorithm for CFST, we formulate it as a distributed constraint optimization problem and show how to solve it using the state-of-the-art Max-Sum algorithm that provides a completely decentralized message-passing solution. We then provide a novel algorithm (F-Max-Sum) that avoids sending redundant messages and efficiently adapts to changes in the environment. In empirical evaluations, our algorithm is shown to generate better solutions than other decentralized algorithms used for this problem.

1 February 2020 in Robotics and Autonomous Systems
Verified
Journal Article
Closed access
LSL. Steccanella
L. Steccanella
DBD.D. Bloisi
D.D. Bloisi
ACA. Castellini
A. Castellini
AFA. Farinelli
A. Farinelli