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

Multi-UAV Objective Assignment Using hungarian Fusion Genetic algorithm

IEEE ACCESS 2022年 10卷 43013-43021页

作者： Jiang Yan Wang Daobo Bai Tingting Yan Zongyuan Nanjing Univ Aeronaut & Astronaut Coll Automat Engn Nanjing 210000 Peoples R China

In the background of air combat, the situation between multiple unmanned aerial vehicle (multi-UAV) and objectives has a certain impact on the task assignment. In order to improve the efficiency of assignment and obtain the best assignment scheme during the process of performing tasks, this paper proposes a method to evaluate the situation at a certain time. This method is the basis for establishing a multi-UAV objective assignment model. For solving the model, this paper presents the hungarian fusion Genetic algorithm. It first uses the feasible solutions solved by the hungarian algorithm as the elite individuals in the initial population of the genetic algorithm, and then uses the objective function in the assignment model as the fitness function to optimize the results. The algorithm solves the problem that the assignment result of the hungarian algorithm is not unique, and optimizes the drawback that the traditional Genetic algorithm is prone to fall into local optimum. The simulation verified the effectiveness of the situational assessment method and the improved algorithm.

关键词： Missiles Genetic algorithms Autonomous aerial vehicles Azimuth Task analysis Atmospheric modeling Aircraft Situational assessment method objective assignment model hungarian algorithm genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

hungarian Optimum Assignment algorithm with Java Computer Animation

Hungarian Optimum Assignment Algorithm with Java Computer An...

引用

SoutheastCon

作者： Makohon, Ivan Nguyen, Duc T. Cetin, Mecit Ng, ManWo Old Dominion Univ Modeling Simulat & Visualizat Engn Norfolk VA 23529 USA Old Dominion Univ CEE Dept Norfolk VA 23529 USA Old Dominion Univ MSVE Dept Norfolk VA 23529 USA Old Dominion Univ Strome Coll Business Norfolk VA 23529 USA

ISBN: (纸本)9781509022465

The classical, popular hungarian algorithm for solving the "optimum assignment" problems (with its broad engineering/science applications) has been well-documented in the literature. Other (more efficient) variations of the hungarian algorithm have also been extensively studied by the research communities. In this paper, the basic hungarian algorithm is revisited, with the ultimate goal of developing a useful, user friendly, attractive Java computer animation for "effectively teaching" this basic/important optimum assignment algorithm. The final product from this work will help both the students and their instructor to not only mastering this technical subject, but also provide valuable tool for obtaining the solutions for homework assignments, class examinations, self-assessment tools, etc. A demo video of the hungarian algorithm's animation and result can be viewed online from any web browser using the website provided in reference [9].

关键词： hungarian algorithm Optimum Assignment Java Animation

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Role Assignment Formation Control algorithm Based on hungarian Method 4

A Dynamic Role Assignment Formation Control Algorithm Based ...

引用

IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI)

作者： Wang, Huiying Shi, Dianxi Song, Bingnan Natl Univ Def Technol Sch Comp Sci Changsha Hunan Peoples R China Acad Mil Sci PLA China Natl Innovat Inst Def Technol Beijing Peoples R China

ISBN: (纸本)9781538693803

In the multi-robot systems, a great challenge is the development of algorithms to dynamically assign positions to robots and to form a desired formation, not relying on a priori assignment information. In this paper, to address this problem, we propose a dynamic role assignment formation control algorithm based on an improved hungarian method that combines role assignment and formation synthesis together. This algorithm can synchronously finish role assignment and decide where to form the predefined formation with the lowest cost. And the improved hungarian method guarantees that no matter the number of robots and the number of positions are equal or not the algorithm can always achieve the desired formation. We evaluate the performance of our algorithm through a series of simulation experiments and comparison with other algorithms. The results prove that the presented algorithm is flexible, accurate and efficient.

关键词： multi-robot system formation control role assignment hungarian algorithm

来源：评论

学校读者我要写书评

暂无评论

Opportunistic Allocation of Resources for Smart Metering Considering Fixed and Random Wireless Channels

引用

SENSORS 2025年第8期25卷

作者： Jara, Christian Inga, Juan Inga, Esteban Univ Politecn Salesiana Dept Masters Degree Elect Master Elect Program MEL EC-010102 Cuenca Ecuador Univ Politecn Salesiana Telecommun & Telemat Res Grp GITEL EC-010102 Cuenca Ecuador Univ Politecn Salesiana Smart Grids Res Grp GIREI EC-010102 Cuenca Ecuador

