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

11th International Symposium on Computational Intelligence and Industrial Applications, ISCIIA 2024

作者： Yang, Sili Zhang, Jia Wu, Ruotong Xin, Bin Beijing Institute of Technology Beijing 10081 China National Key Laboratory of Autonomous Intelligent Unmanned Systems Beijing Institute of Technology Beijing 100081 China

ISBN: (纸本)9789819647521

To enhance the tactical planning capabilities of air defense systems, this paper develops a mathematical model for the coalition formation problem involving defense and control resources. Given the uncertainty in task scenarios and the high demand for rapid solutions, a multi-round auction algorithm, inspired by the British auction model in auction theory, is proposed. This algorithm is tailored for the formation of large-scale, heterogeneous, multi-agent coalitions. It improves task efficiency, optimizes the utilization of internal resources, and effectively addresses various potential threats. Through simulation experiments, a comparison with the integer linear programming method demonstrates that the proposed multi-round auction algorithm outperforms in key metrics such as total battlefield coverage, coalition stability, and other relevant indicators. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： auction algorithm Coalition Formation Multi-agent

来源：评论

学校读者我要写书评

暂无评论

auction algorithm Approaches for Dynamic Weapon Target Assignment Problem 4

Auction Algorithm Approaches for Dynamic Weapon Target Assig...

引用

4th International Conference on Computer Science and Network Technology (ICCSNT)

作者： Chen, Jun Yang, Jianwen Ye, Guanfeng Air Force Airborne Acad Dept Six Guilin Peoples R China

ISBN: (纸本)9781467381734

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

来源：评论

学校读者我要写书评

暂无评论

A Distributed auction algorithm for Task Assignment With Robot Coalitions

引用

IEEE TRANSACTIONS ON ROBOTICS 2024年 40卷 4787-4804页

作者： Deng, Ruiliang Yan, Rui Huang, Peinan Shi, Zongying Zhong, Yisheng Tsinghua Univ Dept Automat Beijing 100084 Peoples R China Beihang Univ Sch Artificial Intelligence Beijing 100083 Peoples R China

This study addresses the task assignment problem with robot coalitions, as encountered in practical scenarios, such as multiplayer reach-avoid games. Unlike the classical assignment problem where a single robot performs each task, the problem considered here involves tasks that require execution by a robot coalition consisting of two robots. This task assignment problem is a special instance of 3-set packing problem, which is known to be nondeterministic polynomial time (NP)-hard. We introduce the concept of $\epsilon$-coalition-competitive equilibrium ($\epsilon$-CCE) to characterize a kind of approximate solution that offers guaranteed performance. A distributed auction algorithm is developed to find an $\epsilon$-CCE within a finite number of iterations. In addition, several enhancements have been implemented to adapt the auction algorithm for practical applications where the task assignment problem may vary over time. Numerical simulations demonstrate that the distributed algorithm achieves satisfactory approximation quality.

关键词： auction algorithm competitive equilibrium (CE) competitive equilibrium (CE) reach-avoid games reach-avoid games robot coalitions robot coalitions task assignment task assignment task assignment

来源：评论

学校读者我要写书评

暂无评论

A Decision-Making auction algorithm for Demand Response in Microgrids

引用

IEEE TRANSACTIONS ON SMART GRID 2018年第4期9卷 3553-3562页

作者： Chang, Chih-Lun Peng, Jimmy C. -H. Univ Texas Dallas Dept Mech Engn Richardson TX 75080 USA Natl Univ Singapore Dept Elect & Comp Engn Singapore Singapore

Distributed energy resources installed in the residential areas enable energy consumers to participate in the demand response of distribution systems. In the literature, the algorithms used for the decision-making process of an energy consumer are often centralized and require a dedicated communication link with the power utility. In this paper, a novel decision-making algorithm known as the auction decision process has been proposed. It helps energy consumers to independently meet the demand response in a decentralized manner. The resultant demand response operates in a distributed manner, where the limited information is transmitted among the neighboring consumers using the short-range ZigBee communication. This minimizes the required initial bulk investment for a power utility compared to using a centralized communication system. The data privacy is also improved when compared to the centralized approach. For this work, finding a path with the least transmission loss is selected as the desired constraint for the decision-making process of the demand response. The proposed method has been demonstrated using the IEEE 33 bus systems.

