检索结果-内蒙古大学图书馆

Improved two-stage task allocation of distributed UAV swarms based on an improved auction mechanism

INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS 2024年第11期15卷 5119-5128页

作者： Tan, Chaoren Liu, Xin Xiangtan Univ Sch Comp Sci Xiangtan 411105 Peoples R China Xiangtan Univ Sch Cyberspace Sci Xiangtan 411105 Peoples R China

In order to better handle the dynamic task allocation of UAV swarms, this paper first models the task allocation problem of UAV swarms. Then, improvements were made to the previous auction-based methods in terms of two aspects-the auction function and auction mechanism, and a two-stage task allocation method for UAV swarms based on an improved auction mechanism was proposed. When improving the auction function, an auction function with a parameter considering both UAVs and tasks was designed. By using machine learning to obtain the parameter, relatively stable experimental performance can be achieved. To further optimize the performance, a re-auction mechanism was proposed. Finally, by comparing with commonly used methods based on auction mechanisms, including the method of a linear combination of the MiniSum and MiniMax team objectives for task allocation and the other method, the feasibility of improving the auction function and auction mechanism was verified, and better experimental results were obtained.

关键词： Task allocation auction algorithm Re-auction mechanism Machine learning

来源：评论

学校读者我要写书评

暂无评论

DYNAMIC TASK ALLOCATION BASED ON auction IN ROBOTIC MOBILE FULFILMENT SYSTEM

引用

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION 2023年第10期19卷 7600-7615页

作者： Li, Hongli Zhu, Hongrui Xu, Dongming Lin, Xuanyao Jiao, Guoshuai Song, Yang Huang, Min Northeastern Univ Coll Informat Sci & Engn Shenyang 110819 Liaoning Peoples R China

Task allocation is one of the important factors affecting the effi-ciency of robotic mobile fulfilment system (RMFS). In this paper, a dynami-cally changing task allocation model is constructed, with the overall maximum profit as the optimization objective, and allows robots that are performing tasks to participate in the task allocation. Using the auction algorithm, three dynamic allocation strategies are developed: queued allocation strategy (QAS), immediate allocation strategy (IAS), and reservable allocation strategy (RAS). This paper conducts simulation experiments to compare and analyze the pro-posed three dynamic allocation strategies, static allocation strategy (SAS) as well as a heuristic algorithm (HAS). Simulation results show that RAS, with robots' tasks changing dynamically, is better at increasing the number of pick-ing orders and reducing the distance travelled by robots than other proposed strategies, which improves the picking efficiency of RMFS.

关键词： Task allocation RMFS auction algorithm simulation

来源：评论

学校读者我要写书评

暂无评论

Hidden Markov Model and auction-Based Formulations of Sensor Coordination Mechanisms in Dynamic Task Environments

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS 2011年第6期41卷 1092-1106页

作者： An, Woosun Park, Chulwoo Han, Xu Pattipati, Krishna R. Kleinman, David L. Kemple, William G. Univ Connecticut Dept Elect Engn Storrs CT 06029 USA USN Postgrad Sch Dept Informat Sci Monterey CA 93943 USA

In this paper, multistage auction-based intelligence, surveillance, and reconnaissance (ISR) sensor coordination mechanisms are investigated in the context of dynamic and uncertain mission environments such as those faced by expeditionary strike groups. Each attribute of the mission task is modeled using a hidden Markov model (HMM) with controllable emission matrices, corresponding to each ISR asset package (subset of sensors). For each HMM-asset package pair, we evaluate a matrix of information gains (uncertainty reduction measures). The elements of this matrix depend on the asset coordination structure and the concomitant delays accrued. We consider three coordination structures (distributed ISR coordination, ISR officer serving as a coordinator, and ISR officer serving as a commander) here. We evaluate these structures on a hypothetical mission scenario that requires the monitoring of ISR activities in multiple geographic regions. The three structures are evaluated by comparing the task state estimation error cost, as well as travel, waiting, and assignment delays. The results of the analysis were used as a guide in the design of a mission scenario and asset composition for a team-in-the-loop experimentation. Our solution has the potential to be a mixed initiative decision support tool to an ISR coordinator/commander, where the human provides possible ISR asset package-task pairings and the tool evaluates the efficacy of the assignment in terms of task accuracy and delays. We also apply our approach to a hypothetical disaster management scenario involving chemical contamination and discuss the computational complexity of our approach.

关键词： auction algorithm coordination delays hidden Markov model (HMM) information gain (IG) heuristic sensor scheduling partition algorithm sensor assignment

来源：评论

学校读者我要写书评

暂无评论