This paper presents an optimization model for wireless channel allocation in cellular networks, specifically designed for the transmission of smart meter (SM) data through a mobile virtual network operator (MVNO). The model efficiently allocates transmission channels, minimizing smart grid (SG) costs. The MVNO manages fixed and random channels through a shared access scheme, optimizing meter connectivity. Channel allocation is based on a Markovian approach and optimized through the hungarian algorithm that minimizes the weight in a bipartite network between meters and channels. In addition, cumulative tokens are introduced that weight transmissions according to channel availability and network congestion. Simulations show that dynamic allocation in virtual networks improves transmission performance, contributing to sustainability and cost reduction in cellular networks. This study highlights the importance of inefficient resource management by cognitive mobile virtual network and cognitive radio virtual network operators (C-MVNOs), laying a solid foundation for future applications in intelligent networks. This work is motivated by the increasing demand for efficient and scalable data transmission in smart metering systems. The novelty lies in integrating cumulative tokens and a Markovian-based bipartite graph matching algorithm, which jointly optimize channel allocation and transmission reliability under heterogeneous wireless conditions.

关键词： resource optimization wireless channels cellular networks smart meters cognitive mobile virtual network operator channel allocation hungarian algorithm matching congestion management data transmission

来源：评论

学校读者我要写书评

暂无评论

Research on Vehicle Detection algorithm Based on Improved YOLOv5 and Kalman filter 24

Research on Vehicle Detection Algorithm Based on Improved YO...

引用

3rd International Conference on Artificial Intelligence and Education, ICAIE 2024

作者： Xia, Lili Chen, Xiaoyan Chengyi College Jimei University Fujian Xiamen China School of Software Engineering Xiamen University of Technology Fujian Xiamen China

ISBN: (纸本)9798400712692

The rise of Intelligent Transportation System (ITS) has put forward higher requirements for vehicle-related technologies, and vehicle detection and tracking is the basis for realising many functions of ITS. Therefore, this paper proposes a vehicle detection method based on the combination of improved YOLOv5 target detection algorithm and Kalman filter. On the basis of the original algorithm of YOLOv5, improvements are made for the unsatisfactory detection of small targets and the imbalance of the detected object categories, so as to reduce the leakage of detection, improve the accuracy rate, and realise fast and accurate vehicle detection, and combined with the Kalman filter for the stable tracking of the detected vehicles, which is then matched according to the hungarian algorithm. The validation results show that the algorithm can better meet the real-time detection requirements of traffic scenes and has high accuracy, which has good practical value. © 2024 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： hungarian algorithm intelligent transportion Kalman filter YOLOv5

来源：评论

学校读者我要写书评

暂无评论

Greedy Graph Coloring and hungarian algorithms for Resource Scheduling in TWDM-PON

引用

IEEE ACCESS 2024年 12卷 190400-190410页

作者： Arnaout, Sandra Rahman, Md Arifur Mowla, Md Munjure Hausman, Slawomir Korbel, Piotr IS Wireless Res & Innovat Dept PL-05500 Piaseczno Poland Lodz Univ Technol Inst Elect PL-93590 Lodz Poland

The time and wavelength division multiplexing passive optical network (TWDM-PON) allows numerous users to share a single optical fiber and wavelength. In TWDM-PON, the optical network unit (ONU) has different upstream and downstream user traffic to serve using a limited amount of optical resources. Dynamic wavelength and time slot scheduling play an important role in managing user traffic variation. As is well known, delay is one of the most important performance parameters of TWDM-PON. This motivates us to investigate the delay optimization problem and solve it through resource scheduling. To optimize delay performance, we propose a greedy graph coloring algorithm (GGCA) to dynamically assign the timeslots for upstream packet transmissions. Moreover, we also propose a hungarian algorithm (HA) to solve the wavelength scheduling problem within the scheduled timeslots by the GGCA. Numerical simulations show that the proposed GGCA and HA provide approximately 70- 80% delay reduction compared to a fixed baseline algorithm that schedules the timeslots and the wavelength in a fixed manner.

关键词： Delays Bandwidth Optical network units Heuristic algorithms Resource management Dynamic scheduling Approximation algorithms Passive optical networks Optimization Optical fibers Delay optimization greedy graph coloring algorithm hungarian algorithm resource scheduling time and wavelength division multiplexing passive optical network

来源：评论

学校读者我要写书评

暂无评论

Polynomial eigenvalue decomposition for eigenvalues with unmajorised ground truth – Reconstructing analytic dinosaurs

Science Talks

引用

Science Talks 2025年 14卷

作者： Schlecht, Sebastian J. Weiss, Stephan Dept. of Signal Processing and Acoustics Aalto University Espoo Finland Dept. of Art and Media Aalto University Espoo Finland Multimedia Comms & Signal Processing Friedrich-Alexander Universität Erlangen-Nürnberg Germany Dept. of Electronic & Electrical Eng University of Strathclyde Scotland Glasgow United Kingdom

