With the unprecedented prevalence of Industrial Internet of Things(IIoT)and 5G technology,various applications supported by industrial communication systems have generated exponentially increased processing tasks,whic...With the unprecedented prevalence of Industrial Internet of Things(IIoT)and 5G technology,various applications supported by industrial communication systems have generated exponentially increased processing tasks,which makes task assignment inefficient due to insufficient workers.In this paper,an Intelligent and Trustworthy task assignment method based on Trust and Social relations(ITTS)is proposed for scenarios with many tasks and few workers.Specifically,ITTS first makes initial assignments based on trust and social influences,thereby transforming the complex large-scale industrial task assignment of the platform into the small-scale task assignment for each worker.Then,an intelligent Q-decision mechanism based on workers'social relation is proposed,which adopts the first-exploration-then-utilization principle to allocate tasks.Only when a worker cannot cope with the assigned tasks,it initiates dynamic worker recruitment,thus effectively solving the worker shortage problem as well as the cold start issue.More importantly,we consider trust and security issues,and evaluate the trust and social circles of workers by accumulating task feedback,to provide the platform a reference for worker recruitment,thereby creating a high-quality worker pool.Finally,extensive simulations demonstrate ITTS outperforms two benchmark methods by increasing task completion rates by 56.49%-61.53%and profit by 42.34%-47.19%.展开更多
Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and miss...Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and mission trajectory planning method is proposed to meet the requirements of cross-domain unmanned swarm mission planning.Firstly,the different performances of cross-domain heterogeneous platforms and mission requirements of targets are characterised by using a collection of operational resources.Secondly,an algorithmic framework for joint target assignment and mission trajectory planning is proposed,in which the initial planning of the trajectory is performed in the target assignment phase,while the trajectory is further optimised afterwards.Next,the estimation of the distribution algorithms is combined with the genetic algorithm to solve the objective function.Finally,the algorithm is numerically simulated by specific cases.Simulation results indicate that the proposed algorithm can perform effective task assignment and trajectory planning for cross-domain unmanned swarms.Furthermore,the solution performance of the hybrid estimation of distribution algorithm(EDA)-genetic algorithm(GA)algorithm is better than that of GA and EDA.展开更多
INTRODUCTION Reports indicating that culturally and linguistically diverse(CALD)people-often with migrant backgrounds-in Australia and New Zealand are more likely to be placed in compulsory community treatment(CCT)hav...INTRODUCTION Reports indicating that culturally and linguistically diverse(CALD)people-often with migrant backgrounds-in Australia and New Zealand are more likely to be placed in compulsory community treatment(CCT)have rightlyraised concernsthat such action might be discriminatory.展开更多
Multi-band optical networks are a potential technology for increasing network capacity.However,the strong interference and non-uniformity between wavelengths in multi-band optical networks have become a bottleneck res...Multi-band optical networks are a potential technology for increasing network capacity.However,the strong interference and non-uniformity between wavelengths in multi-band optical networks have become a bottleneck restricting the transmission capacity of multi-band optical networks.To overcome these challenges,it is particularly important to implement optical power optimization targeting wavelength differences.Therefore,based on the generalized Gaussian noise model,we first formulate an optimization model for the problems of routing,modulation format,wavelength,and power allocation in C+L+S multi-band optical networks.Our objective function is to maximize the average link capacity of the network while ensuring that the Optical Signal-to-Noise(OSNR)threshold of the service request is not exceeded.Next,we propose a NonLinear Interferenceaware(NLI-aware)routing,modulation format,wavelength,and power allocation algorithm.Finally,we conduct simulations under different test conditions.The simulation results indicate that our algorithm can effectively reduce the blocking probability by 23.5%and improve the average link capacity by 3.78%in C+L+S multi-band optical networks.展开更多
Satellite Component Layout Optimization(SCLO) is crucial in satellite system design.This paper proposes a novel Satellite Three-Dimensional Component Assignment and Layout Optimization(3D-SCALO) problem tailored to en...Satellite Component Layout Optimization(SCLO) is crucial in satellite system design.This paper proposes a novel Satellite Three-Dimensional Component Assignment and Layout Optimization(3D-SCALO) problem tailored to engineering requirements, aiming to optimize satellite heat dissipation while considering constraints on static stability, 3D geometric relationships between components, and special component positions. The 3D-SCALO problem is a challenging bilevel combinatorial optimization task, involving the optimization of discrete component assignment variables in the outer layer and continuous component position variables in the inner layer,with both influencing each other. To address this issue, first, a Mixed Integer Programming(MIP) model is proposed, which reformulates the original bilevel problem into a single-level optimization problem, enabling the exploration of a more comprehensive optimization space while avoiding iterative nested optimization. Then, to model the 3D geometric relationships between components within the MIP framework, a linearized 3D Phi-function method is proposed, which handles non-overlapping and safety distance constraints between cuboid components in an explicit and effective way. Subsequently, the Finite-Rectangle Method(FRM) is proposed to manage 3D geometric constraints for complex-shaped components by approximating them with a finite set of cuboids, extending the applicability of the geometric modeling approach. Finally, the feasibility and effectiveness of the proposed MIP model are demonstrated through two numerical examples"and a real-world engineering case, which confirms its suitability for complex-shaped components and real engineering applications.展开更多
The multi-target assignment(MTA)problem,a crucial challenge in command control,mission planning,and a fundamental research focus in military operations,has garnered significant attention over the years.Extensively stu...The multi-target assignment(MTA)problem,a crucial challenge in command control,mission planning,and a fundamental research focus in military operations,has garnered significant attention over the years.Extensively studied across various domains such as land,sea,air,space,and electronics,the MTA problem has led to the emergence of numerous models and algorithms.To delve deeper into this field,this paper starts by conducting a bibliometric analysis on 463 Scopus database papers using CiteSpace software.The analysis includes examining keyword clustering,co-occurrence,and burst,with visual representations of the results.Following this,the paper provides an overview of current classification and modeling techniques for addressing the MTA problem,distinguishing between static multi-target assignment(SMTA)and dynamic multi-target assignment(DMTA).Subsequently,existing solution algorithms for the MTA problem are reviewed,generally falling into three categories:exact algorithms,heuristic algorithms,and machine learning algorithms.Finally,a development framework is proposed based on the"HIGH"model(high-speed,integrated,great,harmonious)to guide future research and intelligent weapon system development concerning the MTA problem.This framework emphasizes application scenarios,modeling mechanisms,solution algorithms,and system efficiency to offer a roadmap for future exploration in this area.展开更多
To adapt to the unique demand-supply features of accessory parking lots at passenger transport hubs,a mixed parking demand assignment method based on regression modeling is proposed.First,an optimal model aiming to mi...To adapt to the unique demand-supply features of accessory parking lots at passenger transport hubs,a mixed parking demand assignment method based on regression modeling is proposed.First,an optimal model aiming to minimize total time expenditure is constructed.It incorporates parking search time,walking time,and departure time,focusing on short-term parking features.Then,the information dimensions that the parking lot can obtain are evaluated,and three assignment strategies based on three types of regression models-linear regression(LR),extreme gradient boosting(XGBoost),and multilayer perceptron(MLP)-are proposed.A parking process simulation model is built using the traffic simulation package SUMO to facilitate data collection,model training,and case studies.Finally,the performance of the three strategies is com-pared,revealing that the XGBoost-based strategy performs the best in case parking lots,which reduces time expendi-ture by 29.3%and 37.2%,respectively,compared with the MLP-based strategy and LR-based strategy.This method offers diverse options for practical parking manage-ment.展开更多
As a crucial process in the coordinated strikes of unmanned aerial vehicles(UAVs), weapon-target assignment is vital for optimizing the allocation of available weapons and effectively exploiting the capabilities of UA...As a crucial process in the coordinated strikes of unmanned aerial vehicles(UAVs), weapon-target assignment is vital for optimizing the allocation of available weapons and effectively exploiting the capabilities of UAVs. Existing weapon-target assignment methods primarily focus on macro cluster constraints while neglecting individual strategy updates. This paper proposes a novel weapon-target assignment method for UAVs based on the multi-strategy threshold public goods game(PGG). By analyzing the concept mapping between weapon-target assignment for UAVs and multi-strategy threshold PGG, a weapon-target assignment model for UAVs based on the multi-strategy threshold PGG is established, which is adaptively complemented by the diverse cooperation-defection strategy library and the utility function based on the threshold mechanism. Additionally, a multi-chain Markov is formulated to quantitatively describe the stochastic evolutionary dynamics, whose evolutionary stable distribution is theoretically derived through the development of a strategy update rule based on preference-based aspiration dynamic. Numerical simulation results validate the feasibility and effectiveness of the proposed method, and the impacts of selection intensity, preference degree and threshold on the evolutionary stable distribution are analyzed. Comparative simulations show that the proposed method outperforms GWO, DE, and NSGA-II, achieving 17.18% higher expected utility than NSGA-II and reducing evolutionary stable times by 25% in large-scale scenario.展开更多
Permanent Magnet Synchronous Motors(PMSMs)are widely employed in high-performance drive applications due to their superior efficiency and dynamic capabilities.However,their control remains challenging owing to nonline...Permanent Magnet Synchronous Motors(PMSMs)are widely employed in high-performance drive applications due to their superior efficiency and dynamic capabilities.However,their control remains challenging owing to nonlinear dynamics,parameter variations,and unmeasurable external disturbances,particularly load torquefluctuations.This study proposes an enhanced Interconnection and Damp-ing Assignment Passivity-Based Control(IDA-PBC)scheme,formulated within the port-controlled Hamiltonian(PCH)framework,to address these limitations.A nonlinear disturbance observer is embedded to estimate and compensate,in real time,for lumped mis-matched disturbances arising from parameter uncertainties and external loads.Additionally,aflatness-based control strategy is employed to generate the desired current references within the nonlinear drive system,ensuring accurate tracking of time-varying speed commands.This integrated approach preserves the system’s energy-based structure,enabling systematic stability analysis while enhancing robustness.The proposed control architecture also maintains low complexity with a limited number of tunable parameters,facilitating practical implementation.Simulation and experimental results under various operating conditions demonstrate the effectiveness and robustness of the proposed method.Comparative analysis with conventional proportional-integral(PI)control and standard IDA-PBC strategies confirms its capability to handle disturbances and maintain dynamic performance.展开更多
A channel assignment algorithm with awareness of link traffic is proposed in multi-radio multi-channel wireless mesh networks. First, the physical interference model based on the signal-to-interference-plus-noise rati...A channel assignment algorithm with awareness of link traffic is proposed in multi-radio multi-channel wireless mesh networks. First, the physical interference model based on the signal-to-interference-plus-noise ratio and successful transmission condition is described. The model is more suitable for a wireless communication environment than other existing models. Secondly, a pure integer quadratic programming （PIQP） model is used to solve the channel assignment problem and improve the capacity of wireless mesh networks. Consequently, a traffic- aware static channel assignment algorithm（TASC） is designed. The algorithm adopts some network parameters, including the network connectivity, the limitation of the number of radios and the successful transmission conditions in wireless communications. The TASC algorithm can diminish network interference and increase the efficiency of channel assignment while keeping the connectivity of the network. Finally, the feasibility and effectivity of the channel assignment solution are illustrated by the simulation results. Compared witb similar algorithms, the proposed algorithm can increase the capacity of WMNs.展开更多
Aiming at the problems of convergence-slow and convergence-free of Discrete Particle Swarm Optimization Algorithm(DPSO) in solving large scale or complicated discrete problem, this article proposes Intuitionistic Fuzz...Aiming at the problems of convergence-slow and convergence-free of Discrete Particle Swarm Optimization Algorithm(DPSO) in solving large scale or complicated discrete problem, this article proposes Intuitionistic Fuzzy Entropy of Discrete Particle Swarm Optimization(IFDPSO) and makes it applied to Dynamic Weapon Target Assignment(WTA). First, the strategy of choosing intuitionistic fuzzy parameters of particle swarm is defined, making intuitionistic fuzzy entropy as a basic parameter for measure and velocity mutation. Second, through analyzing the defects of DPSO, an adjusting parameter for balancing two cognition, velocity mutation mechanism and position mutation strategy are designed, and then two sets of improved and derivative algorithms for IFDPSO are put forward, which ensures the IFDPSO possibly search as much as possible sub-optimal positions and its neighborhood and the algorithm ability of searching global optimal value in solving large scale 0-1 knapsack problem is intensified. Third, focusing on the problem of WTA, some parameters including dynamic parameter for shifting firepower and constraints are designed to solve the problems of weapon target assignment. In addition, WTA Optimization Model with time and resource constraints is finally set up, which also intensifies the algorithm ability of searching global and local best value in the solution of WTA problem. Finally, the superiority of IFDPSO is proved by several simulation experiments. Particularly, IFDPSO, IFDPSO1~IFDPSO3 are respectively effective in solving large scale, medium scale or strict constraint problems such as 0-1 knapsack problem and WTA problem.展开更多
The current mathematical models for the storage assignment problem are generally established based on the traveling salesman problem（TSP）,which has been widely applied in the conventional automated storage and retri...The current mathematical models for the storage assignment problem are generally established based on the traveling salesman problem（TSP）,which has been widely applied in the conventional automated storage and retrieval system（AS/RS）.However,the previous mathematical models in conventional AS/RS do not match multi-tier shuttle warehousing systems（MSWS） because the characteristics of parallel retrieval in multiple tiers and progressive vertical movement destroy the foundation of TSP.In this study,a two-stage open queuing network model in which shuttles and a lift are regarded as servers at different stages is proposed to analyze system performance in the terms of shuttle waiting period（SWP） and lift idle period（LIP） during transaction cycle time.A mean arrival time difference matrix for pairwise stock keeping units（SKUs） is presented to determine the mean waiting time and queue length to optimize the storage assignment problem on the basis of SKU correlation.The decomposition method is applied to analyze the interactions among outbound task time,SWP,and LIP.The ant colony clustering algorithm is designed to determine storage partitions using clustering items.In addition,goods are assigned for storage according to the rearranging permutation and the combination of storage partitions in a 2D plane.This combination is derived based on the analysis results of the queuing network model and on three basic principles.The storage assignment method and its entire optimization algorithm method as applied in a MSWS are verified through a practical engineering project conducted in the tobacco industry.The applying results show that the total SWP and LIP can be reduced effectively to improve the utilization rates of all devices and to increase the throughput of the distribution center.展开更多
A novel Wireless Fidelity (WiFi) over fiber link and a wavelength assignment protocol are proposed to provide sufficient bandwidth and extensive coverage range for the various applications in the Internet of Things (I...A novel Wireless Fidelity (WiFi) over fiber link and a wavelength assignment protocol are proposed to provide sufficient bandwidth and extensive coverage range for the various applications in the Internet of Things (IoT).The performance of the WiFi over fiber-based wireless IoT network is evaluated in terms of error vector magnitude (EVM) and data throughput for both the up and down links between the WiFi central control system and remote radio units (RRUs).The experimental results illustrate the reliability of the fiber transmission of 64 Quadrature Amplitude Modulation (64QAM) WiFi signals by direct analog modulation.In order to efficiently utilize the wavelength resources,we also demonstrated the wavelength assignment protocol by employing optical switching configurations in Central Station (CS) to realize the wavelength switching,and the simulation results indicate the queuing size and the corresponding queue delay for different numbers of available wavelengths.展开更多
In order to solve the problem of efficiently assigning tasks in an ad-hoc mobile cloud( AMC),a task assignment algorithm based on the heuristic algorithm is proposed. The proposed task assignment algorithm based on pa...In order to solve the problem of efficiently assigning tasks in an ad-hoc mobile cloud( AMC),a task assignment algorithm based on the heuristic algorithm is proposed. The proposed task assignment algorithm based on particle swarm optimization and simulated annealing( PSO-SA) transforms the dependencies between tasks into a directed acyclic graph( DAG) model. The number in each node represents the computation workload of each task and the number on each edge represents the workload produced by the transmission. In order to simulate the environment of task assignment in AMC,mathematical models are developed to describe the dependencies between tasks and the costs of each task are defined. PSO-SA is used to make the decision for task assignment and for minimizing the cost of all devices,which includes the energy consumption and time delay of all devices.PSO-SA also takes the advantage of both particle swarm optimization and simulated annealing by selecting an optimal solution with a certain probability to avoid falling into local optimal solution and to guarantee the convergence speed. The simulation results show that compared with other existing algorithms,the PSO-SA has a smaller cost and the result of PSO-SA can be very close to the optimal solution.展开更多
This paper introduces an ant colony routing and wavelength assignment algorithm based on cross-layer design(CL-ACRWA),which can overcome the adverse effects of Doppler wavelength shift on data transmission in optical ...This paper introduces an ant colony routing and wavelength assignment algorithm based on cross-layer design(CL-ACRWA),which can overcome the adverse effects of Doppler wavelength shift on data transmission in optical satellite networks. Firstly, a cross-layer optimization model is built, which considers the Doppler wavelength shift, the transmission delay as well as wavelength-continuity constraint. Then an ant colony algorithm is utilized to solve the cross-layer optimization model, resulting in finding an optimal light path satisfying the above constraints for every connection request. The performance of CL-ACRWA is measured by the communication success probability, the convergence property and the transmission delay. Simulation results show that CL-ACRWA performs well in communication success probability and has good global search ability as well as fast convergence speed. Meanwhile, the transmission delay can meet the basic requirement of real-time transmission of business.展开更多
The task assignment problem of robots in a smart warehouse environment （TARSWE） based on cargo-to-person is investigated. Firstly, the sites of warehouse robots and the order picking tasks are given and the task ass...The task assignment problem of robots in a smart warehouse environment （TARSWE） based on cargo-to-person is investigated. Firstly, the sites of warehouse robots and the order picking tasks are given and the task assignment problem for picking one order is formulated into a mathematical model to minimize the total operation cost. Then a heuristic algorithm is designed to solve the task assignment problem for picking multiple orders. Finally, simulations are done by using the orders data of online bookstore A. The results show that using the heuristic algorithm of this paper to assign robots, the cost was reduced by 2% and it can effectively avoid far route and unbalanced workload of robots. The feasibility and validity of the model and algorithm are verified. The model and algorithm in this paper provide a theoretical basis to solve the TARSWE.展开更多
基金supported by the National Natural Science Foundation of China under Grant No.62072475 and No.62302062in part by the Hunan Provincial Natural Science Foundation of China under Grant Number 2023JJ40081。
文摘With the unprecedented prevalence of Industrial Internet of Things(IIoT)and 5G technology,various applications supported by industrial communication systems have generated exponentially increased processing tasks,which makes task assignment inefficient due to insufficient workers.In this paper,an Intelligent and Trustworthy task assignment method based on Trust and Social relations(ITTS)is proposed for scenarios with many tasks and few workers.Specifically,ITTS first makes initial assignments based on trust and social influences,thereby transforming the complex large-scale industrial task assignment of the platform into the small-scale task assignment for each worker.Then,an intelligent Q-decision mechanism based on workers'social relation is proposed,which adopts the first-exploration-then-utilization principle to allocate tasks.Only when a worker cannot cope with the assigned tasks,it initiates dynamic worker recruitment,thus effectively solving the worker shortage problem as well as the cold start issue.More importantly,we consider trust and security issues,and evaluate the trust and social circles of workers by accumulating task feedback,to provide the platform a reference for worker recruitment,thereby creating a high-quality worker pool.Finally,extensive simulations demonstrate ITTS outperforms two benchmark methods by increasing task completion rates by 56.49%-61.53%and profit by 42.34%-47.19%.
文摘Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and mission trajectory planning method is proposed to meet the requirements of cross-domain unmanned swarm mission planning.Firstly,the different performances of cross-domain heterogeneous platforms and mission requirements of targets are characterised by using a collection of operational resources.Secondly,an algorithmic framework for joint target assignment and mission trajectory planning is proposed,in which the initial planning of the trajectory is performed in the target assignment phase,while the trajectory is further optimised afterwards.Next,the estimation of the distribution algorithms is combined with the genetic algorithm to solve the objective function.Finally,the algorithm is numerically simulated by specific cases.Simulation results indicate that the proposed algorithm can perform effective task assignment and trajectory planning for cross-domain unmanned swarms.Furthermore,the solution performance of the hybrid estimation of distribution algorithm(EDA)-genetic algorithm(GA)algorithm is better than that of GA and EDA.
文摘INTRODUCTION Reports indicating that culturally and linguistically diverse(CALD)people-often with migrant backgrounds-in Australia and New Zealand are more likely to be placed in compulsory community treatment(CCT)have rightlyraised concernsthat such action might be discriminatory.
基金supported in part by the National Natural Science Foundation of China under Grants U21B2005,62201105,62331017,U24B20134,62222103,and 62025105in part by the Chongqing Municipal Education Commission under Grants KJQN202400621,KJQN202100643,and KJZDK202400608+1 种基金in part by the China Postdoctoral Science Foundation under Grant 2021M700563in part by the Chongqing Postdoctoral Funding Project under Grant 2021XM3052。
文摘Multi-band optical networks are a potential technology for increasing network capacity.However,the strong interference and non-uniformity between wavelengths in multi-band optical networks have become a bottleneck restricting the transmission capacity of multi-band optical networks.To overcome these challenges,it is particularly important to implement optical power optimization targeting wavelength differences.Therefore,based on the generalized Gaussian noise model,we first formulate an optimization model for the problems of routing,modulation format,wavelength,and power allocation in C+L+S multi-band optical networks.Our objective function is to maximize the average link capacity of the network while ensuring that the Optical Signal-to-Noise(OSNR)threshold of the service request is not exceeded.Next,we propose a NonLinear Interferenceaware(NLI-aware)routing,modulation format,wavelength,and power allocation algorithm.Finally,we conduct simulations under different test conditions.The simulation results indicate that our algorithm can effectively reduce the blocking probability by 23.5%and improve the average link capacity by 3.78%in C+L+S multi-band optical networks.
基金supported by the National Natural Science Foundation of China(No.92371206)the Postgraduate Scientific Research Innovation Project of Hunan Province,China(No.CX2023063).
文摘Satellite Component Layout Optimization(SCLO) is crucial in satellite system design.This paper proposes a novel Satellite Three-Dimensional Component Assignment and Layout Optimization(3D-SCALO) problem tailored to engineering requirements, aiming to optimize satellite heat dissipation while considering constraints on static stability, 3D geometric relationships between components, and special component positions. The 3D-SCALO problem is a challenging bilevel combinatorial optimization task, involving the optimization of discrete component assignment variables in the outer layer and continuous component position variables in the inner layer,with both influencing each other. To address this issue, first, a Mixed Integer Programming(MIP) model is proposed, which reformulates the original bilevel problem into a single-level optimization problem, enabling the exploration of a more comprehensive optimization space while avoiding iterative nested optimization. Then, to model the 3D geometric relationships between components within the MIP framework, a linearized 3D Phi-function method is proposed, which handles non-overlapping and safety distance constraints between cuboid components in an explicit and effective way. Subsequently, the Finite-Rectangle Method(FRM) is proposed to manage 3D geometric constraints for complex-shaped components by approximating them with a finite set of cuboids, extending the applicability of the geometric modeling approach. Finally, the feasibility and effectiveness of the proposed MIP model are demonstrated through two numerical examples"and a real-world engineering case, which confirms its suitability for complex-shaped components and real engineering applications.
基金the financial support provided by the National Natural Science Foundation of China(NSFC)(Grant No.62173274)the National Key R&D Program of China(Grant No.2019YFA0405300)+4 种基金the Natural Science Foundation of Hunan Province of China(Grant No.2021JJ10045)the Practice and Innovation Funds for Graduate Students of Northwestern Polytechnical University(Grant No.PF2023046)the Open Research Subject of State Key Laboratory of Intelligent Game(Grant No.ZBKF-24-01)the Postdoctoral Fellowship Program of CPSF(No.GZB20240989)the China Postdoctoral Science Foundation(Grant No.2024M754304)。
文摘The multi-target assignment(MTA)problem,a crucial challenge in command control,mission planning,and a fundamental research focus in military operations,has garnered significant attention over the years.Extensively studied across various domains such as land,sea,air,space,and electronics,the MTA problem has led to the emergence of numerous models and algorithms.To delve deeper into this field,this paper starts by conducting a bibliometric analysis on 463 Scopus database papers using CiteSpace software.The analysis includes examining keyword clustering,co-occurrence,and burst,with visual representations of the results.Following this,the paper provides an overview of current classification and modeling techniques for addressing the MTA problem,distinguishing between static multi-target assignment(SMTA)and dynamic multi-target assignment(DMTA).Subsequently,existing solution algorithms for the MTA problem are reviewed,generally falling into three categories:exact algorithms,heuristic algorithms,and machine learning algorithms.Finally,a development framework is proposed based on the"HIGH"model(high-speed,integrated,great,harmonious)to guide future research and intelligent weapon system development concerning the MTA problem.This framework emphasizes application scenarios,modeling mechanisms,solution algorithms,and system efficiency to offer a roadmap for future exploration in this area.
基金The National Natural Science Foundation of China(No.52302388)the Natural Science Foundation of Jiangsu Province(No.BK20230853).
文摘To adapt to the unique demand-supply features of accessory parking lots at passenger transport hubs,a mixed parking demand assignment method based on regression modeling is proposed.First,an optimal model aiming to minimize total time expenditure is constructed.It incorporates parking search time,walking time,and departure time,focusing on short-term parking features.Then,the information dimensions that the parking lot can obtain are evaluated,and three assignment strategies based on three types of regression models-linear regression(LR),extreme gradient boosting(XGBoost),and multilayer perceptron(MLP)-are proposed.A parking process simulation model is built using the traffic simulation package SUMO to facilitate data collection,model training,and case studies.Finally,the performance of the three strategies is com-pared,revealing that the XGBoost-based strategy performs the best in case parking lots,which reduces time expendi-ture by 29.3%and 37.2%,respectively,compared with the MLP-based strategy and LR-based strategy.This method offers diverse options for practical parking manage-ment.
基金supported by the National Natural Science Foundation of China (No. 62073267)。
文摘As a crucial process in the coordinated strikes of unmanned aerial vehicles(UAVs), weapon-target assignment is vital for optimizing the allocation of available weapons and effectively exploiting the capabilities of UAVs. Existing weapon-target assignment methods primarily focus on macro cluster constraints while neglecting individual strategy updates. This paper proposes a novel weapon-target assignment method for UAVs based on the multi-strategy threshold public goods game(PGG). By analyzing the concept mapping between weapon-target assignment for UAVs and multi-strategy threshold PGG, a weapon-target assignment model for UAVs based on the multi-strategy threshold PGG is established, which is adaptively complemented by the diverse cooperation-defection strategy library and the utility function based on the threshold mechanism. Additionally, a multi-chain Markov is formulated to quantitatively describe the stochastic evolutionary dynamics, whose evolutionary stable distribution is theoretically derived through the development of a strategy update rule based on preference-based aspiration dynamic. Numerical simulation results validate the feasibility and effectiveness of the proposed method, and the impacts of selection intensity, preference degree and threshold on the evolutionary stable distribution are analyzed. Comparative simulations show that the proposed method outperforms GWO, DE, and NSGA-II, achieving 17.18% higher expected utility than NSGA-II and reducing evolutionary stable times by 25% in large-scale scenario.
基金supported in part by an International Research Partnership“Electrical Engineering-Thai French Research Center(EE-TFRC)”under the project framework of the Lorraine Universite´d’Excellence(LUE)in cooperation between Universite´de Lorraine(France)and King Mongkut’s University of Technology North Bangkok(year 2021-2024/2025-28)by the National Research Council of Thailand(NRCT)under Research Team Promotion Grant(Senior Research Scholar Program)under Grant No.N42A 680561by the NSRF via the Program Management Unit for Human Resources&Institutional Development,Research and Innovation under Research project Grant No.B41G680025.
文摘Permanent Magnet Synchronous Motors(PMSMs)are widely employed in high-performance drive applications due to their superior efficiency and dynamic capabilities.However,their control remains challenging owing to nonlinear dynamics,parameter variations,and unmeasurable external disturbances,particularly load torquefluctuations.This study proposes an enhanced Interconnection and Damp-ing Assignment Passivity-Based Control(IDA-PBC)scheme,formulated within the port-controlled Hamiltonian(PCH)framework,to address these limitations.A nonlinear disturbance observer is embedded to estimate and compensate,in real time,for lumped mis-matched disturbances arising from parameter uncertainties and external loads.Additionally,aflatness-based control strategy is employed to generate the desired current references within the nonlinear drive system,ensuring accurate tracking of time-varying speed commands.This integrated approach preserves the system’s energy-based structure,enabling systematic stability analysis while enhancing robustness.The proposed control architecture also maintains low complexity with a limited number of tunable parameters,facilitating practical implementation.Simulation and experimental results under various operating conditions demonstrate the effectiveness and robustness of the proposed method.Comparative analysis with conventional proportional-integral(PI)control and standard IDA-PBC strategies confirms its capability to handle disturbances and maintain dynamic performance.
基金The National Basic Research Program of China(973Program)(No.2009CB320501)the Natural Science Foundation of Jiangsu Province(No.BK2010414)+1 种基金China Postdoctoral Science Foundation(No.20100480071)Specialized Research Fund for the Doctoral Program of Higher Education(No.20090092120029)
文摘A channel assignment algorithm with awareness of link traffic is proposed in multi-radio multi-channel wireless mesh networks. First, the physical interference model based on the signal-to-interference-plus-noise ratio and successful transmission condition is described. The model is more suitable for a wireless communication environment than other existing models. Secondly, a pure integer quadratic programming （PIQP） model is used to solve the channel assignment problem and improve the capacity of wireless mesh networks. Consequently, a traffic- aware static channel assignment algorithm（TASC） is designed. The algorithm adopts some network parameters, including the network connectivity, the limitation of the number of radios and the successful transmission conditions in wireless communications. The TASC algorithm can diminish network interference and increase the efficiency of channel assignment while keeping the connectivity of the network. Finally, the feasibility and effectivity of the channel assignment solution are illustrated by the simulation results. Compared witb similar algorithms, the proposed algorithm can increase the capacity of WMNs.
基金supported by The National Natural Science Foundation of China under Grant Nos.61402517, 61573375The Foundation of State Key Laboratory of Astronautic Dynamics of China under Grant No. 2016ADL-DW0302+2 种基金The Postdoctoral Science Foundation of China under Grant Nos. 2013M542331, 2015M572778The Natural Science Foundation of Shaanxi Province of China under Grant No. 2013JQ8035The Aviation Science Foundation of China under Grant No. 20151996015
文摘Aiming at the problems of convergence-slow and convergence-free of Discrete Particle Swarm Optimization Algorithm(DPSO) in solving large scale or complicated discrete problem, this article proposes Intuitionistic Fuzzy Entropy of Discrete Particle Swarm Optimization(IFDPSO) and makes it applied to Dynamic Weapon Target Assignment(WTA). First, the strategy of choosing intuitionistic fuzzy parameters of particle swarm is defined, making intuitionistic fuzzy entropy as a basic parameter for measure and velocity mutation. Second, through analyzing the defects of DPSO, an adjusting parameter for balancing two cognition, velocity mutation mechanism and position mutation strategy are designed, and then two sets of improved and derivative algorithms for IFDPSO are put forward, which ensures the IFDPSO possibly search as much as possible sub-optimal positions and its neighborhood and the algorithm ability of searching global optimal value in solving large scale 0-1 knapsack problem is intensified. Third, focusing on the problem of WTA, some parameters including dynamic parameter for shifting firepower and constraints are designed to solve the problems of weapon target assignment. In addition, WTA Optimization Model with time and resource constraints is finally set up, which also intensifies the algorithm ability of searching global and local best value in the solution of WTA problem. Finally, the superiority of IFDPSO is proved by several simulation experiments. Particularly, IFDPSO, IFDPSO1~IFDPSO3 are respectively effective in solving large scale, medium scale or strict constraint problems such as 0-1 knapsack problem and WTA problem.
基金Supported by National Natural Science Foundation of China(Grant No.661403234)Shandong Provincial Science and Techhnology Development Plan of China(Grant No.2014GGX106009)
文摘The current mathematical models for the storage assignment problem are generally established based on the traveling salesman problem（TSP）,which has been widely applied in the conventional automated storage and retrieval system（AS/RS）.However,the previous mathematical models in conventional AS/RS do not match multi-tier shuttle warehousing systems（MSWS） because the characteristics of parallel retrieval in multiple tiers and progressive vertical movement destroy the foundation of TSP.In this study,a two-stage open queuing network model in which shuttles and a lift are regarded as servers at different stages is proposed to analyze system performance in the terms of shuttle waiting period（SWP） and lift idle period（LIP） during transaction cycle time.A mean arrival time difference matrix for pairwise stock keeping units（SKUs） is presented to determine the mean waiting time and queue length to optimize the storage assignment problem on the basis of SKU correlation.The decomposition method is applied to analyze the interactions among outbound task time,SWP,and LIP.The ant colony clustering algorithm is designed to determine storage partitions using clustering items.In addition,goods are assigned for storage according to the rearranging permutation and the combination of storage partitions in a 2D plane.This combination is derived based on the analysis results of the queuing network model and on three basic principles.The storage assignment method and its entire optimization algorithm method as applied in a MSWS are verified through a practical engineering project conducted in the tobacco industry.The applying results show that the total SWP and LIP can be reduced effectively to improve the utilization rates of all devices and to increase the throughput of the distribution center.
基金supported by the National Natural Science Foundation of China (Nos.60702006,60736002,60837004,60736036,60932004and61001121)the MOST International Cooperation Program(No.2008DFA11670)+1 种基金the 111 Project(No.B07005)the project funded by State Key Laboratory of AOCSN,China
文摘A novel Wireless Fidelity (WiFi) over fiber link and a wavelength assignment protocol are proposed to provide sufficient bandwidth and extensive coverage range for the various applications in the Internet of Things (IoT).The performance of the WiFi over fiber-based wireless IoT network is evaluated in terms of error vector magnitude (EVM) and data throughput for both the up and down links between the WiFi central control system and remote radio units (RRUs).The experimental results illustrate the reliability of the fiber transmission of 64 Quadrature Amplitude Modulation (64QAM) WiFi signals by direct analog modulation.In order to efficiently utilize the wavelength resources,we also demonstrated the wavelength assignment protocol by employing optical switching configurations in Central Station (CS) to realize the wavelength switching,and the simulation results indicate the queuing size and the corresponding queue delay for different numbers of available wavelengths.
基金The National Natural Science Foundation of China(No.61741102,61471164,61601122)the Fundamental Research Funds for the Central Universities(No.SJLX_160040)
文摘In order to solve the problem of efficiently assigning tasks in an ad-hoc mobile cloud( AMC),a task assignment algorithm based on the heuristic algorithm is proposed. The proposed task assignment algorithm based on particle swarm optimization and simulated annealing( PSO-SA) transforms the dependencies between tasks into a directed acyclic graph( DAG) model. The number in each node represents the computation workload of each task and the number on each edge represents the workload produced by the transmission. In order to simulate the environment of task assignment in AMC,mathematical models are developed to describe the dependencies between tasks and the costs of each task are defined. PSO-SA is used to make the decision for task assignment and for minimizing the cost of all devices,which includes the energy consumption and time delay of all devices.PSO-SA also takes the advantage of both particle swarm optimization and simulated annealing by selecting an optimal solution with a certain probability to avoid falling into local optimal solution and to guarantee the convergence speed. The simulation results show that compared with other existing algorithms,the PSO-SA has a smaller cost and the result of PSO-SA can be very close to the optimal solution.
基金supported by the National Natural Science Foundation of China(No.61675033,61575026,61675233)National High Technical Research and Development Program of China(No.2015AA015504)
文摘This paper introduces an ant colony routing and wavelength assignment algorithm based on cross-layer design(CL-ACRWA),which can overcome the adverse effects of Doppler wavelength shift on data transmission in optical satellite networks. Firstly, a cross-layer optimization model is built, which considers the Doppler wavelength shift, the transmission delay as well as wavelength-continuity constraint. Then an ant colony algorithm is utilized to solve the cross-layer optimization model, resulting in finding an optimal light path satisfying the above constraints for every connection request. The performance of CL-ACRWA is measured by the communication success probability, the convergence property and the transmission delay. Simulation results show that CL-ACRWA performs well in communication success probability and has good global search ability as well as fast convergence speed. Meanwhile, the transmission delay can meet the basic requirement of real-time transmission of business.
基金Project Supported： National Natural Science Foundation of China （11131009, 71540028, F012408）, Funding Project for Academic Human Resources Development in Institutions of Higher Learning Under the Jurisdiction of Beijing Municipality （CIT＆TCD20130327）, and major research project of Beijing Wuzi University.
文摘The task assignment problem of robots in a smart warehouse environment （TARSWE） based on cargo-to-person is investigated. Firstly, the sites of warehouse robots and the order picking tasks are given and the task assignment problem for picking one order is formulated into a mathematical model to minimize the total operation cost. Then a heuristic algorithm is designed to solve the task assignment problem for picking multiple orders. Finally, simulations are done by using the orders data of online bookstore A. The results show that using the heuristic algorithm of this paper to assign robots, the cost was reduced by 2% and it can effectively avoid far route and unbalanced workload of robots. The feasibility and validity of the model and algorithm are verified. The model and algorithm in this paper provide a theoretical basis to solve the TARSWE.