关键词： auction algorithm demand response distributed network microgrid power system renewable energy smart grid virtual power plant (VPP)

来源：评论

学校读者我要写书评

暂无评论

A Resource-Oriented, Decentralized auction algorithm for Multirobot Task Allocation

引用

IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING 2015年第4期12卷 1469-1481页

作者： Lee, Dong-Hyun Zaheer, Sheir Afgen Kim, Jong-Hwan Korea Adv Inst Sci & Technol Dept Elect Engn Taejon 305701 South Korea

This paper proposes a resource-oriented, decentralized auction algorithm (RODAA) for multirobot task allocation considering multiple resources of the robots and limited robot communication range. The resources that this paper focuses on are the expendable supplies that a robot consumes and recharges while performing tasks, such as energy. In the proposed algorithm, each robot generates its cost for the task in a probabilistic manner considering multiple paths that visit none or different combinations of refill stations for performing the task based on the robot's residual resources. For robust and time-efficient task allocation with limited robot communication range in a dynamic network, a multihop-based auction algorithm is proposed. This paper also introduces a solar panel cleaning mission as a new application for multirobot systems and the proposed algorithm is implemented in the simulation of the mission. The simulation results demonstrate that the proposed algorithm is capable of completing the panel cleaning mission faster than other auction-based task allocation algorithms and has lower overall resource consumption.

关键词： auction algorithm decentralized task allocation multirobot systems solar panel cleaning

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Dual-Hunting Control Based on auction algorithm

引用

INTERNATIONAL JOURNAL OF FUZZY SYSTEMS 2023年第7期25卷 2816-2827页

作者： Dong, Dianbiao Du, Zhize Min, Jinchan Lu, Runtian Liu, Junmin Yu, Dengxiu Northwestern Polytech Univ Sch Mech Engn Xian 710072 Shannxi Peoples R China Northwestern Polytech Univ Unmanned Syst Res Inst Xian 710072 Shaanxi Peoples R China Shaanxi Xueqian Normal Univ Phys Educ Dept Xian 710100 Peoples R China Shanghai Runzhang Intelligent Technol Co Ltd Shanghai Peoples R China

In this paper, a fuzzy dual-hunting control based on auction algorithm is proposed. Relying on a single containment gives the small target the possibility of escape. Therefore, we design a dual-hunting framework for multiagent systems to hunt a small target. A hunting formation with double containment is designed to reduce the possibility of the target escaping. Then, an auction algorithm is designed to generate the desired formation and rationally plan the positions of the agents in the hunting formation. To improve the applicability of the dual-hunting framework, we take high-order multiagent systems as the research object, and the fuzzy logic system (FLS) is introduced to approximate the unknown nonlinear dynamics (UND) due to higher-order system model errors and environmental disturbances. Based on FLS and backstepping method, a hunting controller for high-order systems is designed, which enables multiagent systems to track targets and form hunting formations. Furthermore, the Lyapunov function is designed to prove the stability of the controller. Finally, the effectiveness of the proposed method is demonstrated by simulating a multiagent system containing 12 intelligences hunting for a dynamic target.

关键词： Target hunting auction algorithm Backstepping control Fuzzy logic systems

来源：评论

学校读者我要写书评

暂无评论

A Novel Hybrid auction algorithm for Multi-UAVs Dynamic Task Assignment

引用

IEEE ACCESS 2020年 8卷 86207-86222页

作者： Duan, Xiaojun Liu, Huiying Tang, Hong Cai, Qing Zhang, Fan Han, Xiaotian Northwestern Polytech Univ Natl Key Lab UAV Technol Xian 710072 Peoples R China Northwestern Polytech Univ Sch Automat Xian 710072 Peoples R China Northwestern Polytech Univ Sch Mech Engn Xian 710072 Peoples R China Yantai Univ Sch Comp & Control Engn Yantai 264005 Peoples R China

