On Game Based Distributed Decision Approach for Multi-agent Optimal Coverage Problem with Application to Constellations Reconfiguration
This paper focuses on the optimal coverage problem (OCP) for multi-agent systems with decentralized optimization. A game based distributed decision approach for the the multi-agent OCP is proposed. The equivalence between the equilibrium of the game and the extreme value of the global performance objective is strictly proved. Then, a distributed algorithm only using local information to obtain the global near-optimal coverage is developed, and its convergence is proved. Finally, the proposed method is applied to maximize the covering time of a satellite constellation for a target. The simulation results under different scenarios show our method costs much less computation time under some level index than traditional centralized optimization.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Self-optimization in distributed manufacturing systems using Modular State-based Stackelberg Games
In this study, we introduce Modular State-based Stackelberg Games (Mod-SbSG), a novel game structure developed for distributed self-learning in modular manufacturing systems. Mod-SbSG enhances cooperative decision-making…
Decision MakingSelf-LearningDistributed Power Control for Large Energy Harvesting Networks: A Multi-Agent Deep Reinforcement Learning Approach
In this paper, we develop a multi-agent reinforcement learning (MARL) framework to obtain online power control policies for a large energy harvesting (EH) multiple access channel, when only causal information about the E…
Deep Reinforcement LearningMulti-agent Reinforcement Learningreinforcement-learningReinforcement Learning+1Rationality and connectivity in stochastic learning for networked coordination games
Coordination is a desirable feature in many multi-agent systems such as robotic and socioeconomic networks. We consider a task allocation problem as a binary networked coordination game over an undirected regular graph. …
Successive Incentives
We study the design of optimal incentives in sequential processes. To do so, we consider a basic and fundamental model in which an agent initiates a value-creating sequential process through costly investment with random…
Interactive Restless Multi-armed Bandit Game and Swarm Intelligence Effect
We obtain the conditions for the emergence of the swarm intelligence effect in an interactive game of restless multi-armed bandit (rMAB). A player competes with multiple agents. Each bandit has a payoff that changes with…