Cooperative game theory-based steering law design of a CMG system

Spacecraft require a large-angle manoeuvre when performing agile manoeuvring tasks, therefore a control moment gyroscope(CMG) is employed to provide a strong moment.However, the control of the CMG system easily falls into singularity, which renders the actuator unable to output the required moment. To solve the singularity problem of CMGs, the control law design of a CMG system based on a cooperative game is proposed. First, the cooperative game model is constructed according to the quadratic programming problem, and the cooperative strategy is constructed. When the strategy falls into singularity, the weighting coefficient is introduced to carry out the strategy game to achieve the optimal strategy. In theory, it is proven that the cooperative game manipulation law of the CMG system converges, the sum of the CMG frame angular velocities is minimized, the energy consumption is small, and there is no output torque error. Then, the CMG group system is simulated.When the CMG system is near the singular point, it can quickly escape the singularity. When the CMG system falls into the singularity, it can also escape the singularity. Considering the optimization of angular momentum and energy consumption, the feasibility of the CMG system steering law based on a cooperative game is proven.

Shapley Value for Cooperative Games with Fuzzy Coalition

Fuzzy Shapley values are developed based on conventional Shapley value. This kind of fuzzy cooperative games admit the representation of rates of players＇ participation to each coalition. And they can be applicable to both supperadditive and subadditvie cooperative games while other kinds of fuzzy cooperative games can only be superadditive. An explicit form of the Shapley function on fuzzy games with λ-fuzzy measure was also proposed.

Diffusion mechanism simulation of cloud manufacturing complex network based on cooperative game theory

Cloud manufacturing is a specific implementation form of the "Internet + manufacturing" strategy. Why and how to develop cloud manufacturing platform(CMP), however, remains the key concern of both platform operators and users. A microscopic model is proposed to investigate advantages and diffusion forces of CMP through exploration of its diffusion process and mechanism. Specifically, a three-stage basic evolution process of CMP is innovatively proposed. Then, based on this basic process, a more complex CMP evolution model has been established in virtue of complex network theory, with five diffusion forces identified. Thereafter, simulations on CMP diffusion have been conducted. The results indicate that, CMP possesses better resource utilization,user satisfaction, and enterprise utility. Results of simulation on impacts of different diffusion forces show that both the time required for CMP to reach an equilibrium state and the final network size are affected simultaneously by the five diffusion forces. All these analyses indicate that CMP could create an open online cooperation environment and turns out to be an effective implementation of the "Internet + manufacturing" strategy.

Profit Allocation Scheme Among Players in Supply-Chain Based on Shapley Value of Fuzzy Bi-cooperative Games

The Shapley value of fuzzy bi-eooperative game is developed based on the conventional Shapley value of bi-cooperative game. From the viewpoint that the players can participate in the coalitions to a certain extent and there are at least two independent cooperative projects for every player to choose, Shapley value which is introduced by Grabisch is extended to the case of fuzzy bi-cooperative game by Choquet integral. Moreover, the explicit fuzzy Shapley value is given. The explicit fuzzy Shapley function can be used to allocate the profits among players in supply-chain under the competitive and uncertain environment.

A NOVEL COOPERATIVE SPECTRUM SENSING METHOD BASED ON COOPERATIVE GAME THEORY

A novel cooperative sensing method is proposed in this paper. The proposed scheme adopts sensing creditability degree to characterize the impact of the distance and the channel parameters on the sensing result,and considers that each user has different average SNR and different decision threshold,by using General Nash Bargaining Solution (GNBS) strategy in Cooperative Game Theory (CGT),the detection performance for two-user case are derived. For multi-user case,the sensing performance is obtained with Hungarian method. Compared with the traditional schemes such as Nash Bargaining Solution (NBS) and AND,the proposed scheme covers all the factors mentioned above,and enhances the sensing rationality and reliability. Simulation results show that the proposed scheme can further improve the sensing performance and creditability.

The Coalition Cooperative Game Method and Its Application in Multi-objective Optimization Design