The auction algorithm is a widely used method for task assignments. However, most existing auction algorithms yield poor performance when applied to multi-UAVs dynamic task assignment. To end this, we propose a novel hybrid & x201C;Two-Stage & x201D;auction algorithm based on the hierarchical decision mechanism and an improved objective function, which simultaneously realizes heterogeneous multi-UAVs dynamic task assignment with limited resources of each UAV and avoidance obstacle path planning. In the first stage, according to the novel proposed hierarchical decision mechanism, we select a task that is urgently needed to be performed in the task group by using the decision function and three attribute values of tasks. After the first stage, it will result in a reasonable auction sequence, instead of random auction sequence as in previous algorithms. In the second stage, by considering the coverage factor and adaptive-limitation penalty term, a novel objective function is proposed and directs related UAVs for auction. In addition, we combine the structural advantages of the centralized and distributed auction algorithm, which greatly promotes its performance in dynamic task assignment. The experimental results demonstrate that the proposed method outperforms many state-of-the-art models in efficiency and robustness.

关键词： Task analysis Heuristic algorithms Vehicle dynamics Unmanned aerial vehicles Linear programming Resource management Dynamic scheduling Hierarchical decision mechanism unmanned air vehicle dynamic task assignment auction algorithm decision function

来源：评论

学校读者我要写书评

暂无评论

Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs

引用

RANDOM STRUCTURES & algorithmS 2016年第2期48卷 384-395页

作者： Naparstek, Oshri Leshem, Amir Bar Ilan Univ Sch Engn IL-52900 Ramat Gan Israel

In this paper we analyze the expected time complexity of the auction algorithm for the matching problem on random bipartite graphs. We first prove that if for every non-maximum matching on graph G there exist an augmenting path with a length of at most 2l + 1 then the auction algorithm converges after N . l iterations at most. Then, we prove that the expected time complexity of the auction algorithm for bipartite matching on random graphs with edge probability p = c log(N) N and c > 1 is O (N log(2)(N)/log(Np)) w.h.p. This time complexity is equal to other augmenting path algorithms such as the HK algorithm. Furthermore, we show that the algorithm can be implemented on parallel machines with O(log(N)) processors and shared memory with an expected time complexity of O(N log(N)). (c) 2014 Wiley Periodicals, Inc.

关键词： complexity auction algorithm Pushrelabel algorithm Bipartite matching random graphs

来源：评论

学校读者我要写书评

暂无评论

A COMPUTATIONAL ANALYSIS OF THE auction algorithm

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 1994年第1期74卷 161-169页

作者： SCHWARTZ, BL TASC ROSSLYN OFFARLINGTONVA 22209

The so-called linear assignment problem (LAP) is a special case of linear programming and one of the important early applications. Because of its structure, the LAP has always been easier to solve than the general LP, and over decades various specific algorithms have been developed. The most recent (1987) is one called the auction algorithm, which has proved empirically to be highly efficient. This paper undertakes to explain this fine performance by providing an analysis of the computational complexity of the auction algorithm. Underlying assumptions are necessary about the statistical distribution of the ensemble of coefficient sets of the LAP, so the result is an expected value. O(N2 log N). Some theoretical approximations are used;and to maintain a degree of rigor, error budgets are applied to these approximations.

关键词： COMBINATORIAL OPTIMIZATION COMPLEXITY PARALLEL PROCESSING auction algorithm

来源：评论

学校读者我要写书评

暂无评论

An Efficient Vectorized auction algorithm for Many-Core and Multicore Architectures 8th

An Efficient Vectorized Auction Algorithm for Many-Core and ...

引用

8th Latin American High Performance Computing Conference (CARLA)

作者： Sena, Alexandre C. Silva, Marcio N. P. Nascimento, Aline P. Univ Estado Rio de Janeiro Rio De Janeiro RJ Brazil Univ Fed Fluminense Niteroi RJ Brazil

ISBN: (纸本)9783031042096;9783031042089

The auction algorithm has been widely used to solve problems in several areas. One important characteristic of this algorithm is that its distributive nature simplifies the adoption of parallel implementations. With its various processing cores and 512-bit vectorized instructions, many-core and multicore machines have the potential to considerably increase the performance of this algorithm. The aim of this work is to efficiently execute the auction algorithm in these architectures. The main contributions of this work are: proposal and implementation of a scalable vectorized version for AVX-512 instructions;detailed evaluation of vectorized and parallel versions. Results show that vectorization in conjunction with parallelism is capable of harnessing the full potential of many-core and multicore machines. Moreover, the best scalability of a many-core processor, allowed over 750-fold speedup when comparing the proposed parallel vectorized version against the original sequential one.

关键词： auction algorithm Vectorization Multicore/Many-core

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：