Research on Optimized Multiple Robots Path Planning and Task Allocation Approach

2006 ◽  
Author(s):  
Taixiong Zheng ◽  
Xiangyang Zhao
Keyword(s):  
Path Planning ◽  
Task Allocation ◽  
Multiple Robots ◽  
Allocation Approach ◽  
And Task

Division of labor

2018 ◽  
Author(s):  
Phanish Puranam
Keyword(s):  
Division Of Labor ◽  
Task Allocation ◽  
Task Structure ◽  
Heuristic Approaches ◽  
Object Based ◽  
The Creation ◽  
Task Division ◽  
And Task

Division of labor involves task division and task allocation. An extremely important consequence of task division and allocation is the creation of interdependence between agents. In fact, division of labor can be seen as a process that converts interdependence between tasks into interdependence between agents. While there are many ways in which the task structure can be chunked and divided among agents, two important heuristic approaches involve division of labor by activity vs. object. I show that a choice between these two forms of division of labor only arises when the task structure is non-decomposable, but the product itself is decomposable. When the choice arises, a key criterion for selection between activity vs. object-based division of labor is the gain from specialization relative to the gain from customization.

scholarly journals Auction-Based Consensus of Autonomous Vehicles for Multi-Target Dynamic Task Allocation and Path Planning in an Unknown Obstacle Environment

2021 ◽  
Vol 11 (11) ◽  
pp. 5057
Author(s):  
Wan-Yu Yu ◽  
Xiao-Qiang Huang ◽  
Hung-Yi Luo ◽  
Von-Wun Soo ◽  
Yung-Lung Lee
Keyword(s):  
Path Planning ◽  
Task Allocation ◽  
Autonomous Vehicles ◽  
Autonomous Vehicle ◽  
Dynamic Task ◽  
The Core ◽  
Dynamic Task Allocation ◽  
Vehicle Technology ◽  
Future Work ◽  
Complicated Task

The autonomous vehicle technology has recently been developed rapidly in a wide variety of applications. However, coordinating a team of autonomous vehicles to complete missions in an unknown and changing environment has been a challenging and complicated task. We modify the consensus-based auction algorithm (CBAA) so that it can dynamically reallocate tasks among autonomous vehicles that can flexibly find a path to reach multiple dynamic targets while avoiding unexpected obstacles and staying close as a group as possible simultaneously. We propose the core algorithms and simulate with many scenarios empirically to illustrate how the proposed framework works. Specifically, we show that how autonomous vehicles could reallocate the tasks among each other in finding dynamically changing paths while certain targets may appear and disappear during the movement mission. We also discuss some challenging problems as a future work.

Provider selection and task allocation issues in networks with different QoS levels and all you can send pricing

2007 ◽  
Vol 43 (2) ◽  
pp. 375-389 ◽  
Author(s):  
Nihat Kasap ◽  
Haldun Aytug ◽  
S. Selcuk Erenguc
Keyword(s):  
Task Allocation ◽  
And Task
Sign in / Sign up

Export Citation Format

Share Document