Sequential quadratic programming-based non-cooperative target distributed hybrid processing optimization method

The distributed hybrid processing optimization problem of non-cooperative targets is an important research direction for future networked air-defense and anti-missile firepower systems. In this paper, the air-defense anti-missile targets defense problem is abstracted as a nonconvex constrained combinatorial optimization problem with the optimization objective of maximizing the degree of contribution of the processing scheme to non-cooperative targets, and the constraints mainly consider geographical conditions and anti-missile equipment resources. The grid discretization concept is used to partition the defense area into network nodes, and the overall defense strategy scheme is described as a nonlinear programming problem to solve the minimum defense cost within the maximum defense capability of the defense system network. In the solution of the minimum defense cost problem, the processing scheme, equipment coverage capability, constraints and node cost requirements are characterized, then a nonlinear mathematical model of the non-cooperative target distributed hybrid processing optimization problem is established, and a local optimal solution based on the sequential quadratic programming algorithm is constructed, and the optimal firepower processing scheme is given by using the sequential quadratic programming method containing non-convex quadratic equations and inequality constraints. Finally, the effectiveness of the proposed method is verified by simulation examples.

Non-Cooperative Game of Coordinated Scheduling of Parallel Machine Production and Transportation in Shared Manufacturing

Given the challenges of manufacturing resource sharing and competition in the modern manufacturing industry,the coordinated scheduling problem of parallel machine production and transportation is investigated.The problem takes into account the coordination of production and transportation before production as well as the disparities in machine spatial position and performance.A non-cooperative game model is established,considering the competition and self-interest behavior of jobs from different customers for machine resources.The job from different customers is mapped to the players in the game model,the corresponding optional processing machine and location are mapped to the strategy set,and the makespan of the job is mapped to the payoff.Then the solution of the scheduling model is transformed into the Nash equilibrium of the non-cooperative game model.A Nash equilibrium solution algorithm based on the genetic algorithm(NEGA)is designed,and the effective solution of approximate Nash equilibrium for the game model is realized.The fitness function,single-point crossover operator,and mutation operator are derived from the non-cooperative game model’s characteristics and the definition of Nash equilibrium.Rules are also designed to avoid the generation of invalid offspring chromosomes.The effectiveness of the proposed algorithm is demonstrated through numerical experiments of various sizes.Compared with other algorithms such as heuristic algorithms(FCFS,SPT,and LPT),the simulated annealing algorithm(SA),and the particle swarm optimization algorithm(PSO),experimental results show that the proposed NE-GA algorithm has obvious performance advantages.

Peer-to-Peer Energy Trading Method of Multi-Virtual Power Plants Based on Non-Cooperative Game

The current electricity market fails to consider the energy consumption characteristics of transaction subjects such as virtual power plants.Besides,the game relationship between transaction subjects needs to be further explored.This paper proposes a Peer-to-Peer energy trading method for multi-virtual power plants based on a non-cooperative game.Firstly,a coordinated control model of public buildings is incorporated into the scheduling framework of the virtual power plant,considering the energy consumption characteristics of users.Secondly,the utility functions of multiple virtual power plants are analyzed,and a non-cooperative game model is established to explore the game relationship between electricity sellers in the Peer-to-Peer transaction process.Finally,the influence of user energy consumption characteristics on the virtual power plant operation and the Peer-to-Peer transaction process is analyzed by case studies.Furthermore,the effect of different parameters on the Nash equilibrium point is explored,and the influence factors of Peer-to-Peer transactions between virtual power plants are summarized.According to the obtained results,compared with the central air conditioning set as constant temperature control strategy,the flexible control strategy proposed in this paper improves the market power of each VPP and the overall revenue of the VPPs.In addition,the upper limit of the service quotation of the market operator have a great impact on the transaction mode of VPPs.When the service quotation decreases gradually,the P2P transaction between VPPs is more likely to occur.

Coordinated Scheduling of Two-Agent Production and Transportation Based on Non-Cooperative Game

A two-agent production and transportation coordinated scheduling problem in a single-machine environment is suggested to compete for one machine from different downstream production links or various consumers.The jobs of two agents compete for the processing position on a machine,and after the pro-cessed,they compete for the transport position on a transport vehicle to be trans-ported to two agents.The two agents have different objective functions.The objective function of the first agent is the sum of the makespan and the total trans-portation time,whereas the objective function of the second agent is the sum of the total completion time and the total transportation time.Given the competition between two agents for machine resources and transportation resources,a non-cooperative game model with agents as game players is established.The job pro-cessing position and transportation position corresponding to the two agents are mapped as strategies,and the corresponding objective function is the utility func-tion.To solve the game model,an approximate Nash equilibrium solution algo-rithm based on an improved genetic algorithm(NE-IGA)is proposed.The genetic operation based on processing sequence and transportation sequence,as well as the fitness function based on Nash equilibrium definition,are designed based on the features of the two-agent production and transportation coordination scheduling problem.The effectiveness of the proposed algorithm is demonstrated through numerical experiments of various sizes.When compared to heuristic rules such as the Longest Processing Time first(LPT)and the Shortest Processing Time first(SPT),the objective function values of the two agents are reduced by 4.3%and 2.6% on average.