This paper proposes a multi-objective optimization design method based on the coalition cooperative game theory where the three design goals have been seen as three game players. By calculating the affecting factors and fuzzy clustering, the design variables are divided into different strategic spaces which belong to each player, then it constructs a payoff function based on the coalition mechanism. Each game player takes its own revenue function as a target and obtains the best strategy versus other players. The best strategies of all players consist of the strategy permutation of a round game and it obtains the final game solutions through multi-round games according to the convergence criterion. A multi-objective optimization example of the luff mechanism of compensative sheave block shows the effectiveness of the coalition cooperative game method.

Equilibrium solution of two enterprises cooperative game

Based on the actual experience of cooperation in the supply chain, the Nash solution of two enterprises cooperative games is given. Not only is the solution unique, but it is also stable, and neither side has the capability to deviate the allocation of interests from the equilibrium point. If some firm tries to withdraw from cooperation or threaten to use other particular strategy, the negotiations are likely to achieve the distribution by the threat game; The calculating method of the choice of the optimal bargaining base point and the corresponding optimal pay-off vector are given.

Invasive Species Control Based on a Cooperative Game

We develop a long-term dynamic model for controlling invasive species using the theory of cooperative games. The model is applied to control of invasive buffelgrass in the Arizona desert, which directly competes with indigenous species and can increase wildfire risk. Interest groups care about damages to three threatened resources: saguaro, cactus, riparian vegetation, and buildings. The model optimally allocates labor and a budget to protect these resources by controlling the buffelgrass population over a multi-period planning horizon. The solution is based on computing the Shapley values for the interest groups. A homeowner strategy of creating defensible space around structures to protect against wildfire affords less protection to the other resources. A similar result holds for protection of saguaros, which are also spatially concentrated. Under the optimal solution, groups caring about spatially-dispersed, riparian vegetation would compensate homeowners and groups caring about saguaros for a reallocation of resources toward greater protection of dispersed vegetation. Results highlight the importance of the spatial configuration of players and the resources they wish to protect in invasive species control problems.

Target Path Tracking Method of Intelligent Vehicle Based on Competitive Cooperative Game

To improve intelligent vehicle drive performance and avoid vehicle side-slip during target path tracking,a linearized four-wheel vehicle model is adopted as a predictive control model,and an intelligent ve-hicle target path tracking method based on a competitive cooperative game is proposed.The design variables are divided into different strategic spaces owned by each player by calculating the affecting factors of the design variables with objective functions and fuzzy clustering.Based on the competitive cooperative game model,each game player takes its payoff as a mono-objective to optimize its own strategic space and obtain the best strategy to deal with others.The best strategies were combined into the game strategy set.Considering the front wheel angle and side slip angle increment constraint,tire side-slip angle,and tire side slip deflection dynamics,it took the path tracking state model was used as the objective,function and the calculation was validated by competitive cooperative game theory.The results demonstrated the effectiveness of the proposed algorithm.The experimental results show that this method can track an intelligent vehicle quickly and steadily and has good real-time per-formance.

The General Compromise Value for Cooperative Games With Transferable Utility

The authors introduce the general compromise value for cooperative games with transferable utility.With respect to a set of potential payoffs of which the maximal and minimal potential payoff vectors are regarded as the upper and lower bounds for players,the unique pre-imputation lying on the straight line segment with these two vectors as the extreme points is defined as the general compromise value.Potential-consistency and maximal proportional property are introduced to characterize the general compromise value.

Straight-Going Priority in Hierarchical Control Framework for Right-Turning Vehicle Merging Based on Cooperative Game

