公开(公告)号：US20220111979A1

公开(公告)日：2022-04-14

申请号：US17489812

申请日：2021-09-30

Applicant: Xi'an University of Architecture and Technology

Inventor： Runzi Liu ,  Xiang Ji ,  Wenzhu Zhang

IPC: B64G1/10 ,  G01S19/11

Abstract: Disclosed is a method for task planning of a space information network based on resource interchange. The method includes: initializing basic parameters of the space information network; dividing a planning horizon into K time slots of equal length, and constructing a resource time-varying graph for the space information network; sampling a feasible resource combination space of each task, and obtaining a candidate resource combination set comprised of the resource combinations with independence greater than or equal to a threshold n; calculating a conflict relation between resource combinations, and constructing a resource combination conflict graph; obtaining a maximum independent set of the resource combination conflict graph to obtain a global planning result; and searching a neighborhood of the global planning result, and completing a local adjustment of a task planning scheme through the resource interchange, to complete the task planning based on characteristics of the resource interchange.

公开(公告)号：US11884423B2

公开(公告)日：2024-01-30

申请号：US17489812

申请日：2021-09-30

Applicant: Xi'an University of Architecture and Technology

Inventor： Runzi Liu ,  Xiang Ji ,  Wenzhu Zhang

IPC: B64G1/10 ,  H04W28/16 ,  G06F9/50 ,  G06F9/48

CPC classification number: B64G1/1021 ,  B64G1/1007 ,  G06F9/4881 ,  G06F9/5061 ,  H04W28/16 ,  G06F2209/506

Abstract: Disclosed is a method for task planning of a space information network based on resource interchange. The method includes: initializing basic parameters of the space information network; dividing a planning horizon into K time slots of equal length, and constructing a resource time-varying graph for the space information network; sampling a feasible resource combination space of each task, and obtaining a candidate resource combination set comprised of the resource combinations with independence greater than or equal to a threshold n; calculating a conflict relation between resource combinations, and constructing a resource combination conflict graph; obtaining a maximum independent set of the resource combination conflict graph to obtain a global planning result; and searching a neighborhood of the global planning result, and completing a local adjustment of a task planning scheme through the resource interchange, to complete the task planning based on characteristics of the resource interchange.