Resource Allocation for Network Security Risk Assessment：A Non-Cooperative Differential Game Based Approach

In this paper, we propose a non-cooperative differential game theory based resource allocation approach for the network security risk assessment. For the risk assessment, the resource will be used for risk assess, including response cost and response negative cost. The whole assessment process is considered as a differential game for optimal resource control. The proposed scheme can be obtained through the Nash Equilibrium. It is proved that the game theory based algorithm is applicable and the optimal resource level can be achieved based on the proposed algorithm.

QoS awared power and admission controls based on non-cooperative game theory in wireless networks

In order to better accommodate heterogeneous quality of service (QoS) in wireless networks, an algorithm called QoS-aware power and admission controls (QAPAC) is proposed. The system is modeled as a non-cooperative game where the users adjust their transmit powers to maximize the utility, thus restraining the interferences. By using adaptive utility functions and tunable pricing parameters according to QoS levels, this algorithm can well meet different QoS requirements and improve system capacity compared with those that ignore the QoS differences.

An Optimized Resource Scheduling Strategy for Hadoop Speculative Execution Based on Non-cooperative Game Schemes

Hadoop is a well-known parallel computing system for distributed computing and large-scale data processes.“Straggling”tasks,however,have a serious impact on task allocation and scheduling in a Hadoop system.Speculative Execution(SE)is an efficient method of processing“Straggling”Tasks by monitoring real-time running status of tasks and then selectively backing up“Stragglers”in another node to increase the chance to complete the entire mission early.Present speculative execution strategies meet challenges on misjudgement of“Straggling”tasks and improper selection of backup nodes,which leads to inefficient implementation of speculative executive processes.This paper has proposed an Optimized Resource Scheduling strategy for Speculative Execution(ORSE)by introducing non-cooperative game schemes.The ORSE transforms the resource scheduling of backup tasks into a multi-party non-cooperative game problem,where the tasks are regarded as game participants,whilst total task execution time of the entire cluster as the utility function.In that case,the most benefit strategy can be implemented in each computing node when the game reaches a Nash equilibrium point,i.e.,the final resource scheduling scheme to be obtained.The strategy has been implemented in Hadoop-2.x.Experimental results depict that the ORSE can maintain the efficiency of speculative executive processes and improve fault-tolerant and computation performance under the circumstances of Normal Load,Busy Load and Busy Load with Skewed Data.

Excess Benefit Allocation in Shared Savings Based on Non-cooperative Game Theory

Energy saving income distribution mode is of great significance to the energy industry.With the continuous application of new technologies,the problem of excess energy saving income distribution has become one of the obstacles to the appreciation of energy performance.At present,the distribution of risk and income is mainly based on the contribution of risk and income,which has some limitations.The benefit distribution of energy saving negotiation between energy saving service companies and clients can be regarded as a bargaining process where an effective range satisfying both parties can be obtained.This provides a new perspective in solving the problem of excess energy saving income distribution in energy management contract projects.

MADRL-based UAV swarm non-cooperative game under incomplete information

Unmanned Aerial Vehicles(UAVs)play increasing important role in modern battlefield.In this paper,considering the incomplete observation information of individual UAV in complex combat environment,we put forward an UAV swarm non-cooperative game model based on Multi-Agent Deep Reinforcement Learning(MADRL),where the state space and action space are constructed to adapt the real features of UAV swarm air-to-air combat.The multi-agent particle environment is employed to generate an UAV combat scene with continuous observation space.Some recently popular MADRL methods are compared extensively in the UAV swarm noncooperative game model,the results indicate that the performance of Multi-Agent Soft Actor-Critic(MASAC)is better than that of other MADRL methods by a large margin.UAV swarm employing MASAC can learn more effective policies,and obtain much higher hit rate and win rate.Simulations under different swarm sizes and UAV physical parameters are also performed,which implies that MASAC owns a well generalization effect.Furthermore,the practicability and convergence of MASAC are addressed by investigating the loss value of Q-value networks with respect to individual UAV,the results demonstrate that MASAC is of good practicability and the Nash equilibrium of the UAV swarm non-cooperative game under incomplete information can be reached.