With the development of connected and automated vehicles(CAVs),forming strategies could extend from the typically used first-come-first-served rules.It is necessary to consider passing priorities when crossing intersections to prevent conflicts.In this study,a hierarchical strategy based on a cooperative game was developed to improve safety and efficiency during right-turning merging.A right-turn merging conflict model was established to analyze the right-turning vehicle characteristics of the traffic flow.The proposed three-layered hierarchical strategy includes a decision-making layer,a task layer,and an operation layer.A decision-making-layer cooperative game strategy was used to determine the merging priority of straight-going traffic and right-turning flows.In addition,a task-layer cooperative game strategy was designed for the merging sequence.A modified consensus algorithm was utilized to optimize the speed of vehicles in the virtual platoon of the operation layer.Traffic simulations were performed on the PYTHON-SUMO integrated platform to verify the proposed strategy.The simulation results show that,compared with other methods,the proposed hierarchical strategy has the shortest travel time and loss time and performs better than other methods when the straight-going traffic flow increases during right-turning merging at the intersection.The proposed method shows superiority under a significant traffic flow with a threshold of 900 vehicle/(h·lane).This satisfactory application of right-turning merging might be extended to ramps,lane-changing,and other scenarios in the future.

Cooperative Game Theory Based Coordinated Scheduling of Two-Machine Flow-Shop and Transportation

A cooperative game theoretical approach is taken to production and transportation coordinated scheduling problems of two-machine flow-shop(TFS-PTCS problems)with an interstage transporter.The authors assume that there is an initial scheduling order for processing jobs on the machines.The cooperative sequencing game models associated with TFS-PTCS problems are established with jobs as players and the maximal cost savings of a coalition as its value.The properties of cooperative games under two different types of admissible rearrangements are analysed.For TFS-PTCS problems with identical processing time,it is proved that,the corresponding games areσ_(0)-component additive and convex under one admissible rearrangement.The Shapley value gives a core allocation,and is provided in a computable form.Under the other admissible rearrangement,the games neither need to beσ_(0)-component additive nor convex,and an allocation rule of modified Shapley value is designed.The properties of the cooperative games are analysed by a counterexample for general problems.

A cooperative detection game:UAV swarm vs.one fast intruder

This paper studies a special defense game using unmanned aerial vehicle(UAV)swarm against a fast intruder.The fast intruder applies an offensive strategy based on the artificial potential field method and Apollonius circle to scout a certain destination.As defenders,the UAVs are arranged into three layers:the forward layer,the midfield layer and the back layer.The co-defense mechanism,including the role derivation method of UAV swarm and a guidance law based on the co-defense front point,is introduced for UAV swarm to co-detect the intruder.Besides,five formations are designed for comparative analysis when ten UAVs are applied.Through Monte Carlo experiments and ablation experiment,the effectiveness of the proposed co-defense method has been verified.

A Value for Games Defined on Graphs

Given a graph g=( V,A ) , we define a space of subgraphs M with the binary operation of union and the unique decomposition property into blocks. This space allows us to discuss a notion of minimal subgraphs (minimal coalitions) that are of interest for the game. Additionally, a partition of the game is defined in terms of the gain of each block, and subsequently, a solution to the game is defined based on distributing to each player (node and edge) present in each block a payment proportional to their contribution to the coalition.

Cooperative and Competitive Multi-Agent Systems:From Optimization to Games

Multi-agent systems can solve scientific issues related to complex systems that are difficult or impossible for a single agent to solve through mutual collaboration and cooperation optimization.In a multi-agent system,agents with a certain degree of autonomy generate complex interactions due to the correlation and coordination,which is manifested as cooperative/competitive behavior.This survey focuses on multi-agent cooperative optimization and cooperative/non-cooperative games.Starting from cooperative optimization,the studies on distributed optimization and federated optimization are summarized.The survey mainly focuses on distributed online optimization and its application in privacy protection,and overviews federated optimization from the perspective of privacy protection me-chanisms.Then,cooperative games and non-cooperative games are introduced to expand the cooperative optimization problems from two aspects of minimizing global costs and minimizing individual costs,respectively.Multi-agent cooperative and non-cooperative behaviors are modeled by games from both static and dynamic aspects,according to whether each player can make decisions based on the information of other players.Finally,future directions for cooperative optimization,cooperative/non-cooperative games,and their applications are discussed.