When estimated space-time covariance matrices from finite data, any intersections of ground truth eigenvalues will be obscured, and the exact eigenvalues become spectrally majorised with probability one. In this paper, we propose a novel method for accurately extracting the ground truth analytic eigenvalues from such estimated space-time covariance matrices. The approach operates in the discrete Fourier transform (DFT) domain and groups sufficiently eigenvalues over a frequency interval into segments that belong to analytic functions and then solves a permutation problem to align these segments. Utilising an inverse partial DFT and a linear assignment algorithm, the proposed EigenBone method retrieves analytic eigenvalues efficiently and accurately. Experimental results demonstrate the effectiveness of this approach in reconstructing eigenvalues from noisy estimates. Overall, the proposed method offers a robust solution for approximating analytic eigenvalues in scenarios where state-of-the-art methods may fail. © 2025 The Authors

关键词： Analytic eigenvalue decomposition hungarian algorithm Partial reconstruction Space-time covariance estimation Spectral majorisation

来源：评论

学校读者我要写书评

暂无评论

Truncated Robust Natural Watermarking With hungarian Optimization

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2022年第2期32卷 483-495页

作者： You, Jinkun Wang, Yuan-Gen Zhu, Guopu Kwong, Sam Chinese Acad Sci Shenzhen Inst Adv Technol Shenzhen 518055 Peoples R China Univ Chinese Acad Sci Shenzhen Coll Adv Technol Shenzhen 518055 Peoples R China Guangzhou Univ Sch Comp Sci & Cyber Engn Guangzhou 510006 Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China City Univ Hong Kong Shenzhen Res Inst Shenzhen 518057 Peoples R China

Over the past two decades, spread spectrum (SS) embedding has been widely used in digital watermarking due to its competitive performance in robustness and security. However, the robustness of existing secure SS embedding methods, such as natural watermarking (NW) and robust-NW (RNW), is still weak. In this article, we propose a new secure SS embedding method named truncated-RNW (TRNW), which improves the robustness of RNW while maintaining the same security level. The main idea of TRNW is to move RNW-watermarked correlations within an origin-centered sphere onto the spherical surface along the radial direction. Moreover, hungarian algorithm is used to reduce embedding distortion, and the optimized method is called hungarian-TRNW (HTRNW). A theoretical analysis and extensive experiments are conducted to validate the effectiveness of the proposed method. The results show that HTRNW achieves the same security level as RNW and a significant improvement over existing representative secure SS embeddings in terms of robustness.

关键词： Robustness Correlation Watermarking Distortion Media Signal processing algorithms Modulation Spread spectrum embedding natural watermarking robustness security hungarian algorithm

来源：评论

学校读者我要写书评

暂无评论

Slotting Optimization of Warehousing System Based on the hungarian Method 10th

Slotting Optimization of Warehousing System Based on the Hun...

引用

10th International Conference on Management Science and Engineering Management (ICMSEM)

作者： Hu, Yuzhen Zhang, Song Jia, Xiaojuan Chen, Jiajia Harbin Engn Univ Sch Econ & Management Harbin 150001 Heilongjiang Peoples R China

ISBN: (纸本)9789811018374;9789811018367

This paper studies the problem of storage space optimization system based on different demand frequencies and different demand quantities. An 0-1 integer programming model is established aimed at minimizing the objective of total routing with the weight of turnover rate of the goods, based on the principle that something commonly used should be easy to take. Combining the idea of hungarian method, the objective function and constraints are transformed, and then the problem is solved by hungarian methods, which has been proved to get optimal solution. Finally, a data test is provided to illustrate the effectiveness of the problem. This study can provide theoretical and technical support for warehousing slotting optimization system.

关键词： Warehousing system Slotting optimization hungarian algorithm Optimal solution

来源：评论

学校读者我要写书评

暂无评论

hungarian method based joint Transmission mode and Relay selection in Device-to-Device communication 8

Hungarian method based joint Transmission mode and Relay sel...

引用

2015 8th IFIP Wireless and Mobile Networking Conference (WMNC 2015)

作者： Chithra, R. Bestak, Robert Patra, Sarat Kumar Natl Inst Technol Dept Elect & Commun Rourkela India Czech Tech Univ Fac Elect Engn Prague Czech Republic

ISBN: (纸本)9780769556628

The concept of Device-to-Device (D2D) communication has been introduced for local area connectivity as a means to improve the cellular spectrum utilization and to reduce the energy consumption of user equipments. The performance of D2D communication is practically limited due to large distance and/or poor channel conditions between the D2D transmitter and receiver. To overcome these issues, a relay-assisted D2D communication has been introduced where a device relaying is an additional transmission mode along with the existing cellular and D2D transmission modes. In this paper, a transmission mode assignment algorithm based on the hungarian algorithm is proposed to improve the overall system throughput. The proposed algorithm tries to solve two problems: a suitable transmission mode selection for each scheduled transmissions and a device selection for relaying communication between user equipments in the relay transmission mode. Simulation results show that our proposed algorithm could improve the system performance in terms of the overall system throughput and D2D data rate.

关键词： Device-to-device (D2D) communication hungarian algorithm Maximum weighted matching Transmission mode allocation Relaying

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：