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

A modified auction algorithm for the shortest path problem

Optimization Methods and Software 1994年第3期4卷 209-224页

作者： Cerulli, R. De Leone, R. Piacente, G. Dipartimento di Informatica e Applicazioni Università di Salemo Salerno Italy Center for Parallel Optimization Computer Sciences Department University of Wisconsin Madison Madison WI53706 1210 West Dayton Street United States Dipartimento di Matematica Universita di Camerino Camerino Italy

A modified auction algorithm for solving the shortest path problem is presented and convergence is established. The proposed method differs from the standard auction algorithm in the way dual variables are updated. By relaxing the dual feasibility requirement we were able to reduce the total number of iterations required by the auction algorithm to compute the shortest path. Computational results show the advantage of this new approach, especially when the number of intermediate nodes in the shortest path from the origin to the destination is large. © 1994, Taylor & Francis Group, LLC. All rights reserved.

关键词： auction algorithm Shortest path

来源：评论

学校读者我要写书评

暂无评论

Task allocation of multi-AUVs based on innovative auction algorithm

Task allocation of multi-AUVs based on innovative auction al...

引用

作者： Zhang, Ziying Wang, Jie Xu, Dong Meng, Yulong School of Computer Science and Technology Harbin Engineering University Harbin150001 China

ISBN: (纸本)9781538636749

Based on task allocation of multi-AUV (Autonomous Underwater Vehicle) system, the innovative auction algorithm is applied to hunting task assignments of multi-AUV. The two most decisive factor in the auction algorithm: the election of the auctioneer and the calculation of bidding value. In the traditional auction algorithm, the auctioneer's choice follows the principle of "Who finds the target, who is the auctioneer", but this principle seriously threatens the security and robustness of auction process of the multi-AUV. We propose a new method to determine auctioneer and the method of determining the bidding value of multiple AUV in the auction algorithm, and we have made an essential optimization of the auction algorithm. The final experimental results show that the optimized auction algorithm is compared with the traditional auction algorithm and other hunting tasks allocation algorithms, the security and robustness of the innovative auction has a better effect. © 2017 IEEE.

关键词： auction algorithm AUVs cooperate Mission allocation Mission coordination

来源：评论

学校读者我要写书评

暂无评论

Task Allocation of Multi-AUVs Based On Innovative auction algorithm

Task Allocation of Multi-AUVs Based On Innovative Auction Al...

引用

10th International Symposium on Computational Intelligence and Design (ISCID)

作者： Zhang, Ziying Wang, Jie Xu, Dong Meng, Yulong Harbin Engn Univ Sch Comp Sci & Technol Harbin 150001 Heilongjiang Peoples R China

ISBN: (纸本)9781538636749

关键词： auction algorithm AUVs cooperate Mission allocation Mission coordination

来源：评论

学校读者我要写书评

暂无评论

auction algorithm Approaches for Dynamic Weapon Target Assignment Problem

Auction Algorithm Approaches for Dynamic Weapon Target Assig...

引用

International Conference on Computer Science and Network Technology

作者： Jun Chen Jianwen Yang Guanfeng Ye Department of Six Air Force Airborne Academy Guilin China Department of Six Air Force Airborne Academy Guilin China

ISBN: (纸本)9781467381741

This article takes the multi-weapon formation coordination attack ground target as the background. We have established the mathematical model of the ground maneuvering target with the constraint space factor. We design an anytime algorithm for solving this kind of optimization problem based on the idea of distributed cooperative auction algorithm and give the method to optimize the auction algorithm for DWTA problem. Our computational results show that by using these algorithms, relatively large instances of the DWTA problem can be solved near-optimally in a few seconds on a standard PC.

关键词： DWTA auction algorithm Cooperative Attack maneuvering target weapons algorithms Targets Mathematical Model ground

来源：评论

学校读者我要写书评

暂无评论

An auction algorithm for Market Equilibrium withWeak Gross Substitute Demands

引用

ACM TRANSACTIONS ON ECONOMICS AND COMPUTATION 2023年第3-4期11卷 1-24页

作者： Garg, Jugal Husic, Edin Vegh, Laszlo A. Univ Illinois 104 S Mathews Ave Urbana IL 61801 USA USI SUPSI IDSIA Via Santa 1 CH-6962 Viganello Switzerland London Sch Econ & Polit Sci Houghton St London WC2A 2AE England

We consider the Arrow-Debreu exchange market model under the assumption that the agents' demands satisfy the weak gross substitutes (WGS) property. We present a simple auction algorithm that obtains an approximate market equilibrium for WGS demands assuming the availability of a price update oracle. We exhibit specific implementations of such an oracle for WGS demands with bounded price elasticities and for Gale demand systems.

关键词： auction algorithm Weak gross substitutes Fisher equilibrium Gale equilibrium

来源：评论

学校读者我要写书评

暂无评论

Multi-robot Dynamic Task Allocation Based on Improved auction algorithm

Multi-robot Dynamic Task Allocation Based on Improved Auctio...

引用

作者： Shiguang Wu Xiaojie Liu Xingwei Wang Xiaolin Zhou Mingyang Sun School of Computer Science And Engineering Northeastern University

Multi-robot task detection and task execution is an important direction that people have considered *** have considered the dynamic issues related to the detection and execution tasks of multiple *** paper presents an improved auction algorithm to solve this problem and combines it with the auction algorithm by optimizing the execution capacity utilization and load balancing of the *** designing a new auction cost function,the execution ability and load balancing of the robot are added to the auction algorithm,and the matching of the execution ability and task difficulty is added to the assignment of task *** addition,we also add a task sequence adjustment mechanism to avoid the redundant loss of the robot due to a lack of global consideration during a single *** compare the algorithm with SSI and *** experimental results show that this method is superior to the existing methods of performance utilization and load balancing.

