Game theoretic self-organization in multi-satellite distributed task allocation

Sun, Changhao; Wang, Xiaochu; Qiu, Huaxin; Zhou, Qingrui

doi:10.1016/j.ast.2021.106650

Cited by 20 publications

(3 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In a realistic application of taking pictures and building a map of a city, they achieve positive results utilizing the proposed algorithm. In the domain of multisatellite systems, Sun et al [51] present a potential gamebased approach to self-organized task allocation, ensuring each equilibrium corresponds to a task cover, and showcasing the resilience and efficacy of their method against unforeseen disruptions through simulation trials.…”

Section: Division Of Labor Games With Control -Methods With Additiona...mentioning

confidence: 99%

Evolutionary dynamic of division of labor games

Zhang,

Wang

2024

EPL

View full text Add to dashboard Cite

The ubiquity of labor division within diverse social collectives is a topic well captured by evolutionary game theory. This work offers an integrative review of the evolutionary dynamics underpinning such division of labor from a tripartite standpoint—commencing with a theoretical exposition on numerous archetypes of labor division games. Subsequently, we delineate a suite of control strategies formulated to not only realize but also sustain the phenomenon of division of labor. This is followed by an elucidation of practical implementations pertaining to the allocation of tasks and labor division, grounded in the principles of game theory. We culminate with the proposition of prospective avenues and insightful trajectories for future investigations, cultivating a frontier for the continued exploration within this field.

show abstract

Section: Division Of Labor Games With Control -Methods With Additiona...mentioning

confidence: 99%

Evolutionary dynamic of division of labor games

Zhang,

Wang

2024

EPL

View full text Add to dashboard Cite

show abstract

“…In the event of sudden forest fires, the timely allocation of tasks to each UAV can significantly reduce the overall execution time of the reconnaissance mission and minimize the losses caused by the fire. At present, the main methods include centralized task assignment methods and decentralized task assignment methods [2][3][4].…”

Section: Introductionmentioning

confidence: 99%

An FW–GA Hybrid Algorithm Combined with Clustering for UAV Forest Fire Reconnaissance Task Assignment

Tian

Hou

2023

Mathematics

View full text Add to dashboard Cite

The assignment of tasks for unmanned aerial vehicles (UAVs) during forest fire reconnaissance is a highly complex and large-scale problem. Current task allocation methods struggle to strike a balance between solution speed and effectiveness. In this paper, a two-phase centralized UAV task assignment model based on expectation maximization (EM) clustering and the multidimensional knapsack model (MKP) is proposed for the forest fire reconnaissance task assignment. The fire situation information is acquired using the sensors carried by satellites at first. Then, the EM algorithm based on the Gaussian mixture model (GMM) is applied to get the initial position of every UAV. In the end, the MKP is applied for UAV task assignment based on the initial positions of the UAVs. An improved genetic algorithm (GA) based on the fireworks algorithm (FWA) is proposed for faster iteration speed. A simulation was carried out against the background of forest fires in Liangshan Prefecture, Sichuan Province, and the simulation’s results demonstrate that the task assignment model can quickly and effectively address task allocation problems on a large scale. In addition, the FW–GA hybrid algorithm has great advantages over the traditional GA, particularly in solving time, iteration convergence speed, and solution effectiveness. It can reduce up to 556% of the iteration time and increase objective function value by 1.7% compared to the standard GA. Furthermore, compared to the GA–SA algorithm, its solving time is up to 60 times lower. This paper provides a new idea for future large-scale UAV task assignment problems.

show abstract

“…When the nodes are equally weighted, we have the minimum vertex cover (MVC) problem, the decision version of which is among Karp's 21 NP complete problems [2], [3]. Besides, as it well represents cooperative decision-making issues in many multiagent scenarios, a series of real-world applications has also been found, ranging from wireless sensor networks, wireless communication, computer network security, and mission scheduling [4]- [9]. For instance, by deploying sensors at vertices of the MWVC, we could surveil all the roads in a transport network with the minimum cost [10].…”

mentioning

confidence: 99%

Better Approximation for Distributed Weighted Vertex Cover via Game-Theoretic Learning

Sun

Qiu

Sun

et al. 2022

IEEE Trans. Syst. Man Cybern, Syst.

Self Cite

View full text Add to dashboard Cite

Toward better approximation for the minimumweighted vertex cover (MWVC) problem in multiagent systems, we present a distributed algorithm from the perspective of learning in games. For self-organized coordination and optimization, we see each vertex as a potential game player who makes decisions using local information of its own and the immediate neighbors. The resulting Nash equilibrium is classified into two categories, i.e., the inferior Nash equilibrium (INE) and the dominant Nash equilibrium (DNE). We show that the optimal solution must be a DNE. To achieve better approximation ratios, local rules of perturbation and weighted memory are designed, with the former destroying the stability of an INE and the latter facilitating the refinement of a DNE. By showing the existence of an improvement path from any INE to a DNE, we prove that when the memory length is larger than 1, our algorithm converges in finite time to DNEs, which could not be improved by exchanging the action of a selected node with all its unselected neighbors. Moreover, additional freedom for solution efficiency refinement is provided by increasing the memory length. Finally, intensive comparison experiments demonstrate the superiority of the presented methodology to the state of the art, both in solution efficiency and computation speed.

show abstract

Game theoretic self-organization in multi-satellite distributed task allocation

Cited by 20 publications

References 19 publications

Evolutionary dynamic of division of labor games

Evolutionary dynamic of division of labor games

An FW–GA Hybrid Algorithm Combined with Clustering for UAV Forest Fire Reconnaissance Task Assignment

Better Approximation for Distributed Weighted Vertex Cover via Game-Theoretic Learning

Contact Info

Product

Resources

About