Preallocation-Based Combinatorial auction for Efficient Fair Channel Assignments in Multi-Connectivity Networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2023年第11期22卷 8407-8422页

作者： Csercsik, David Jorswieck, Eduard A. Inst Econ Ctr Econ & Reg Stud Budapest 1097 Hungary Pazmany Peter Catholic Univ Fac Informat Technol & Bion H-1083 Budapest Hungary TU Braunschweig Inst Commun Technol Braunschweig 38106 Germany

We consider a general multi-connectivity framework, intended for ultra-reliable low-latency communications (URLLC) services, and propose a novel, preallocation-based combinatorial auction approach for the efficient allocation of channels. We compare the performance of the proposed method with several other state-of-the-art and alternative channel-allocation algorithms. The two proposed performance metrics are the capacity-based and the utility-based context. In the first case, every unit of additional capacity is regarded as beneficial for any tenant, independent of the already allocated quantity, and the main measure is the total throughput of the system. In the second case, we assume a minimal and maximal required capacity value for each tenant, and consider the implied utility values accordingly. In addition to the total system performance, we also analyze fairness and computational requirements in both contexts. We conclude that at the cost of higher but still plausible computational time, the fairness-enhanced version of the proposed preallocation based combinatorial auction algorithm outperforms every other considered method when one considers total system performance and fairness simultaneously, and performs especially well in the utility context. Therefore, the proposed algorithm may be regarded as candidate scheme for URLLC channel allocation problems, where minimal and maximal capacity requirements have to be considered.

关键词： Channel allocation Ultra reliable low latency communication Wireless communication Resource management 5G mobile communication Fading channels Game theory multi-connectivity auction algorithm resource allocation

来源：评论

学校读者我要写书评

暂无评论

An auction-based distributed network slicing scheme for resource allocation in satellite-UAV integrated networks

引用

COMPUTER COMMUNICATIONS 2023年第1期210卷 58-68页

作者： Tong, Xin Li, Xu Liu, Ying Beijing Jiaotong Univ Sch Elect & Informat Engn Beijing 100044 Peoples R China

Network slicing is a promising solution to satisfy different service quality requirements in the satelliteUAV integrated network of B5G and 6G. To relieve the significant transmission delay and system overhead during network slicing, we propose an auction-based distributed network slicing scheme (ADNSS), in which the resource allocation is collaboratively performed by satellite heads using an auction algorithm without transmitting the messages to the ground station in a centralized way. The convergence and service delay performance of ADNSS is analyzed in this paper. Moreover, considering that the deviation of theoretical slice analysis models from actual ones may lead to the degradation of service delay performance of ADNSS, we design an online optimization method driven by the multi-arm bandit algorithm (ORLOM) to enhance the accuracy of slice models of ADNSS in the actual environment. Numerical results show that we can achieve optimal service delay performance by ADNSS applying ORLOM after finite slicing windows and realize 8% performance improvement compared with ADNSS without ORLOM when the service number is 9. In addition, ADNSS can reduce the system overhead by 8.5%-76% compared with the centralized method in the scenario where the hops count from satellite heads to the ground station exceeds that between satellite heads by 3. As the hops count difference and service number increase, ADNSS shows more significant advantages in reducing service delay and system overhead.

关键词： Satellite-UAV networks Distributed network slicing auction algorithm Online reinforcement learning Resource allocation

来源：评论

学校读者我要写书评

暂无评论

An auction-based weighted matching implementation on massively parallel architectures

引用

PARALLEL COMPUTING 2012年第12期38卷 595-614页

作者： Sathe, Madan Schenk, Olaf Burkhart, Helmar Univ Basel Dept Math & Comp Sci CH-4003 Basel Switzerland

Maximum weighted matchings represent a fundamental kernel in massive graph analysis and occur in a wide range of real-life applications. Here, a parallel auction-based matching algorithm is developed, which is able to tackle matchings in very large, dense, and sparse bipartite graphs. It will be demonstrated that the convergence of the auction algorithm crucially depends on two different epsilon-scaling strategies. The auction algorithm including the E-scaling strategies has been implemented using a hybrid MPI-OpenMP programming model, and its performance is validated in various applications from bioinformatics, computer vision, and sparse linear algebra. It is concluded that for dense bipartite graphs, the auction algorithm scales well, and for sparse bipartite graphs at least a substantial speedup is achieved against alternative approaches that are based on augmenting path algorithms. (c) 2012 Elsevier B.V. All rights reserved.

关键词： Bipartite graph matching auction algorithm Combinatorial scientific computing Hybrid MPI-OpenMP programming Performance studies Multicore applications

来源：评论

学校读者我要写书评

暂无评论

On the Communication Range in auction-Based Multi-Agent Target Assignment

