A5062799933- Radiomics and Machine Learning in Medical Imaging
- Optimization and Search Problems
- Atomic and Subatomic Physics Research
- Auction Theory and Applications
- Constraint Satisfaction and Optimization
- Vehicle Routing Optimization Methods
- Medical Imaging Techniques and Applications
- Game Theory and Voting Systems
- Facility Location and Emergency Management
- Distributed Control Multi-Agent Systems
- Smart Cities and Technologies
- Game Theory and Applications
University of Southampton
2020-2021
University of Naples Federico II
2014
Novel model of citizenship calls for a new approach to the policy making, characterized by wish be part information building process. The citizen wants become an active member smart city. This has its impact also on air quality monitoring and control In this work, we try answer these needs investigating centered concept. goal is enable individuals monitor their exposure pollution simultaneously contribute creating map state urban through sharing data.
Abstract The Coalition Formation with Spatial and Temporal constraints Problem (CFSTP) is a multi-agent task allocation problem where the tasks are spatially distributed, deadlines workloads, number of agents typically much smaller than tasks. To maximise completed tasks, may have to schedule coalitions. state-of-the-art CFSTP solver, Look-Ahead (CFLA) algorithm, has two main limitations. First, its time complexity exponential agents. Second, as we show, look-ahead technique not effective in...
In task allocation for real-time domains, such as disaster response, a limited number of agents is deployed across large area to carry out numerous tasks, each with its prerequisites, profit, time window and workload. To maximize profits while minimizing penalties, need cooperate by forming, disbanding reforming coalitions. this paper, we name problem Multi-Agent Routing Scheduling through Coalition formation (MARSC) show that it generalizes the important Team Orienteering Problem Time...
The Coalition Formation with Spatial and Temporal constraints Problem (CFSTP) is a multi-agent task scheduling problem where the tasks are spatially distributed, deadlines workloads, number of agents typically much smaller than tasks, thus have to form coalitions in order maximise completed tasks. current state-of-the-art CFSTP solver, Look-Ahead (CFLA) algorithm, has two main limitations. First, its time complexity exponential agents. Second, as we show, look-ahead technique not effective...
The Coalition Formation with Spatial and Temporal constraints Problem (CFSTP) is a multi-agent task allocation problem in which few agents have to perform many tasks, each its deadline workload. To maximize the number of completed need cooperate by forming, disbanding reforming coalitions. original mathematical programming formulation CFSTP difficult implement, since it lengthy based on problematic Big-M method. In this paper, we propose compact easy-to-implement formulation. Moreover,...