A simultaneous descending auction for task allocation

Sen, Sayan D.; Adams, Julie A.

doi:10.1109/smc.2014.6973937

Cited by 9 publications

(5 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Dynamic rescheduling was achieved using a decentralized consensus method (Ponda et al , 2010). The distribution of tasks by one robot while minimizing unnecessary redistribution was developed using a simultaneous descending auction (Service et al , 2014). However, re-allocation can result in agents never reaching their goals, leading to system failure.…”

Section: Methods Of Distribution Of Target Tasksmentioning

confidence: 99%

“…Now important and topical issues in this area remain, such as when the task can be interrupted, how often interruption should be considered, as one of the methods for solving the redistribution problem, etc. The consensus-based method (Ponda et al , 2010) and the descending auction method (Service et al , 2014) are used in conjunction with the decentralized control strategy, where each agent builds its trajectory independently in a static environment.…”

Section: Methods Of Distribution Of Target Tasksmentioning

confidence: 99%

See 1 more Smart Citation

Group movement of UAVs in environment with dynamic obstacles: a survey

Izhboldina

Lebedev

2022

IJIUS

View full text Add to dashboard Cite

PurposeThe successful application of the group of unmanned aerial vehicles (UAVs) in the tasks of monitoring large areas is becoming a promising direction in modern robotics. This paper aims to study the tasks related to the control of the UAV group while performing a common mission.Design/methodology/approachThis paper discusses the main tasks solved in the process of developing an autonomous UAV group. During the survey, five key tasks of group robotics were investigated, namely, UAV group control, path planning, reconfiguration, task assignment and conflict resolution. Effective methods for solving each problem are presented, and an analysis and comparison of these methods are carried out. Several specifics of various types of UAVs are also described.FindingsThe analysis of a number of modern and effective methods showed that decentralized methods have clear advantages over centralized ones, since decentralized methods effectively perform the assigned mission regardless of on the amount of resources used. As for the method of planning the group movement of UAVs, it is worth choosing methods that combine the algorithms of global and local planning. This combination eliminates the possibility of collisions not only with static and dynamic obstacles, but also with other agents of the group.Originality/valueThe results of scientific research progress in the tasks of UAV group control have been summed up.

show abstract

Section: Methods Of Distribution Of Target Tasksmentioning

confidence: 99%

Section: Methods Of Distribution Of Target Tasksmentioning

confidence: 99%

Group movement of UAVs in environment with dynamic obstacles: a survey

Izhboldina

Lebedev

2022

IJIUS

View full text Add to dashboard Cite

show abstract

“…The task selection strategy, based on market economy or auction, can also be used as the task selection strategy of self-interested agents in coalition skill games [14][15][16]. In [14], robots negotiate their respective assignments in order to optimize task distribution according to their own utility function.…”

Section: Related Workmentioning

confidence: 99%

Utility Distribution Strategy of the Task Agents in Coalition Skill Games

Wang

Fang

2018

Algorithms

View full text Add to dashboard Cite

This paper focuses on the rational distribution of task utilities in coalition skill games, which is a restricted form of coalition game, where each service agent has a set of skills and each task agent needs a set of skills in order to be completed. These two types of agents are assumed to be self-interested. Given the task selection strategy of service agents, the utility distribution strategies of task agents play an important role in improving their individual revenues and system total revenue. The problem that needs to be resolved is how to design the task selection strategies of the service agents and the utility distribution strategies of the task agents to make the self-interested decisions improve the system whole performance. However, to the best of our knowledge, this problem has been the topic of very few studies and has not been properly addressed. To address this problem, a task allocation algorithm for self-interested agents in a coalition skill game is proposed, it distributes the utilities of tasks to the needed skills according to the powers of the service agents that possess the corresponding skills. The final simulation results verify the effectiveness of the algorithm.

show abstract

“…We consider a discrete problem domain for the robots, which drives the need for designing new PSO. In [13], authors propose an auction-based approach for task allocation. However, their algorithm is evaluated over small scale i.e., 10 and 50 robots.…”

Section: Related Workmentioning

confidence: 99%

A coalition formation algorithm for Multi-Robot Task Allocation in large-scale natural disasters

Mouradian

Sahoo

Glitho

et al. 2017

2017 13th International Wireless Communications and Mobile Computing Conference (IWCMC)

View full text Add to dashboard Cite

Abstract-In large-scale natural disasters, humans are likely to fail when they attempt to reach high-risk sites or act in search and rescue operations. Robots, however, outdo their counterparts in surviving the hazards and handling the search and rescue missions due to their multiple and diverse sensing and actuation capabilities. The dynamic formation of optimal coalition of these heterogeneous robots for cost efficiency is very challenging and research in the area is gaining more and more attention. In this paper, we propose a novel heuristic. Since the population of robots in large-scale disaster settings is very large, we rely on Quantum Multi-Objective Particle Swarm Optimization (QMOPSO). The problem is modeled as a multi-objective optimization problem. Simulations with different test cases and metrics, and comparison with other algorithms such as NSGA-II and SPEA-II are carried out. The experimental results show that the proposed algorithm outperforms the existing algorithms not only in terms of convergence but also in terms of diversity and processing time.

show abstract

A simultaneous descending auction for task allocation

Cited by 9 publications

References 11 publications

Group movement of UAVs in environment with dynamic obstacles: a survey

Group movement of UAVs in environment with dynamic obstacles: a survey

Utility Distribution Strategy of the Task Agents in Coalition Skill Games

A coalition formation algorithm for Multi-Robot Task Allocation in large-scale natural disasters

Contact Info

Product

Resources

About