A DNN based trajectory optimization method for intercepting non-cooperative maneuvering spacecraft

Current successes in artificial intelligence domain have revitalized interest in neural networks and demonstrated their potential in solving spacecraft trajectory optimization problems. This paper presents a data-free deep neural network(DNN) based trajectory optimization method for intercepting noncooperative maneuvering spacecraft, in a continuous low-thrust scenario. Firstly, the problem is formulated as a standard constrained optimization problem through differential game theory and minimax principle. Secondly, a new DNN is designed to integrate interception dynamic model into the network and involve it in the process of gradient descent, which makes the network endowed with the knowledge of physical constraints and reduces the learning burden of the network. Thus, a DNN based method is proposed, which completely eliminates the demand of training datasets and improves the generalization capacity. Finally, numerical results demonstrate the feasibility and efficiency of our proposed method.

考虑鲜度竞争的农产品双渠道供应链货源配置研究

为了探索生产商利润最大化目标下有限货源在线上线下渠道的数量配置方法,针对农产品双渠道供应链的鲜度竞争冲突,构建了双渠道货源配置函数,研究了有限供给下农产品生产商双渠道货源配置策略。结果表明:生产商将货源全部配置到线上渠道的主观意愿具有刚性,当生产商自己决定线上渠道鲜度时,线上线下渠道的初始配置量平均分配;当冷链物流服务商决定线上渠道鲜度时,线上渠道的初始配置为货源的3/4;在批发价高于一定阈值的条件下,生产商自己决定线上渠道鲜度,且把更多货源投向线下渠道,生产商的利润和系统利润均更高。

Analytic optimal pose tracking control in close-range proximity operations with a non-cooperative target

This paper investigates an analytical optimal pose tracking control problem for chaser spacecraft during the close-range proximity operations with a non-cooperative space target subject to attitude tumbling and unknown orbital maneuvering.Firstly,the relative translational motion between the orbital target and the chaser spacecraft is described in the Line-of-Sight(LOS)coordinate frame along with attitude quaternion dynamics.Then,based on the coupled 6-Degree of Freedom(DOF)pose dynamic model,an analytical optimal control action consisting of constrained optimal control value,application time and its duration are proposed via exploring the iterative sequential action control algorithm.Meanwhile,the global closed-loop asymptotic stability of the proposed predictive control action is presented and discussed.Compared with traditional proximity control schemes,the highlighting advantages are that the application time and duration of the devised controller is applied discretely in light of the influence of the instantaneous pose configuration on the pose tracking performance with less energy consumptions rather than at each sample time.Finally,three groups of illustrative examples are organized to validate the effectiveness of the proposed analytical optimal pose tracking control scheme.

考虑鲜度竞争的生鲜农产品双渠道供应链保鲜方式选择的研究

物流保鲜是影响农产品质量的重要因素之一。考虑消费者的鲜度敏感性和渠道偏好,构建了自营保鲜和保鲜外包两种情形下,生产商、零售商和冷链物流服务商的序贯博弈模型,求解出最优定价和鲜度水平。借助数值试验,分析了保鲜成本和保鲜服务价格对生产商和零售商的保鲜方式选择及渠道鲜度差异的影响。结果表明:无论生产商还是零售商,选择保鲜外包的农产品鲜度与保鲜成本呈负相关、与保鲜价格呈正相关。零售商总是选择自己保鲜,但是保鲜水平(或保鲜价格)高于(或低于)一定阈值后,生产商会选择保鲜外包,此时线下渠道与线上渠道的鲜度趋近。若保鲜水平较低,冷链物流服务商倾向于承接零售商保鲜外包,反之承接生产商保鲜外包,但是承接生产商保鲜外包的供应链系统利润更大。

基于三角模糊数序贯博弈的电网安全研究

智能电网系统面临着复杂性、多样性的网络安全风险。针对电网工艺漏洞攻防双方在博弈分析中无法对信息属性损失作出准确判断的问题,提出了一种三角模糊数序贯博弈模型。以序贯博弈树方法进行智能电网攻防博弈,构建出攻击者和防御者的最优策略,实现对智能电网的工控安全防护。通过对智能电网攻击者和防御者构建序贯博弈模型,得到攻防博弈效用。提出运用三角模糊数和概率分布向量的方法来构建非模糊化损失,得到攻防双方清晰化的系统损失值。对三角模糊数序贯博弈算法和贝叶斯序贯算法进行比较,得到智能电网均衡路径中的攻击者和防御者的最优策略,以保障智能电网网络安全运行和防护。该研究为智能电网以及典型工控系统网络安全博弈提供参考。