On the Communication Range in Auction-Based Multi-Agent Targ...

引用

5th International Workshop on Self-Organizing Systems

作者： Lujak, Marin Giordani, Stefano Univ Roma Tor Vergata Dip Ingn Impresa Rome Italy

ISBN: (纸本)9783642191664

In this paper, we consider a decentralized approach to the multi-agent target assignment problem and explore the deterioration of the quality of assignment solution in respect to the decrease of the quantity of the information exchanged among communicating agents and their communication range when the latter is not sufficient to maintain the connected communication graph. The assignment is achieved through a dynamic iterative auction algorithm in which agents (robots) assign the targets and move towards them in each period. In the case of static targets and connected communication graph, the algorithm results in an optimal assignment solution. The assignment results are compared with two benchmark cases: a centralized one in which all the global information is known and therefore, the optimal assignment can be found, and the greedy one in which each agent moves towards the target with the highest benefit without communication with any other agent.

关键词： Multi-agent auction algorithm target assignment random geometric graph network optimization

来源：评论

学校读者我要写书评

暂无评论

An auction Approach to Resource Allocation with Interference Coordination in LTE-A Systems

An Auction Approach to Resource Allocation with Interference...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： ElBamby, Mohammed S. Elsayed, Khaled M. F. Univ Oulu CWC Oulu Finland Cairo Univ Dept Elect & Commun Engn Giza 12613 Egypt

ISBN: (纸本)9781479930838

We propose a resource allocation scheme based on the auction algorithm that aims at minimizing inter-cell interference (ICI) in multi-carrier LTE-A systems. The prices paid for resources by cell-edge users are infrequently exchanged between adjacent cells to help deciding who needs a specific resource the most. Furthermore, the Relative Narrowband Transmit Power (RNTP) indicator that is exchanged between cells in the LTE-A system is exploited to minimize the information exchange rate. When RNTP is used, only resources that suffer interference higher than a certain threshold are considered in the price exchange mechanism. Performance evaluation results show that the proposed scheme significantly improves the cell-edge throughput. The use of RNTP not only minimizes the exchange overhead, especially in a multi-carrier scenario, but it also improves the system performance as the cell neighbors would not avoid using a resource unless they are the culprit interferers to the original cell that uses it.

关键词： Resource allocation auction algorithm inter-cell interference coordination

来源：评论

学校读者我要写书评

暂无评论

Dual auction (and recourse) opportunistic protocol for light-trail network design

Dual auction (and recourse) opportunistic protocol for light...

引用

3rd International Conference on Wireless and Optical Communications Networks

作者： Gumaste, Ashwin Zheng, Si Qing Indian Inst Technol KR Sch IT Bombay 400076 Maharashtra India Univ Texas Dallas Dept Comp Sci Richardson TX 75080 USA

ISBN: (纸本)9781424403394

A light-trail is a generalization of a lightpath such that multiple nodes can take part in communication along the path. Light-trail based networks lead to dynamic provisioning and optical multicasting while deploying a pragmatic low-cost platform. Dynamic connections can be setup and torn down over semi. permanent light-trails facilitating bandwidth-on-demand and optical multicasting. We introduce a protocol that enables efficient dynamic provisioning and fairness within light-trails. The protocol is based on a modification of the auction algorithm. We apply this protocol to bandwidth allocation within a light-trail as well as to the task of growth and reduction of the virtual topology of light-trails. The article presents an analysis of this protocol and its functioning. We extensively simulate this protocol. A new performance metric for light-trail networks called the opportunistic ratio (OR) is defined. The OR also enables computation of fairness in light-trail networks.

关键词： light-trail WDM ring networks auction algorithm

来源：评论

学校读者我要写书评

暂无评论

Solution of Fire Coordination Scheme of Equipment System Based on Fuzzy Clustering-auction Mechanism 39

Solution of Fire Coordination Scheme of Equipment System Bas...

引用

39th Chinese Control Conference (CCC)

作者： Xu, Ke-hu Wang, Guo-sheng Army Acad Armored Force Dept Weapon & Control Beijing 100072 Peoples R China

ISBN: (纸本)9789881563903

Aiming at the problem of the large-scale weapon target distribution model, the conventional algorithms are low efficient to obtain the solution and can not obtain the fire optimization scheme untimely. Thus a new two-level task optimization distribution model is constructed, which can obtain a distribution scheme in a shorter time by combining the fuzzy clustering algorithm with the auction algorithm. The numerical example shows that the established collaborative task allocation model and the corresponding solution method can get the task allocation scheme in time and effectively, and solve the problem of the fire power optimal allocation of the large-scale weapon-target.

关键词： Collaborative task allocation clustering algorithm auction algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：