Abstract
One of the major challenges in the coordination of large, open, collaborative, and commercial vehicle fleets is dynamic task allocation. Self-concerned individually rational vehicle drivers have both local and global objectives, which require coordination using some fair and efficient task allocation method. In this paper, we review the literature on scalable and dynamic task allocation focusing on deterministic and dynamic two-dimensional linear assignment problems. We focus on multiagent system representation of open vehicle fleets where dynamically appearing vehicles are represented by software agents that should be allocated to a set of dynamically appearing tasks. We give a comparison and critical analysis of recent research results focusing on centralized, distributed, and decentralized solution approaches. Moreover, we propose mathematical models for dynamic versions of the following assignment problems well known in combinatorial optimization: the assignment problem, bottleneck assignment problem, fair matching problem, dynamic minimum deviation assignment problem, Σk-assignment problem, the semiassignment problem, the assignment problem with side constraints, and the assignment problem while recognizing agent qualification; all while considering the main aspect of open vehicle fleets: random arrival of tasks and vehicles (agents) that may become available after assisting previous tasks or by participating in the fleet at times based on individual interest.
Highlights
Open collaborative vehicle fleets composed of autonomous self-interested system participants are ever more widespread
Each fleet participant is Complexity modelled as an autonomous collaborative individually rational software agent installed on a user’s smart device. e agent has only a local vision of the fleet and it needs to cooperate with other agents in order to find the allocation of dynamically appearing tasks faced by the whole fleet
We present a survey on multiagent system (MAS) coordination mechanisms for computationally complex dynamic task allocation problem (DTAP) and its variations for open vehicle fleet applications. ese problems may be modelled by a variety of deterministic and dynamic two-dimensional linear assignment problems, i.e., the problems regarding the assignment of two sets that may be referred to as “agents” and “tasks” with at most one task per agent and one agent per task, where the tasks appear dynamically and the task assignment is fully determined by the parameter values and the initial conditions
Summary
Open collaborative vehicle fleets composed of autonomous self-interested system participants are ever more widespread. We identify and mathematically model the variations of the dynamic task assignment problem applicable to the studied fleet task allocation contexts and provide general scalability characteristics of their solution approaches. Our intention is to make it easier for a researcher to solve some variation of the task allocation problem in large-scale open vehicle fleets by describing state-of-the-art solutions and their theoretical scalability results. We present a survey on multiagent system (MAS) coordination mechanisms for computationally complex dynamic (one-on-one) task allocation problem (DTAP) and its variations for open vehicle fleet applications. We extend mathematical models of the variations of the static task assignment problem to their dynamic counterparts in open vehicle fleet scenarios considering, among others, self-interested and individually rational vehicle drivers, time restrictions, fairness, agent qualification, and personal rank. We investigate the theoretical scalability of these approaches and introduce a taxonomy to
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