基于互惠动机的众创空间价值共创行为决策机制研究

以核心企业主导型众创空间为研究对象,以DK序贯互惠博弈模型为基础,同时考虑入驻企业的物质效用和互惠心理效用,构建了基于入驻企业互惠的核心企业主导型众创空间中入驻企业与运营方价值共创行为决策的两人两阶段序贯互惠博弈模型。文末以海创汇平台为例,通过数值分析了入驻企业与海创汇平台之间的互惠博弈,对所得结论做了验证。研究结果表明:当入驻企业不具有互惠动机或互惠动机很小时,双方在价值共创过程中易陷入相互投机的“囚徒困境”;在考虑入驻企业的互惠动机时,运营方的投机行为更易遭到入驻企业“以牙还牙”行为的报复;运营方选择合作行为时,具有较强互惠动机的入驻企业也会回报以合作行为,从而打破双方价值共创行为决策的“囚徒困境”,实现帕累托均衡。研究丰富了众创空间价值共创行为决策的相关研究,能够为众创空间相关主体的行为决策提供理论依据。

Differential Game Based Link Resource Management for Next Generation Optical Network

In this paper, we investigate the link resource management problem for optical networks, to achieve the resource cost during the information transmission. We use the differential game to formulate the cost control problem for the link resource management, to minimize the resource allocation cost functions, which dynamic behaviours are described by differential equations. Each link controls its transmission bandwidth based on the Nash equilibriums of the differential game. The effectiveness of the proposed model is given through numerical simulations.

On Dynamics and Nash Equilibriums of Networked Games

Networked noncooperative games are investigated,where each player(or agent) plays with all other players in its neighborhood. Assume the evolution is based on the fact that each player uses its neighbors current information to decide its next strategy. By using sub-neighborhood, the dynamics of the evolution is obtained. Then a method for calculating Nash equilibriums from mixed strategies of multi-players is proposed.The relationship between local Nash equilibriums based on individual neighborhoods and global Nash equilibriums of overall network is revealed. Then a technique is proposed to construct Nash equilibriums of an evolutionary game from its one step static Nash equilibriums. The basic tool of this approach is the semi-tensor product of matrices, which converts strategies into logical matrices and payoffs into pseudo-Boolean functions, then networked evolutionary games become discrete time dynamic systems.

No-cooperative games for multiple emergency locations in resource scheduling

When an emergency happens, the scheduling of relief resources to multiple emergency locations is a realistic and intricate problem, especially when the available resources are limited. A non-cooperative games model and an algorithm for scheduling of relief resources are presented. In the model, the players correspond to the multiple emergency locations, strategies correspond to all resources scheduling and the payoff of each emergency location corresponds to the reciprocal of its scheduling cost. Thus, the optimal results are determined by the Nash equilibrium point of this game. Then the iterative algorithm is introduced to seek the Nash equilibrium point. Simulation and analysis are given to demonstrate the feasibility and availability of the model.

Modeling and game strategy analysis of suppressing IADS for multiple fighters' cooperation

This paper addresses the problem of suppression of the integrated air defense system(IADS) by multiple fighters’ cooperation. Considering the dynamic changing of the number of the nodes in the operational process, a profit model for the influence of the mission’s cost for the whole system is developed for both offense and defensive sides. The scenario analysis is given for the process of suppressing the IADS by multiple fighters. Based on this scenario analysis, the modeling method and the specific expression for the payoff function are proposed in four cases for each node. Moreover, a distributed virtual learning algorithm is designed for the n-person and n-strategy game, and the mixed strategy Nash equilibrium(MSNE) of this game can be solved from the n × m × 3-dimensional profit space. Finally, the simulation examples are provided to demonstrate the effectiveness of the proposed model and the game algorithm.

A Tree Formulation for Signaling Games with Noise

The paper provides an analysis of a sender-receiver sequential signaling game. The private information of the sender is transmitted with noise by a Machine, i.e. does not always correctly reflect the state of nature. Hence, a truthful revelation by the sender of his information does not necessarily imply that the signal he sends is correct. Also, the receiver can take a correct action even if the sender transmits an incorrect signal. The payoffs of the two players depend on their combined actions. Perfect Bayesian Equilibria which can result from different degrees of noise is analysed. The Bayesian updating of probabilities is explained. The fixed point theorem which makes the connection with the idea of rational expectations in economics is calculated. Given a number of equilibria, we comment on the most credible one on the basis of the implied payoffs for both players. The equilibrium signals are an example of the formation of a language convention discussed by D. Lewis.