关键词： Multi-robot System(MRS) Multi-robot Task Allocation(MRTA) auction algorithm Load balance

来源：评论

学校读者我要写书评

暂无评论

Research on Fire Engine Dispatching Problem Based on Improved auction algorithm

Research on Fire Engine Dispatching Problem Based on Improve...

引用

第37届中国控制会议

作者： Ning Yang Huawen Ye Zhifeng Qiu Yan Li Weihua Gui School of Information Science and Engineering Central South University

This paper addresses the dispatch problem of fire engines in the event of multiple fires. In view of the rapid change of fire status with time, the time-varying function is used to describe the change of fire status. Then we can treat the fire dispatch problem as a dynamic task allocation problem. Firstly, based on the centralized idea, the depth-first algorithm is used to solve the multi-task assignment problem. Secondly, through this centralized algorithm example simulation, we proposed multi-stage task allocation strategy and designed a new revenue function to improve the auction algorithm. Finally, the effectiveness of the improved auction algorithm is verified by the example simulation.

关键词： Fire engine dispatching depth-first algorithm auction algorithm

来源：评论

学校读者我要写书评

暂无评论

A Distributed auction-Based algorithm for the Nonconvex Economic Dispatch Problem

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2014年第2期10卷 1124-1132页

作者： Binetti, Giulio Davoudi, Ali Naso, David Turchiano, Biagio Lewis, Frank L. Polytech Bari I-70125 Bari Italy Univ Texas Arlington Arlington TX 76015 USA

This paper presents a distributed algorithm based on auction techniques and consensus protocols to solve the nonconvex economic dispatch problem. The optimization problem of the nonconvex economic dispatch includes several constraints such as valve-point loading effect, multiple fuel option, and prohibited operating zones. Each generating unit locally evaluates quantities used as bids in the auction mechanism. These units send their bids to their neighbors in a communication graph that supports the power system and which provides the required information flow. A consensus procedure is used to share the bids among the network agents and resolves the auction. As a result, the power distribution of generating units is updated and the generation cost is minimized. The effectiveness of this approach is demonstrated by simulations on standard test systems.

关键词： auction algorithm distributed algorithm economic dispatch (ED) nonconvex optimization smart grid

来源：评论

学校读者我要写书评

暂无评论

Applying an auction optimization algorithm to mobile edge computing for security

引用

IET COMMUNICATIONS 2022年第10期16卷 1130-1141页

作者： Wang, Yi Tang, Tao Jiang, Fang Xu, Yaohua Li, Liping Huang, Rong Anhui Univ Minist Educ Key Lab Intelligent Comp & Signal Proc Hefei 230601 Anhui Peoples R China Chinese Acad Sci Key Lab Wireless Sensor Network & Commun Shanghai Inst Microsyst & Informat Technol Shanghai 200050 Peoples R China

The great demand for mobile blockchain computing power is often unsatisfied by terminal devices, so computational tasks are offloaded to edge computing servers. This paper proposes a new mobile communication blockchain assumption, forms a computing power alliance (CPA), and builds a smart contract-based security model. First, mining difficulty compensates for the personal computing power outside the CPA to increase the block generation difficulty. Second, contract account funds are used to increase the cost of malicious nodes seeking to launch forking attacks, and the duration is used to limit mining. Finally, a court trial is opened to select validators to verify the fork. The auction algorithm is used to allocate computing power in the CPA, and a price utility function is constructed to maximize social welfare. The joint optimization algorithm increases the transaction price and improves the system security. Simulation results verify that the system security increases with the blocked funds and duration, and the forking attack success rate approaches zero as the number of validators increases. The proposed algorithm provides considerable sum utility and average revenue gains versus traditional methods under different numbers of mobile users and computational capabilities, and the security of the algorithm is also higher.

关键词： auction optimization algorithm block generation difficulty CPA mobile communication blockchain assumption price utility function contract account funds computational capabilities system security increases validators increases mobile blockchain computing power terminal devices joint optimization algorithm edge computing optimisation mobile edge blocked funds computer network security forking attack success rate approaches forking attacks blockchains computational tasks personal computing power mobile users mobile computing mining difficulty compensates smart contract-based security model contracts auction algorithm computing power alliance

来源：评论

学校读者我要写书评

暂无评论

Weapon target assignment strategy for multi-missile cooperative guidance with auction algorithm

Weapon target assignment strategy for multi-missile cooperat...

引用

第40届中国控制会议

作者： Qingze Li Xiwang Dong Qingdong Li Jianglong Yu Zhang Ren School of Automation Science and Electrical Engineering Science and Technology on Aircraft Control Laboratory Beihang University Key Laboratory of Dependable Service Computing in Cyber Physical Society (Chongqing University) Ministry of Education of ChinaChongqing University

This paper presents a weapon target assignment method to reduce maneuverability overload through redistribution for multi-missile cooperative attack. Firstly, a dynamic constrained model of multi-missile cooperative attack on multi-target is established. Secondly, in order to evaluate the missile’s cooperative attack performance better, a cooperative attack probability matrix considering the cooperative attack efficiency is constructed by taking the time-to-go and the line-of-sight rate as *** kinds of maneuvering overload results are compared to verify the effectiveness of redistribution, including unassigned process, primary target assignment and redistribution at the beginning of mid-to-terminal guidance handover. Then, an auction algorithm is used to solve the target assignment problem under multiple constraints. Finally, the simulation results show that the proposed algorithm is much less time-consuming than the existing intelligent optimization algorithms and meets the real-time requirement.

关键词： Weapon target assignment Multi-missile cooperative attack Redistribution auction algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：