Simplification of Shapley value for cooperative games via minimum carrier

Shapley value is one of the most fundamental concepts in cooperative games.This paper investigates the calculation of the Shapley value for cooperative games and establishes a new formula via carrier.Firstly,a necessary and sufficient condition is presented for the verification of carrier,based on which an algorithm is worked out to find the unique minimum carrier.Secondly,by virtue of the properties of minimum carrier,it is proved that the profit allocated to dummy players(players which do not belong to the minimum carrier)is zero,and the profit allocated to players in minimum carrier is only determined by the minimum carrier.Then,a new formula of the Shapley value is presented,which greatly reduces the computational complexity of the original formula,and shows that the Shapley value only depends on the minimum carrier.Finally,based on the semi-tensor product(STP)of matrices,the obtained new formula is converted into an equivalent algebraic form,which makes the new formula convenient for calculation via MATLAB.

Bargaining Game Theoretic Power Control in Selfish Cooperative Relay Networks

Wireless cooperative communications require appropriate power allocation （PA） between the source and relay nodes. In selfish cooperative communication networks, two partner user nodes could help relaying information for each other, but each user node has the incentive to consume his power solely to decrease its own symbol error rate （SER） at the receiver. In this paper, we propose a fair and efficient PA scheme for the decode-and-forward cooperation protocol in selfish cooperative relay networks. We formulate this PA problem as a two-user cooperative bargaining game, and use Nash bargaining solution （NBS） to achieve a win-win strategy for both partner users. Simulation results indicate that the NBS is fair in that the degree of cooperation of a user only depends on how much contribution its partner can make to decrease its SER at the receiver, and efficient in the sense that the SER performance of both users could be improved through the game.

Shapley value cooperative game theory-based locational marginal price computation for loss and emission reduction

An iterative method based on Shapley Value Cooperative Game Theory is proposed for the calculation of local marginal price (LMP) for each Distributed Generator (DG) bus on a network. The LMP value is determined for each DG on the basis of its contribution to reduce loss and emission reduction, which is assessed using the Shapley Value approach. The proposed approach enables the Distribution Company (DISCO) decision-maker to operate the network optimally in terms of loss and emission. The proposed method is implemented in the Taiwan Power Company distribution network 7 warnings consisting of 84 buses and 11 feeders in the MATLAB environment. The results show that the proposed approach allows DISCO to operate the network on the basis of its priority between the reduction of active power loss and emission in the network.

On Aspiration Solutions in Predicting Coalition Formationin Cooperative Games

This paper consists of two parts. The first part introduces the strict aspiration as a new aspiration solution concept, which is provedto be existent for any cooperative game. The second part deals with theunsolved problem put forward by Bennett by showing that there is atleast one payoff which is balanced, partnered and equal gains aspiration.The proof is algebraic and constructive, thus providing an algorithm forfinding such aspirations.

Benefit-based cost allocation for residentially distributed photovoltaic systems in China:A cooperative game theory approach

Distributed photovoltaic(PV)systems have constantly been the key to achieve a low-carbon economy in China.However,the development of Chinese distributed PV systems has failed to meet expectations because of their irrational profit and cost allocations.In this study,the methodology for calculating the levelized cost of energy(LCOE)for PV is thoroughly discussed to address this issue.A mixed-integer linear programming model is built to determine the optimal system operation strategy with a benefit analysis.An externality-corrected mathematical model based on Shapley value is established to allocate the cost of distributed PV systems in 15 Chinese cities between the government,utility grid and residents.Results show that(i)an inverse relationship exists between the LCOEs and solar radiation levels;(ii)the government and residents gain extra benefits from the utility grid through net metering policies,and the utility grid should be the highly subsidized participant;(iii)the percentage of cost assigned to the utility grid and government should increase with the expansion of battery bank to weaken the impact of demand response on increasing theoretical subsidies;and(iv)apart from the LCOE,the local residential electricity prices remarkably impact the subsidy calculation results.