Optimizing routing and resource allocation in decentralized unmanned aerial vehicle(UAV)networks remains challenging due to interference and rapidly changing topologies.The authors introduce a novel framework combinin...Optimizing routing and resource allocation in decentralized unmanned aerial vehicle(UAV)networks remains challenging due to interference and rapidly changing topologies.The authors introduce a novel framework combining double deep Q-networks(DDQNs)and graph neural networks(GNNs)for joint routing and resource allocation.The framework uses GNNs to model the network topology and DDQNs to adaptively control routing and resource allocation,addressing interference and improving network performance.Simulation results show that the proposed approach outperforms traditional methods such as Closest-to-Destination(c2Dst),Max-SINR(mSINR),and Multi-Layer Perceptron(MLP)-based models,achieving approximately 23.5% improvement in throughput,50% increase in connection probability,and 17.6% reduction in number of hops,demonstrating its effectiveness in dynamic UAV networks.展开更多
A task allocation problem for the heterogeneous unmanned aerial vehicle (UAV) swarm in unknown environments is studied in this paper.Considering that the actual mission environment information may be unknown,the UAV s...A task allocation problem for the heterogeneous unmanned aerial vehicle (UAV) swarm in unknown environments is studied in this paper.Considering that the actual mission environment information may be unknown,the UAV swarm needs to detect the environment first and then attack the detected targets.The heterogeneity of UAVs,multiple types of tasks,and the dynamic nature of task environment lead to uneven load and time sequence problems.This paper proposes an improved contract net protocol (CNP) based task allocation scheme,which effectively balances the load of UAVs and improves the task efficiency.Firstly,two types of task models are established,including regional reconnaissance tasks and target attack tasks.Secondly,for regional reconnaissance tasks,an improved CNP algorithm using the uncertain contract is developed.Through uncertain contracts,the area size of the regional reconnaissance task is determined adaptively after this task assignment,which can improve reconnaissance efficiency and resource utilization.Thirdly,for target attack tasks,an improved CNP algorithm using the fuzzy integrated evaluation and the double-layer negotiation is presented to enhance collaborative attack efficiency through adjusting the assignment sequence adaptively and multi-layer allocation.Finally,the effectiveness and advantages of the improved method are verified through comparison simulations.展开更多
Task allocation for munition swarms is constrained by reachable region limitations and real-time requirements.This paper proposes a reachable region guided distributed coalition formation game(RRGDCF)method to address...Task allocation for munition swarms is constrained by reachable region limitations and real-time requirements.This paper proposes a reachable region guided distributed coalition formation game(RRGDCF)method to address these issues.To enable efficient online task allocation,a reachable region prediction strategy based on fully connected neural networks(FCNNs)is developed.This strategy integrates high-fidelity data generated from the golden section method and low-fidelity data from geometric approximation in an optimal mixing ratio to form multi-fidelity samples,significantly enhancing prediction accuracy and efficiency under limited high-fidelity samples.These predictions are then incorporated into the coalition formation game framework.A tabu search mechanism guided by the reachable region center directs munitions to execute tasks within their respective reachable regions,mitigating redundant operations on ineffective coalition structures.Furthermore,an adaptive guidance coalition formation strategy optimizes allocation plans by leveraging the hit probabilities of munitions,replacing traditional random coalition formation methods.Simulation results demonstrate that RRGDCF surpasses the contract network protocol and traditional coalition formation game algorithms in optimality and computational efficiency.Hardware experiments further validate the method's practicality in dynamic scenarios.展开更多
The main objective of multiuser orthogonal frequency division multiple access(MU-OFDM) is to maximize the total system capacity in wireless communication systems. Thus, the problem in MU-OFDM system is the adaptive al...The main objective of multiuser orthogonal frequency division multiple access(MU-OFDM) is to maximize the total system capacity in wireless communication systems. Thus, the problem in MU-OFDM system is the adaptive allocation of the resources(subcarriers, bits and power) to different users subject to several restrictions to maximize the total system capacity. In this work, a proposed subcarrier allocation algorithm was presented to assign the subcarriers with highest channel gain to the users. After the subcarrier allocation, subcarrier gain-based power allocation(SGPA) was employed for power and bit loading. The simulation results show that the proposed subcarrier-power allocation scheme can achieve high total system capacity and good fairness in allocating the resources to the users with slightly high computational complexity compared to the existing subcarrier allocation algorithms.展开更多
Cloud computing represents a novel computing model in the contemporary technology world. In a cloud system, the com- puting power of virtual machines （VMs） and network status can greatly affect the completion time o...Cloud computing represents a novel computing model in the contemporary technology world. In a cloud system, the com- puting power of virtual machines （VMs） and network status can greatly affect the completion time of data intensive tasks. How- ever, most of the current resource allocation policies focus only on network conditions and physical hosts. And the computing power of VMs is largely ignored. This paper proposes a comprehensive resource allocation policy which consists of a data intensive task scheduling algorithm that takes account of computing power of VMs and a VM allocation policy that considers bandwidth between storage nodes and hosts. The VM allocation policy includes VM placement and VM migration algorithms. Related simulations show that the proposed algorithms can greatly reduce the task comple- tion time and keep good load balance of physical hosts at the same time.展开更多
This paper generalizes the classic resource allocation problem to the resource planning and allocation problem, in which the resource itself is a decision variable and the cost of each activity is uncertain when the r...This paper generalizes the classic resource allocation problem to the resource planning and allocation problem, in which the resource itself is a decision variable and the cost of each activity is uncertain when the resource is determined. The authors formulate this problem as a two-stage stochastic programming. The authors first propose an efficient algorithm for the case with finite states. Then, a sudgradient method is proposed for the general case and it is shown that the simple algorithm for the unique state case can be used to compute the subgradient of the objective function. Numerical experiments are conducted to show the effectiveness of the model.展开更多
The joint resource block(RB)allocation and power optimization problem is studied to maximize the sum-rate of the vehicle-to-vehicle(V2V)links in the device-to-device(D2D)-enabled V2V communication system,where one fea...The joint resource block(RB)allocation and power optimization problem is studied to maximize the sum-rate of the vehicle-to-vehicle(V2V)links in the device-to-device(D2D)-enabled V2V communication system,where one feasible cellular user(FCU)can share its RB with multiple V2V pairs.The problem is first formulated as a nonconvex mixed-integer nonlinear programming(MINLP)problem with constraint of the maximum interference power in the FCU links.Using the game theory,two coalition formation algorithms are proposed to accomplish V2V link partitioning and FCU selection,where the transferable utility functions are introduced to minimize the interference among the V2V links and the FCU links for the optimal RB allocation.The successive convex approximation(SCA)is used to transform the original problem into a convex one and the Lagrangian dual method is further applied to obtain the optimal transmit power of the V2V links.Finally,numerical results demonstrate the efficiency of the proposed resource allocation algorithm in terms of the system sum-rate.展开更多
The application of multiple UAVs in complicated tasks has been widely explored in recent years.Due to the advantages of flexibility,cheapness and consistence,the performance of heterogeneous multi-UAVs with proper coo...The application of multiple UAVs in complicated tasks has been widely explored in recent years.Due to the advantages of flexibility,cheapness and consistence,the performance of heterogeneous multi-UAVs with proper cooperative task allocation is superior to over the single UAV.Accordingly,several constraints should be satisfied to realize the efficient cooperation,such as special time-window,variant equipment,specified execution sequence.Hence,a proper task allocation in UAVs is the crucial point for the final success.The task allocation problem of the heterogeneous UAVs can be formulated as a multi-objective optimization problem coupled with the UAV dynamics.To this end,a multi-layer encoding strategy and a constraint scheduling method are designed to handle the critical logical and physical constraints.In addition,four optimization objectives:completion time,target reward,UAV damage,and total range,are introduced to evaluate various allocation plans.Subsequently,to efficiently solve the multi-objective optimization problem,an improved multi-objective quantum-behaved particle swarm optimization(IMOQPSO)algorithm is proposed.During this algorithm,a modified solution evaluation method is designed to guide algorithmic evolution;both the convergence and distribution of particles are considered comprehensively;and boundary solutions which may produce some special allocation plans are preserved.Moreover,adaptive parameter control and mixed update mechanism are also introduced in this algorithm.Finally,both the proposed model and algorithm are verified by simulation experiments.展开更多
Recently the integrated modular avionics （IMA） architecture which introduces the concept of resource partitioning becomes popular as an alternative to the traditional federated architecture. A novel hierarchical app...Recently the integrated modular avionics （IMA） architecture which introduces the concept of resource partitioning becomes popular as an alternative to the traditional federated architecture. A novel hierarchical approach is proposed to solve the resource allocation problem for IMA systems in distributed environments. Firstly, the worst case response time of tasks with arbitrary deadlines is analyzed for the two-level scheduler. Then, the hierarchical resource allocation approach is presented in two levels. At the platform level, a task assignment algorithm based on genetic simulated annealing （GSA） is proposed to assign a set of pre-defined tasks to different processing nodes in the form of task groups, so that resources can be allocated as partitions and mapped to task groups. While yielding to all the resource con- straints, the algorithm tries to find an optimal task assignment with minimized communication costs and balanced work load. At the node level, partition parameters are optimized, so that the computational resource can be allocated further. An example is shown to illustrate the hierarchal resource allocation approach and manifest the validity. Simulation results comparing the performance of the proposed GSA with that of traditional genetic algorithms are presented in the context of task assignment in IMA systems.展开更多
For better reflecting the interactive defense between targets in practical combat scenarios,the basic weapon-target allocation(WTA)framework needs to be improved.A multi-stage attack WTA method is proposed.First,a def...For better reflecting the interactive defense between targets in practical combat scenarios,the basic weapon-target allocation(WTA)framework needs to be improved.A multi-stage attack WTA method is proposed.First,a defense area analysis is presented according to the targets’positions and the radii of the defense areas to analyze the interactive coverage and protection between targets’defense areas.Second,with the coverage status and coverage layer number,a multi-stage attack planning method is proposed and the multi-stage attack objective function model is established.Simulation is conducted with interactive defense combat scenarios,the traditional WTA method and the multi-stage WTA method are compared,and the objective function model is validated with the Monte-Carlo method.The results suggest that if the combat scenario involves interactive coverage of targets’defense areas,it is imperative to analyze the defense areas and apply the multi-stage attack method to weakening the target defense progressively for better combat effectiveness.展开更多
Resource allocation for an equipment development task is a complex process owing to the inherent characteristics,such as large amounts of input resources,numerous sub-tasks,complex network structures,and high degrees ...Resource allocation for an equipment development task is a complex process owing to the inherent characteristics,such as large amounts of input resources,numerous sub-tasks,complex network structures,and high degrees of uncertainty.This paper presents an investigation into the influence of resource allocation on the duration and cost of sub-tasks.Mathematical models are constructed for the relationships of the resource allocation quantity with the duration and cost of the sub-tasks.By considering the uncertainties,such as fluctuations in the sub-task duration and cost,rework iterations,and random overlaps,the tasks are simulated for various resource allocation schemes.The shortest duration and the minimum cost of the development task are first formulated as the objective function.Based on a multi-objective particle swarm optimization(MOPSO)algorithm,a multi-objective evolutionary algorithm is constructed to optimize the resource allocation scheme for the development task.Finally,an uninhabited aerial vehicle(UAV)is considered as an example of a development task to test the algorithm,and the optimization results of this method are compared with those based on non-dominated sorting genetic algorithm-II(NSGA-II),non-dominated sorting differential evolution(NSDE)and strength pareto evolutionary algorithm-II(SPEA-II).The proposed method is verified for its scientific approach and effectiveness.The case study shows that the optimization of the resource allocation can greatly aid in shortening the duration of the development task and reducing its cost effectively.展开更多
In order to solve reliability-redundancy allocation problems more effectively, a new hybrid algorithm named CDEPSO is proposed in this work, which combines particle swarm optimization （PSO） with differential evoluti...In order to solve reliability-redundancy allocation problems more effectively, a new hybrid algorithm named CDEPSO is proposed in this work, which combines particle swarm optimization （PSO） with differential evolution （DE） and a new chaotic local search. In the CDEPSO algorithm, DE provides its best solution to PSO if the best solution obtained by DE is better than that by PSO, while the best solution in the PSO is performed by chaotic local search. To investigate the performance of CDEPSO, four typical reliability-redundancy allocation problems were solved and the results indicate that the convergence speed and robustness of CDEPSO is better than those of PSO and CPSO （a hybrid algorithm which only combines PSO with chaotic local search）. And, compared with the other six improved meta-heuristics, CDEPSO also exhibits more robust performance. In addition, a new performance was proposed to more fairly compare CDEPSO with the same six improved recta-heuristics, and CDEPSO algorithm is the best in solving these problems.展开更多
Because co-occurring native and invasive plants are subjected to similar environmental selection pressures,the differences in functional traits and reproductive allocation strategies between native and invasive plants...Because co-occurring native and invasive plants are subjected to similar environmental selection pressures,the differences in functional traits and reproductive allocation strategies between native and invasive plants may be closely related to the success of the latter.Accordingly,this study examines differences in functional traits and reproductive allocation strategies between native and invasive plants in Eastern China.Plant height,branch number,reproductive branch number,the belowground-to-aboveground biomass ratio,and the reproductive allocation coefficient of invasive plants were all notably higher than those of native species.Additionally,the specific leaf area(SLA)values of invasive plants were remarkably lower than those of native species.Plasticity indexes of SLA,maximum branch angle,and branch number of invasive plants were each notably lower than those of native species.The reproductive allocation coefficient was positively correlated with reproductive branch number and the belowground-to-aboveground biomass ratio but exhibited negative correlations with SLA and aboveground biomass.Plant height,branch number,reproductive branch number,the belowground-to-aboveground biomass ratio,and the reproductive allocation coefficient of invasive plants may strongly influence the success of their invasions.展开更多
It is difficult for the double suppression division algorithm of bee colony to solve the spatio-temporal coupling or have higher dimensional attributes and undertake sudden tasks.Using the idea of clustering,after clu...It is difficult for the double suppression division algorithm of bee colony to solve the spatio-temporal coupling or have higher dimensional attributes and undertake sudden tasks.Using the idea of clustering,after clustering tasks according to spatio-temporal attributes,the clustered groups are linked into task sub-chains according to similarity.Then,based on the correlation between clusters,the child chains are connected to form a task chain.Therefore,the limitation is solved that the task chain in the bee colony algorithm can only be connected according to one dimension.When a sudden task occurs,a method of inserting a small number of tasks into the original task chain and a task chain reconstruction method are designed according to the relative relationship between the number of sudden tasks and the number of remaining tasks.Through the above improvements,the algorithm can be used to process tasks with spatio-temporal coupling and burst tasks.In order to reflect the efficiency and applicability of the algorithm,a task allocation model for the unmanned aerial vehicle(UAV)group is constructed,and a one-to-one correspondence between the improved bee colony double suppression division algorithm and each attribute in the UAV group is proposed.Task assignment has been constructed.The study uses the self-adjusting characteristics of the bee colony to achieve task allocation.Simulation verification and algorithm comparison show that the algorithm has stronger planning advantages and algorithm performance.展开更多
Bicycle-sharing system is considered as a green option to provide a better connection between scenic spots and nearby metro/bus stations. Allocating and optimizing the layout of bicycle-sharing system inside the sceni...Bicycle-sharing system is considered as a green option to provide a better connection between scenic spots and nearby metro/bus stations. Allocating and optimizing the layout of bicycle-sharing system inside the scenic spot and around its influencing area are focused on. It is found that the terrain, land use, nearby transport network and scenery point distribution have significant impact on the allocation of bicycle-sharing system. While the candidate bicycle-sharing stations installed at the inner scenic points, entrances/exits and metro stations are fixed, the ones installed at bus-stations and other passenger concentration buildings are adjustable. Aiming at minimizing the total cycling distance and overlapping rate, an optimization model is proposed and solved based on the idea of cluster concept and greedy heuristic. A revealed preference/stated preference （RP/SP） combined survey was conducted at Xuanwu Lake in Nanjing, China, to get an insight into the touring trip characteristics and bicycle-sharing tendency. The results reveal that 39.81% visitors accept a cycling distance of 1-3 km and 62.50% respondents think that the bicycle-sharing system should charge an appropriate fee. The sttrvey indicates that there is high possibility to carry out a bicycle-sharing system at Xuanwu Lake. Optimizing the allocation problem cluster by cluster rather than using an exhaustive search method significantly reduces the computing amount from O（2^43） to O（43 2）. The 500 m-radius-coverage rate for the alternative optimized by 500 m-radius-cluster and 800 m-radius-cluster is 89.2% and 68.5%, respectively. The final layout scheme will provide decision makers engineering guidelines and theoretical support.展开更多
The jamming resource allocation problem of the aircraft formation cooperatively jamming netted radar system is investigated.An adaptive allocation strategy based on dynamic adaptive discrete cuckoo search algorithm(DA...The jamming resource allocation problem of the aircraft formation cooperatively jamming netted radar system is investigated.An adaptive allocation strategy based on dynamic adaptive discrete cuckoo search algorithm(DADCS)is proposed,whose core is to adjust allocation scheme of limited jamming resource of aircraft formation in real time to maintain the best jamming effectiveness against netted radar system.Firstly,considering the information fusion rules and different working modes of the netted radar system,a two-factor jamming effectiveness evaluation function is constructed,detection probability and aiming probability are adopted to characterize jamming effectiveness against netted radar system in searching and tracking mode,respectively.Then a nonconvex optimization model for cooperatively jamming netted radar system is established.Finally,a dynamic adaptive discrete cuckoo search algorithm(DADCS)is constructed by improving path update strategies and introducing a global learning mechanism,and a three-step solution method is proposed subsequently.Simulation results are provided to demonstrate the advantages of the proposed optimization strategy and the effectiveness of the improved algorithm.展开更多
A non-cooperative game is proposed to perform the sub-carrier assignment and power allocation for the multi-cell orthogonal frequency division multiple access（OFDMA） system.The objective is to raise the spectral eff...A non-cooperative game is proposed to perform the sub-carrier assignment and power allocation for the multi-cell orthogonal frequency division multiple access（OFDMA） system.The objective is to raise the spectral efficiency of the system and prolong the life time of user nodes.This paper defines a game player as a cell formed by the unique base station and the served users.The utility function considered here measures the user＇s achieved utility per power.Each individual cell＇s goal is to maximize the total utility of its users.To search the Nash equilibrium（NE） of the game,an iterative and distributed algorithm is presented.Since the NE is inefficient,the pricing of user＇s transmission power is introduced to improve the NE in the Pareto sense.Simulation results show the proposed game outperforms the water-filling algorithm in terms of fairness and energy efficiency.Moreover,through employing a liner pricing function,the energy efficiency could be further improved.展开更多
The netted radar system(NRS)has been proved to possess unique advantages in anti-jamming and improving target tracking performance.Effective resource management can greatly ensure the combat capability of the NRS.In t...The netted radar system(NRS)has been proved to possess unique advantages in anti-jamming and improving target tracking performance.Effective resource management can greatly ensure the combat capability of the NRS.In this paper,based on the netted collocated multiple input multiple output(CMIMO)radar,an effective joint target assignment and power allocation(JTAPA)strategy for tracking multi-targets under self-defense blanket jamming is proposed.An architecture based on the distributed fusion is used in the radar network to estimate target state parameters.By deriving the predicted conditional Cramer-Rao lower bound(PC-CRLB)based on the obtained state estimation information,the objective function is formulated.To maximize the worst case tracking accuracy,the proposed JTAPA strategy implements an online target assignment and power allocation of all active nodes,subject to some resource constraints.Since the formulated JTAPA is non-convex,we propose an efficient two-step solution strategy.In terms of the simulation results,the proposed algorithm can effectively improve tracking performance in the worst case.展开更多
In order to solve discrete multi-objective optimization problems, a non-dominated sorting quantum particle swarm optimization (NSQPSO) based on non-dominated sorting and quantum particle swarm optimization is proposed...In order to solve discrete multi-objective optimization problems, a non-dominated sorting quantum particle swarm optimization (NSQPSO) based on non-dominated sorting and quantum particle swarm optimization is proposed, and the performance of the NSQPSO is evaluated through five classical benchmark functions. The quantum particle swarm optimization (QPSO) applies the quantum computing theory to particle swarm optimization, and thus has the advantages of both quantum computing theory and particle swarm optimization, so it has a faster convergence rate and a more accurate convergence value. Therefore, QPSO is used as the evolutionary method of the proposed NSQPSO. Also NSQPSO is used to solve cognitive radio spectrum allocation problem. The methods to complete spectrum allocation in previous literature only consider one objective, i.e. network utilization or fairness, but the proposed NSQPSO method, can consider both network utilization and fairness simultaneously through obtaining Pareto front solutions. Cognitive radio systems can select one solution from the Pareto front solutions according to the weight of network reward and fairness. If one weight is unit and the other is zero, then it becomes single objective optimization, so the proposed NSQPSO method has a much wider application range. The experimental research results show that the NSQPS can obtain the same non-dominated solutions as exhaustive search but takes much less time in small dimensions; while in large dimensions, where the problem cannot be solved by exhaustive search, the NSQPSO can still solve the problem, which proves the effectiveness of NSQPSO.展开更多
Aiming at tracking control of a class of innovative control effector(ICE) aircraft with distributed arrays of actuators, this paper proposes a control allocation scheme based on the Lévy flight.Different from the...Aiming at tracking control of a class of innovative control effector(ICE) aircraft with distributed arrays of actuators, this paper proposes a control allocation scheme based on the Lévy flight.Different from the conventional aircraft control allocation problem,the particular characteristic of actuators makes the actuator control command totally subject to integer constraints. In order to tackle this problem, first, the control allocation problem is described as an integer programming problem with two desired objectives. Then considering the requirement of real-time, a metaheuristic algorithm based on the Lévy flight is introduced to tackling this problem. In order to improve the searching efficiency, several targeted and heuristic strategies including variable step length and inherited population initialization according to feedback and so on are designed. Moreover, to prevent the incertitude of the metaheuristic algorithm and ensure the flight stability, a guaranteed control strategy is designed. Finally, a time-varying simulation model is introduced to verifying the effectiveness of the proposed scheme. The contrastive simulation results indicate that the proposed scheme achieves superior tracking performance with appropriate actuator dynamics and computational time, and the improvements for efficiency are active and the parameter settings are reasonable.展开更多
文摘Optimizing routing and resource allocation in decentralized unmanned aerial vehicle(UAV)networks remains challenging due to interference and rapidly changing topologies.The authors introduce a novel framework combining double deep Q-networks(DDQNs)and graph neural networks(GNNs)for joint routing and resource allocation.The framework uses GNNs to model the network topology and DDQNs to adaptively control routing and resource allocation,addressing interference and improving network performance.Simulation results show that the proposed approach outperforms traditional methods such as Closest-to-Destination(c2Dst),Max-SINR(mSINR),and Multi-Layer Perceptron(MLP)-based models,achieving approximately 23.5% improvement in throughput,50% increase in connection probability,and 17.6% reduction in number of hops,demonstrating its effectiveness in dynamic UAV networks.
基金National Natural Science Foundation of China (12202293)Sichuan Science and Technology Program (2023NSFSC0393,2022NSFSC1952)。
文摘A task allocation problem for the heterogeneous unmanned aerial vehicle (UAV) swarm in unknown environments is studied in this paper.Considering that the actual mission environment information may be unknown,the UAV swarm needs to detect the environment first and then attack the detected targets.The heterogeneity of UAVs,multiple types of tasks,and the dynamic nature of task environment lead to uneven load and time sequence problems.This paper proposes an improved contract net protocol (CNP) based task allocation scheme,which effectively balances the load of UAVs and improves the task efficiency.Firstly,two types of task models are established,including regional reconnaissance tasks and target attack tasks.Secondly,for regional reconnaissance tasks,an improved CNP algorithm using the uncertain contract is developed.Through uncertain contracts,the area size of the regional reconnaissance task is determined adaptively after this task assignment,which can improve reconnaissance efficiency and resource utilization.Thirdly,for target attack tasks,an improved CNP algorithm using the fuzzy integrated evaluation and the double-layer negotiation is presented to enhance collaborative attack efficiency through adjusting the assignment sequence adaptively and multi-layer allocation.Finally,the effectiveness and advantages of the improved method are verified through comparison simulations.
基金supported by the National Natural Science Foundation of China(Grant 52372347,52425211,52272360)。
文摘Task allocation for munition swarms is constrained by reachable region limitations and real-time requirements.This paper proposes a reachable region guided distributed coalition formation game(RRGDCF)method to address these issues.To enable efficient online task allocation,a reachable region prediction strategy based on fully connected neural networks(FCNNs)is developed.This strategy integrates high-fidelity data generated from the golden section method and low-fidelity data from geometric approximation in an optimal mixing ratio to form multi-fidelity samples,significantly enhancing prediction accuracy and efficiency under limited high-fidelity samples.These predictions are then incorporated into the coalition formation game framework.A tabu search mechanism guided by the reachable region center directs munitions to execute tasks within their respective reachable regions,mitigating redundant operations on ineffective coalition structures.Furthermore,an adaptive guidance coalition formation strategy optimizes allocation plans by leveraging the hit probabilities of munitions,replacing traditional random coalition formation methods.Simulation results demonstrate that RRGDCF surpasses the contract network protocol and traditional coalition formation game algorithms in optimality and computational efficiency.Hardware experiments further validate the method's practicality in dynamic scenarios.
文摘The main objective of multiuser orthogonal frequency division multiple access(MU-OFDM) is to maximize the total system capacity in wireless communication systems. Thus, the problem in MU-OFDM system is the adaptive allocation of the resources(subcarriers, bits and power) to different users subject to several restrictions to maximize the total system capacity. In this work, a proposed subcarrier allocation algorithm was presented to assign the subcarriers with highest channel gain to the users. After the subcarrier allocation, subcarrier gain-based power allocation(SGPA) was employed for power and bit loading. The simulation results show that the proposed subcarrier-power allocation scheme can achieve high total system capacity and good fairness in allocating the resources to the users with slightly high computational complexity compared to the existing subcarrier allocation algorithms.
基金supported by the National Natural Science Foundation of China(6120235461272422)the Scientific and Technological Support Project(Industry)of Jiangsu Province(BE2011189)
文摘Cloud computing represents a novel computing model in the contemporary technology world. In a cloud system, the com- puting power of virtual machines （VMs） and network status can greatly affect the completion time of data intensive tasks. How- ever, most of the current resource allocation policies focus only on network conditions and physical hosts. And the computing power of VMs is largely ignored. This paper proposes a comprehensive resource allocation policy which consists of a data intensive task scheduling algorithm that takes account of computing power of VMs and a VM allocation policy that considers bandwidth between storage nodes and hosts. The VM allocation policy includes VM placement and VM migration algorithms. Related simulations show that the proposed algorithms can greatly reduce the task comple- tion time and keep good load balance of physical hosts at the same time.
基金supported by in part by the National Natural Science Foundation of China under Grant Nos.71390334 and 71132008the MOE Project of Key Research Institute of Humanities and Social Sciences at Universities under Grant No.11JJD630004Program for New Century Excellent Talents in University under Grant No.NCET-13-0660
文摘This paper generalizes the classic resource allocation problem to the resource planning and allocation problem, in which the resource itself is a decision variable and the cost of each activity is uncertain when the resource is determined. The authors formulate this problem as a two-stage stochastic programming. The authors first propose an efficient algorithm for the case with finite states. Then, a sudgradient method is proposed for the general case and it is shown that the simple algorithm for the unique state case can be used to compute the subgradient of the objective function. Numerical experiments are conducted to show the effectiveness of the model.
基金the National Natural Scientific Foundation of China(61771291,61571272)the Major Science and Technological Innovation Project of Shandong Province(2020CXGC010109).
文摘The joint resource block(RB)allocation and power optimization problem is studied to maximize the sum-rate of the vehicle-to-vehicle(V2V)links in the device-to-device(D2D)-enabled V2V communication system,where one feasible cellular user(FCU)can share its RB with multiple V2V pairs.The problem is first formulated as a nonconvex mixed-integer nonlinear programming(MINLP)problem with constraint of the maximum interference power in the FCU links.Using the game theory,two coalition formation algorithms are proposed to accomplish V2V link partitioning and FCU selection,where the transferable utility functions are introduced to minimize the interference among the V2V links and the FCU links for the optimal RB allocation.The successive convex approximation(SCA)is used to transform the original problem into a convex one and the Lagrangian dual method is further applied to obtain the optimal transmit power of the V2V links.Finally,numerical results demonstrate the efficiency of the proposed resource allocation algorithm in terms of the system sum-rate.
基金Project(61801495)supported by the National Natural Science Foundation of China
文摘The application of multiple UAVs in complicated tasks has been widely explored in recent years.Due to the advantages of flexibility,cheapness and consistence,the performance of heterogeneous multi-UAVs with proper cooperative task allocation is superior to over the single UAV.Accordingly,several constraints should be satisfied to realize the efficient cooperation,such as special time-window,variant equipment,specified execution sequence.Hence,a proper task allocation in UAVs is the crucial point for the final success.The task allocation problem of the heterogeneous UAVs can be formulated as a multi-objective optimization problem coupled with the UAV dynamics.To this end,a multi-layer encoding strategy and a constraint scheduling method are designed to handle the critical logical and physical constraints.In addition,four optimization objectives:completion time,target reward,UAV damage,and total range,are introduced to evaluate various allocation plans.Subsequently,to efficiently solve the multi-objective optimization problem,an improved multi-objective quantum-behaved particle swarm optimization(IMOQPSO)algorithm is proposed.During this algorithm,a modified solution evaluation method is designed to guide algorithmic evolution;both the convergence and distribution of particles are considered comprehensively;and boundary solutions which may produce some special allocation plans are preserved.Moreover,adaptive parameter control and mixed update mechanism are also introduced in this algorithm.Finally,both the proposed model and algorithm are verified by simulation experiments.
基金supported by the National Natural Science Foundation of China (60879024)
文摘Recently the integrated modular avionics （IMA） architecture which introduces the concept of resource partitioning becomes popular as an alternative to the traditional federated architecture. A novel hierarchical approach is proposed to solve the resource allocation problem for IMA systems in distributed environments. Firstly, the worst case response time of tasks with arbitrary deadlines is analyzed for the two-level scheduler. Then, the hierarchical resource allocation approach is presented in two levels. At the platform level, a task assignment algorithm based on genetic simulated annealing （GSA） is proposed to assign a set of pre-defined tasks to different processing nodes in the form of task groups, so that resources can be allocated as partitions and mapped to task groups. While yielding to all the resource con- straints, the algorithm tries to find an optimal task assignment with minimized communication costs and balanced work load. At the node level, partition parameters are optimized, so that the computational resource can be allocated further. An example is shown to illustrate the hierarchal resource allocation approach and manifest the validity. Simulation results comparing the performance of the proposed GSA with that of traditional genetic algorithms are presented in the context of task assignment in IMA systems.
基金the National Natural Science Foundation of China(41871376,41971416,41631072).
文摘For better reflecting the interactive defense between targets in practical combat scenarios,the basic weapon-target allocation(WTA)framework needs to be improved.A multi-stage attack WTA method is proposed.First,a defense area analysis is presented according to the targets’positions and the radii of the defense areas to analyze the interactive coverage and protection between targets’defense areas.Second,with the coverage status and coverage layer number,a multi-stage attack planning method is proposed and the multi-stage attack objective function model is established.Simulation is conducted with interactive defense combat scenarios,the traditional WTA method and the multi-stage WTA method are compared,and the objective function model is validated with the Monte-Carlo method.The results suggest that if the combat scenario involves interactive coverage of targets’defense areas,it is imperative to analyze the defense areas and apply the multi-stage attack method to weakening the target defense progressively for better combat effectiveness.
基金supported by the National Natural Science Foundation of China(71690233)
文摘Resource allocation for an equipment development task is a complex process owing to the inherent characteristics,such as large amounts of input resources,numerous sub-tasks,complex network structures,and high degrees of uncertainty.This paper presents an investigation into the influence of resource allocation on the duration and cost of sub-tasks.Mathematical models are constructed for the relationships of the resource allocation quantity with the duration and cost of the sub-tasks.By considering the uncertainties,such as fluctuations in the sub-task duration and cost,rework iterations,and random overlaps,the tasks are simulated for various resource allocation schemes.The shortest duration and the minimum cost of the development task are first formulated as the objective function.Based on a multi-objective particle swarm optimization(MOPSO)algorithm,a multi-objective evolutionary algorithm is constructed to optimize the resource allocation scheme for the development task.Finally,an uninhabited aerial vehicle(UAV)is considered as an example of a development task to test the algorithm,and the optimization results of this method are compared with those based on non-dominated sorting genetic algorithm-II(NSGA-II),non-dominated sorting differential evolution(NSDE)and strength pareto evolutionary algorithm-II(SPEA-II).The proposed method is verified for its scientific approach and effectiveness.The case study shows that the optimization of the resource allocation can greatly aid in shortening the duration of the development task and reducing its cost effectively.
基金Project(20040533035)supported by the National Research Foundation for the Doctoral Program of Higher Education of ChinaProject(60874070)supported by the National Natural Science Foundation of China
文摘In order to solve reliability-redundancy allocation problems more effectively, a new hybrid algorithm named CDEPSO is proposed in this work, which combines particle swarm optimization （PSO） with differential evolution （DE） and a new chaotic local search. In the CDEPSO algorithm, DE provides its best solution to PSO if the best solution obtained by DE is better than that by PSO, while the best solution in the PSO is performed by chaotic local search. To investigate the performance of CDEPSO, four typical reliability-redundancy allocation problems were solved and the results indicate that the convergence speed and robustness of CDEPSO is better than those of PSO and CPSO （a hybrid algorithm which only combines PSO with chaotic local search）. And, compared with the other six improved meta-heuristics, CDEPSO also exhibits more robust performance. In addition, a new performance was proposed to more fairly compare CDEPSO with the same six improved recta-heuristics, and CDEPSO algorithm is the best in solving these problems.
基金Project(31300343)supported by the National Natural Science Foundation of ChinaProject supported by Jiangsu Collaborative Innovation Center of Technology and Material of Water Treatment,ChinaProject(12JDG086)supported by Research Foundation for Advanced Talents of Jiangsu University,China
文摘Because co-occurring native and invasive plants are subjected to similar environmental selection pressures,the differences in functional traits and reproductive allocation strategies between native and invasive plants may be closely related to the success of the latter.Accordingly,this study examines differences in functional traits and reproductive allocation strategies between native and invasive plants in Eastern China.Plant height,branch number,reproductive branch number,the belowground-to-aboveground biomass ratio,and the reproductive allocation coefficient of invasive plants were all notably higher than those of native species.Additionally,the specific leaf area(SLA)values of invasive plants were remarkably lower than those of native species.Plasticity indexes of SLA,maximum branch angle,and branch number of invasive plants were each notably lower than those of native species.The reproductive allocation coefficient was positively correlated with reproductive branch number and the belowground-to-aboveground biomass ratio but exhibited negative correlations with SLA and aboveground biomass.Plant height,branch number,reproductive branch number,the belowground-to-aboveground biomass ratio,and the reproductive allocation coefficient of invasive plants may strongly influence the success of their invasions.
基金This work was supported by the National Natural Science and Technology Innovation 2030 Major Project of Ministry of Science and Technology of China(2018AAA0101200)the National Natural Science Foundation of China(61502522,61502534)+4 种基金the Equipment Pre-Research Field Fund(JZX7Y20190253036101)the Equipment Pre-Research Ministry of Education Joint Fund(6141A02033703)Shaanxi Provincial Natural Science Foundation(2020JQ-493)the Military Science Project of the National Social Science Fund(WJ2019-SKJJ-C-092)the Theoretical Research Foundation of Armed Police Engineering University(WJY202148).
文摘It is difficult for the double suppression division algorithm of bee colony to solve the spatio-temporal coupling or have higher dimensional attributes and undertake sudden tasks.Using the idea of clustering,after clustering tasks according to spatio-temporal attributes,the clustered groups are linked into task sub-chains according to similarity.Then,based on the correlation between clusters,the child chains are connected to form a task chain.Therefore,the limitation is solved that the task chain in the bee colony algorithm can only be connected according to one dimension.When a sudden task occurs,a method of inserting a small number of tasks into the original task chain and a task chain reconstruction method are designed according to the relative relationship between the number of sudden tasks and the number of remaining tasks.Through the above improvements,the algorithm can be used to process tasks with spatio-temporal coupling and burst tasks.In order to reflect the efficiency and applicability of the algorithm,a task allocation model for the unmanned aerial vehicle(UAV)group is constructed,and a one-to-one correspondence between the improved bee colony double suppression division algorithm and each attribute in the UAV group is proposed.Task assignment has been constructed.The study uses the self-adjusting characteristics of the bee colony to achieve task allocation.Simulation verification and algorithm comparison show that the algorithm has stronger planning advantages and algorithm performance.
基金Project(51208261)supported by the National Natural Science Foundation of ChinaProject(12YJCZH062)supported by the Ministry of Education of Humanities and Social Science of ChinaProject(30920140132033)supported by the Fundamental Research Funds for the Central Universities,China
文摘Bicycle-sharing system is considered as a green option to provide a better connection between scenic spots and nearby metro/bus stations. Allocating and optimizing the layout of bicycle-sharing system inside the scenic spot and around its influencing area are focused on. It is found that the terrain, land use, nearby transport network and scenery point distribution have significant impact on the allocation of bicycle-sharing system. While the candidate bicycle-sharing stations installed at the inner scenic points, entrances/exits and metro stations are fixed, the ones installed at bus-stations and other passenger concentration buildings are adjustable. Aiming at minimizing the total cycling distance and overlapping rate, an optimization model is proposed and solved based on the idea of cluster concept and greedy heuristic. A revealed preference/stated preference （RP/SP） combined survey was conducted at Xuanwu Lake in Nanjing, China, to get an insight into the touring trip characteristics and bicycle-sharing tendency. The results reveal that 39.81% visitors accept a cycling distance of 1-3 km and 62.50% respondents think that the bicycle-sharing system should charge an appropriate fee. The sttrvey indicates that there is high possibility to carry out a bicycle-sharing system at Xuanwu Lake. Optimizing the allocation problem cluster by cluster rather than using an exhaustive search method significantly reduces the computing amount from O（2^43） to O（43 2）. The 500 m-radius-coverage rate for the alternative optimized by 500 m-radius-cluster and 800 m-radius-cluster is 89.2% and 68.5%, respectively. The final layout scheme will provide decision makers engineering guidelines and theoretical support.
文摘The jamming resource allocation problem of the aircraft formation cooperatively jamming netted radar system is investigated.An adaptive allocation strategy based on dynamic adaptive discrete cuckoo search algorithm(DADCS)is proposed,whose core is to adjust allocation scheme of limited jamming resource of aircraft formation in real time to maintain the best jamming effectiveness against netted radar system.Firstly,considering the information fusion rules and different working modes of the netted radar system,a two-factor jamming effectiveness evaluation function is constructed,detection probability and aiming probability are adopted to characterize jamming effectiveness against netted radar system in searching and tracking mode,respectively.Then a nonconvex optimization model for cooperatively jamming netted radar system is established.Finally,a dynamic adaptive discrete cuckoo search algorithm(DADCS)is constructed by improving path update strategies and introducing a global learning mechanism,and a three-step solution method is proposed subsequently.Simulation results are provided to demonstrate the advantages of the proposed optimization strategy and the effectiveness of the improved algorithm.
基金supported by the National Natural Science Foundation of China(60972059)the Fundamental Research Funds for the Central Universities of China(2010QNA27)+2 种基金China Postdoctoral Science Foundation(20100481185)the Ph.D.Programs Foundation of Ministry of Education of China(20090095120013)the Talent Introduction Program and Young Teacher Sailing Program of China University of Mining and Technology
文摘A non-cooperative game is proposed to perform the sub-carrier assignment and power allocation for the multi-cell orthogonal frequency division multiple access（OFDMA） system.The objective is to raise the spectral efficiency of the system and prolong the life time of user nodes.This paper defines a game player as a cell formed by the unique base station and the served users.The utility function considered here measures the user＇s achieved utility per power.Each individual cell＇s goal is to maximize the total utility of its users.To search the Nash equilibrium（NE） of the game,an iterative and distributed algorithm is presented.Since the NE is inefficient,the pricing of user＇s transmission power is introduced to improve the NE in the Pareto sense.Simulation results show the proposed game outperforms the water-filling algorithm in terms of fairness and energy efficiency.Moreover,through employing a liner pricing function,the energy efficiency could be further improved.
基金National Natural Science Foundation of China(Grant No.62001506)to provide fund for conducting experiments。
文摘The netted radar system(NRS)has been proved to possess unique advantages in anti-jamming and improving target tracking performance.Effective resource management can greatly ensure the combat capability of the NRS.In this paper,based on the netted collocated multiple input multiple output(CMIMO)radar,an effective joint target assignment and power allocation(JTAPA)strategy for tracking multi-targets under self-defense blanket jamming is proposed.An architecture based on the distributed fusion is used in the radar network to estimate target state parameters.By deriving the predicted conditional Cramer-Rao lower bound(PC-CRLB)based on the obtained state estimation information,the objective function is formulated.To maximize the worst case tracking accuracy,the proposed JTAPA strategy implements an online target assignment and power allocation of all active nodes,subject to some resource constraints.Since the formulated JTAPA is non-convex,we propose an efficient two-step solution strategy.In terms of the simulation results,the proposed algorithm can effectively improve tracking performance in the worst case.
基金Foundation item： Projects（61102106, 61102105） supported by the National Natural Science Foundation of China Project（2013M530148） supported by China Postdoctoral Science Foundation Project（HEUCF120806） supported by the Fundamental Research Funds for the Central Universities of China
文摘In order to solve discrete multi-objective optimization problems, a non-dominated sorting quantum particle swarm optimization (NSQPSO) based on non-dominated sorting and quantum particle swarm optimization is proposed, and the performance of the NSQPSO is evaluated through five classical benchmark functions. The quantum particle swarm optimization (QPSO) applies the quantum computing theory to particle swarm optimization, and thus has the advantages of both quantum computing theory and particle swarm optimization, so it has a faster convergence rate and a more accurate convergence value. Therefore, QPSO is used as the evolutionary method of the proposed NSQPSO. Also NSQPSO is used to solve cognitive radio spectrum allocation problem. The methods to complete spectrum allocation in previous literature only consider one objective, i.e. network utilization or fairness, but the proposed NSQPSO method, can consider both network utilization and fairness simultaneously through obtaining Pareto front solutions. Cognitive radio systems can select one solution from the Pareto front solutions according to the weight of network reward and fairness. If one weight is unit and the other is zero, then it becomes single objective optimization, so the proposed NSQPSO method has a much wider application range. The experimental research results show that the NSQPS can obtain the same non-dominated solutions as exhaustive search but takes much less time in small dimensions; while in large dimensions, where the problem cannot be solved by exhaustive search, the NSQPSO can still solve the problem, which proves the effectiveness of NSQPSO.
基金supported by the National Natural Science Foundation of China(61803357)。
文摘Aiming at tracking control of a class of innovative control effector(ICE) aircraft with distributed arrays of actuators, this paper proposes a control allocation scheme based on the Lévy flight.Different from the conventional aircraft control allocation problem,the particular characteristic of actuators makes the actuator control command totally subject to integer constraints. In order to tackle this problem, first, the control allocation problem is described as an integer programming problem with two desired objectives. Then considering the requirement of real-time, a metaheuristic algorithm based on the Lévy flight is introduced to tackling this problem. In order to improve the searching efficiency, several targeted and heuristic strategies including variable step length and inherited population initialization according to feedback and so on are designed. Moreover, to prevent the incertitude of the metaheuristic algorithm and ensure the flight stability, a guaranteed control strategy is designed. Finally, a time-varying simulation model is introduced to verifying the effectiveness of the proposed scheme. The contrastive simulation results indicate that the proposed scheme achieves superior tracking performance with appropriate actuator dynamics and computational time, and the improvements for efficiency are active and the parameter settings are reasonable.
