To address the confrontation decision-making issues in multi-round air combat,a dynamic game decision method is proposed based on decision tree for the confrontation of unmanned aerial vehicle(UAV)air combat.Based on ...To address the confrontation decision-making issues in multi-round air combat,a dynamic game decision method is proposed based on decision tree for the confrontation of unmanned aerial vehicle(UAV)air combat.Based on game the-ory and the confrontation characteristics of air combat,a dynamic game process is constructed including the strategy sets,the situation information,and the maneuver decisions for both sides of air combat.By analyzing the UAV’s flight dyna-mics and the both sides’information,a payment matrix is estab-lished through the situation advantage function,performance advantage function,and profit function.Furthermore,the dynamic game decision problem is solved based on the linear induction method to obtain the Nash equilibrium solution,where the decision tree method is introduced to obtain the optimal maneuver decision,thereby improving the situation advantage in the next round of confrontation.According to the analysis,the simulation results for the confrontation scenarios of multi-round air combat are presented to verify the effectiveness and advan-tages of the proposed method.展开更多
This paper presents a Game-theoretic optimization via Parallel Min-Max Ant System(PMMAS)algorithm is used in practice to determine the Nash equilibrium value to resolve the confusion in choosing appropriate bidders of...This paper presents a Game-theoretic optimization via Parallel Min-Max Ant System(PMMAS)algorithm is used in practice to determine the Nash equilibrium value to resolve the confusion in choosing appropriate bidders of multi-round procurement problem in software project management.To this end,we introduce an approach that proposes:(i)A Game-theoretic model of multiround procurement problem(ii)A Nash equilibrium strategy corresponds to multi-round strategy bid(iii)An application of PSO for the determination of global Nash equilibrium.The balance point in Nash Equilibrium can help to maintain a sustainable structure not only in terms of project management but also in terms of future cooperation.As an alternative of procuring entities subjectively,a methodology to support decision making has been studied using Nash equilibrium to create a balance point on benefit in procurement where buyers and suppliers need multiple rounds of bidding.Our goal focus on the balance point in Nash Equilibrium to optimizing bidder selection in multi-round procurement which is the most beneficial for both investors and selected tenderers.Our PMMAS algorithm is implemented based on MPI(message passing interface)to find the approximate optimal solution for the question of how to choose bidders and ensure a path for a win-win relationship of all participants in the procurement process.We also evaluate the speedup ratio and parallel efficiency between our algorithm and other proposed algorithms.As the experiment results,the high feasibility and effectiveness of the PMMAS algorithm are verified.展开更多
基金supported by the Major Projects for Science and Technology Innovation 2030(2018AAA0100805).
文摘To address the confrontation decision-making issues in multi-round air combat,a dynamic game decision method is proposed based on decision tree for the confrontation of unmanned aerial vehicle(UAV)air combat.Based on game the-ory and the confrontation characteristics of air combat,a dynamic game process is constructed including the strategy sets,the situation information,and the maneuver decisions for both sides of air combat.By analyzing the UAV’s flight dyna-mics and the both sides’information,a payment matrix is estab-lished through the situation advantage function,performance advantage function,and profit function.Furthermore,the dynamic game decision problem is solved based on the linear induction method to obtain the Nash equilibrium solution,where the decision tree method is introduced to obtain the optimal maneuver decision,thereby improving the situation advantage in the next round of confrontation.According to the analysis,the simulation results for the confrontation scenarios of multi-round air combat are presented to verify the effectiveness and advan-tages of the proposed method.
基金Vietnam National Foundation for Science and TechnologyDevelopment(NAFOSTED)under grant number 102.03-2019.10.
文摘This paper presents a Game-theoretic optimization via Parallel Min-Max Ant System(PMMAS)algorithm is used in practice to determine the Nash equilibrium value to resolve the confusion in choosing appropriate bidders of multi-round procurement problem in software project management.To this end,we introduce an approach that proposes:(i)A Game-theoretic model of multiround procurement problem(ii)A Nash equilibrium strategy corresponds to multi-round strategy bid(iii)An application of PSO for the determination of global Nash equilibrium.The balance point in Nash Equilibrium can help to maintain a sustainable structure not only in terms of project management but also in terms of future cooperation.As an alternative of procuring entities subjectively,a methodology to support decision making has been studied using Nash equilibrium to create a balance point on benefit in procurement where buyers and suppliers need multiple rounds of bidding.Our goal focus on the balance point in Nash Equilibrium to optimizing bidder selection in multi-round procurement which is the most beneficial for both investors and selected tenderers.Our PMMAS algorithm is implemented based on MPI(message passing interface)to find the approximate optimal solution for the question of how to choose bidders and ensure a path for a win-win relationship of all participants in the procurement process.We also evaluate the speedup ratio and parallel efficiency between our algorithm and other proposed algorithms.As the experiment results,the high feasibility and effectiveness of the PMMAS algorithm are verified.
