CN111898900B - Airspace allocation method and device based on block chain - Google Patents

Airspace allocation method and device based on block chain Download PDF

Info

Publication number
CN111898900B
CN111898900B CN202010727105.2A CN202010727105A CN111898900B CN 111898900 B CN111898900 B CN 111898900B CN 202010727105 A CN202010727105 A CN 202010727105A CN 111898900 B CN111898900 B CN 111898900B
Authority
CN
China
Prior art keywords
airspace
conflict
user account
scheme
plan
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202010727105.2A
Other languages
Chinese (zh)
Other versions
CN111898900A (en
Inventor
程晓航
朱立彬
关礼安
张海
王冲
王长春
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
93209 Troops Of Chinese Pla
Original Assignee
93209 Troops Of Chinese Pla
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 93209 Troops Of Chinese Pla filed Critical 93209 Troops Of Chinese Pla
Priority to CN202010727105.2A priority Critical patent/CN111898900B/en
Publication of CN111898900A publication Critical patent/CN111898900A/en
Application granted granted Critical
Publication of CN111898900B publication Critical patent/CN111898900B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06315Needs-based resource requirements planning or analysis
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0633Workflow analysis
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/10Office automation; Time management
    • G06Q10/103Workflow collaboration or project management
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/10Services
    • G06Q50/26Government or public services

Abstract

The application discloses a block chain-based airspace allocation method and device, which relate to the technical field of airspace management and mainly aim to improve the fairness and efficiency of airspace allocation and the utilization rate of airspace resources by utilizing a block chain technology. The main technical scheme comprises the following steps: establishing a airspace allocation alliance block chain and constructing a corresponding block structure; expressing the airspace using plan by airspace grid coding; in the airspace scheme, determining whether conflicts with the spatial positions and the use time of other airspaces according to the spatial positions and the use time of the airspace use plan; if no conflict exists, reserving a airspace scheme; if the conflict exists, adjusting an airspace using plan according to a preset algorithm, taking a preset airspace evaluation standard as a consensus algorithm, and selecting an optimal airspace scheme; issuing a final airspace scheme for approval in an intelligent contract mode, and finishing accounting and block packing on the determined final airspace scheme to finish chain growth. The application can be applied to static and dynamic airspace allocation processes.

Description

Airspace allocation method and device based on block chain
Technical Field
The embodiment of the application relates to the technical field of airspace management, in particular to an airspace allocation method and device based on a block chain.
Background
Airspace is a national precious resource, various flight and air utilization activities all need to use airspace resources, with the development of various airspace users such as civil aviation, general aviation, military aviation, unmanned aerial vehicle, air shooting and the like, the problem of shortage of airspace resources is more and more prominent, the airspace use requirements of various airspace users are various, interest requirements are different, the airspace use safety is ensured, the airspace use efficiency is improved, the airspace allocation effect is more and more great, the current airspace allocation mechanism flow is still in a research and exploration stage, airspace allocation technology support means is behind, and the problems of difficulty in unifying airspace situations, inconvenience in collaborative decision, difficulty in guaranteeing fair disclosure, incapability of preventing individual malicious users and the like exist.
Disclosure of Invention
In view of this, the embodiment of the application provides a block chain-based airspace allocation method and device, which mainly aims to improve the fairness and efficiency of airspace allocation and the airspace resource utilization rate by using a block chain technology.
In order to solve the above problems, the embodiment of the present application mainly provides the following technical solutions:
in a first aspect, an embodiment of the present application provides a block chain-based airspace allocation method, where the method includes:
establishing a airspace allocation alliance block chain, and constructing a corresponding block structure, wherein the block structure comprises block header information and block body information;
expressing the airspace using plans by using airspace grid coding, taking each airspace using plan as block body information, and forming an airspace scheme by the set of all airspace using plans;
in the airspace scheme, determining whether conflicts with the spatial positions and the use time of other airspaces according to the spatial positions and the use time of the airspace use plan;
if no conflict exists, reserving the airspace scheme;
if collision exists, adjusting the airspace using plan according to a preset algorithm, taking a preset airspace evaluation standard as a consensus algorithm, and selecting an optimal airspace scheme;
issuing a final airspace scheme for approval in an intelligent contract mode, and finishing accounting and block packing on the determined final airspace scheme to finish chain growth.
Optionally, the adjusting the airspace usage plan according to the preset algorithm includes:
calculating the space position and the using time with conflict according to a preset algorithm, sending a conflict grid and the conflict time to the conflict user account, and determining the adjustment sequence of the conflict user account according to a preset conflict user account ordering algorithm;
and adjusting the self airspace using plan by the conflict user account until no conflict exists, evaluating the airspace scheme according to a preset airspace evaluation standard, determining an airspace allocation scheme, and respectively transmitting the airspace allocation scheme to the corresponding conflict user account.
Optionally, before determining whether the spatial position and the usage time of the airspace using plan conflict with those of other airspace in the airspace scheme, the method further includes:
and calibrating and correcting the airspace scheme based on a hash algorithm and a merck tree.
Optionally, building a spatial allocation alliance blockchain, and building a blockchain application architecture includes:
the first layer is a service application layer and is used for providing a display interface and realizing airspace allocation service flow;
the second layer is a core design layer, encapsulates all business logic applied to the block chain by airspace adjustment, and realizes various business functions in an intelligent contract manner;
the third layer is a basic service layer, which converts the blockchain billing capability, the blockchain operation and maintenance capability and the blockchain supporting facility capability into a programmable interface to provide bottom layer support for the first layer and the second layer.
Optionally, the method further comprises:
and initiating an occupied airspace application to the blockchain by the user account with the airspace adjustment requirement to form a new airspace scheme and complete chain growth.
In a second aspect, an embodiment of the present application further provides a spatial allocation device based on a blockchain, including:
the construction unit is used for establishing a airspace allocation alliance block chain and constructing a corresponding block structure, wherein the block structure comprises block header information and block body information;
the first processing unit is used for expressing the airspace using plans in an airspace grid coding mode, taking each airspace using plan as block body information, and forming an airspace scheme by the set of all airspace using plans;
the determining unit is used for determining whether the space position and the using time of the airspace using plan conflict with those of other airspaces according to the airspace using plan in the airspace scheme;
a reservation unit configured to reserve the spatial domain scheme when the determination unit determines that there is no collision;
the second processing unit is used for adjusting the airspace using plan according to a preset algorithm when the determining unit determines that the conflict exists, and selecting an optimal airspace scheme by taking a preset airspace evaluation standard as a consensus algorithm;
and the third processing unit is used for issuing a final airspace scheme for executing approval in an intelligent contract mode, and finishing accounting and block packing on the determined final airspace scheme to finish chain growth.
Optionally, the second processing unit includes:
the sending module is used for calculating the space position and the using time with conflict according to a preset algorithm and sending the conflict grid and the conflict time to the conflict user account;
the determining module is used for determining the adjustment sequence of the conflict user accounts according to a preset conflict user account ordering algorithm;
and the processing module is used for adjusting the self airspace using plan by the conflict user account until no conflict exists, evaluating the airspace scheme according to a preset airspace evaluation standard, determining the airspace allocation scheme and respectively transmitting the airspace allocation scheme to the corresponding conflict user account.
Optionally, the apparatus further includes:
the error correction unit is used for calibrating and correcting the airspace scheme based on a hash algorithm and a merck tree before the determining unit determines whether the spatial position and the using time of other airspace conflict with each other according to the spatial position and the using time of the airspace using plan in the airspace scheme.
Optionally, the blockchain application architecture constructed by the construction unit includes:
the first layer is a service application layer and is used for providing a display interface and realizing airspace allocation service flow;
the second layer is a core design layer, encapsulates all business logic applied to the block chain by airspace adjustment, and realizes various business functions in an intelligent contract manner;
the third layer is a basic service layer, which converts the blockchain billing capability, the blockchain operation and maintenance capability and the blockchain supporting facility capability into a programmable interface to provide bottom layer support for the first layer and the second layer.
Optionally, the apparatus further includes:
and the application unit is used for initiating an occupied airspace application to the blockchain by the user account with the airspace adjustment requirement so as to form a new airspace scheme and complete chain growth.
By means of the technical scheme, the technical scheme provided by the embodiment of the application has at least the following advantages:
the airspace allocation method and device based on the block chain provided by the embodiment of the application establish airspace allocation alliance block chain and construct corresponding block structure, wherein the block structure comprises block header information and block body information; expressing the airspace using plans by using airspace grid coding, taking each airspace using plan as block body information, and forming an airspace scheme by the set of all airspace using plans; in the airspace scheme, determining whether conflicts with the spatial positions and the use time of other airspaces according to the spatial positions and the use time of the airspace use plan; if no conflict exists, reserving the airspace scheme; if collision exists, adjusting the airspace using plan according to a preset algorithm, taking a preset airspace evaluation standard as a consensus algorithm, and selecting an optimal airspace scheme; issuing a final airspace scheme for approval in an intelligent contract mode, and finishing accounting and block packing on the determined final airspace scheme to finish chain growth. The embodiment of the application can improve the fairness and efficiency of airspace allocation and the utilization rate of airspace resources by utilizing the block chain technology.
The foregoing description is only an overview of the technical solutions of the embodiments of the present application, and may be implemented according to the content of the specification, so that the technical means of the embodiments of the present application can be more clearly understood, and the following specific implementation of the embodiments of the present application will be more apparent.
Drawings
Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the application. Also, like reference numerals are used to designate like parts throughout the figures. In the drawings:
FIG. 1 shows a flowchart of a block chain based airspace allocation method provided by an embodiment of the present application;
FIG. 2 illustrates a schematic diagram of a federated blockchain provided by an embodiment of the present application;
FIG. 3 is a schematic diagram of a blockchain application architecture provided by an embodiment of the present application;
FIG. 4 is a schematic diagram of a block structure according to an embodiment of the present application;
FIG. 5 is a block diagram illustrating an embodiment of the present application after adjustment;
FIG. 6 shows a block diagram of a block-chain-based airspace allocation device according to an embodiment of the present application;
fig. 7 is a block diagram illustrating another block-chain-based airspace allocation device according to an embodiment of the present application.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
The embodiment of the application also provides a airspace allocation method based on the block chain, which is shown in fig. 1 and comprises the following steps:
101. establishing a airspace allocation alliance block chain, and constructing a corresponding block structure, wherein the block structure comprises block header information and block body information;
a user-controllable alliance blockchain is established, common accounts are set by airspace users such as various levels of air traffic control departments, airlines, navigation companies, flight service stations, unmanned aerial vehicle companies and the like, management accounts (super accounts) are set for airspace management departments, public keys and private keys are set for the common user accounts and the management accounts (super accounts), homomorphic encryption, zero knowledge proof and other methods are utilized to ensure information transmission and information safety on the blockchain, equal, transparent and secret of each user in the airspace coordination period is realized, and meanwhile, the approval and the management of an approver are realized.
For easy understanding, the user-controllable federated blockchain is illustrated in a legend form, as shown in fig. 2, fig. 2 shows a schematic diagram of the user-controllable federated blockchain according to an embodiment of the present application, where node 1 is a null management department node, i.e. a super account node, and nodes 2 to 10 are general user nodes, and two-way communication between the nodes is performed.
As shown in fig. 3, fig. 3 is a schematic diagram of a blockchain application architecture provided by an embodiment of the present application, where the blockchain application architecture is described by taking a three-layer blockchain application architecture as an example, but it should be clear that the description is not intended to limit the number of layers of the blockchain and the functions that each layer can implement.
With continued reference to fig. 3, the first layer is a service application layer, and has a main function of providing friendly and easy-to-use interfaces for users in each airspace, so as to implement a battlefield airspace allocation service flow; the second layer is a core design layer, encapsulates all business logic applied to the block chain by airspace adjustment, and realizes various business functions in an intelligent contract manner; the third layer is a basic service layer, which converts the blockchain billing capability, the blockchain operation and maintenance capability and the blockchain supporting facility capability into a programmable interface to provide bottom layer support for the upper two layers (i.e. the first layer and the second layer).
102. Expressing the airspace using plans by using airspace grid coding, taking each airspace using plan as block body information, and forming an airspace scheme by the set of all airspace using plans;
each airspace user requirement (airspace using plan) is expressed as a group of airspace coding set, each airspace user requirement is taken as block body information, and block head information is added to construct a block structure.
In practical applications, the spatial grids may be denoted as (a, H), where a represents the spatial range, H is the altitude interval, and after the spatial is rasterized, each grid may be assigned a fixed code n=f (a, H), where f (x) is a numbering function executed according to a certain rule. The airspace requirement of the user n can be expressed as a grid sequence an= { (Ni, ti), 1.ltoreq.i.ltoreq.Ln } based on time, ln is the total number of airspace grids contained in the airspace requirement of the user n, the codes are sequentially numbered from the starting point to the end point of the airspace requirement, ni is the corresponding airspace grid number, and Ti is the service time of the corresponding airspace grid.
As shown in fig. 4, fig. 4 is a schematic diagram of a block structure according to an embodiment of the present application, HAx is corresponding block header information, and the other parts are block body information.
103. In the airspace scheme, determining whether conflicts with the spatial positions and the use time of other airspaces according to the spatial positions and the use time of the airspace use plan;
if no conflict exists, step 104 is performed; if there is a conflict, step 105 is performed.
The purpose of this step is to find the collision space position and collision use time used by each user airspace for the space domain collision detection.
And detecting conflicts among all user airspace requirements an= { (Ni, ti), i being more than or equal to 1 and L_n } by adopting a traditional airspace conflict algorithm, and finding time and space conflicts. Illustratively, the grid No. 4 in the null grid sequence of the user 2 and the grid No. 20 in the null grid sequence of the user 9 are found to be the same spatial grid (spatial grid code is 100) and have the same usage time, that is, n4=n20=100, t4=t20, and thus, it is determined that there is a collision between the user 2 and the user 9.
104. Reserving the airspace scheme;
105. adjusting the airspace using plan according to a preset algorithm, taking a preset airspace evaluation standard as a consensus algorithm, and selecting an optimal airspace scheme;
in the embodiment of the application, a conflict grid and a conflict time are sent to conflict user accounts, a conflict user account ordering algorithm is designed, an adjustment sequence is determined, each airspace using plan is adjusted by the conflict user accounts until no conflict exists, and the airspace scheme is evaluated according to a preset airspace evaluation standard until the optimal airspace scheme is selected.
106. Issuing a final airspace scheme for approval in an intelligent contract mode, and finishing accounting and block packing on the determined final airspace scheme to finish chain growth.
After approval by an approver (super account number), the airspace scheme is issued and executed in an intelligent contract mode, billing and block packing are completed, chain growth is completed, and the next block (new airspace scheme) generation process is entered.
The airspace allocation method based on the block chain, provided by the embodiment of the application, establishes an airspace allocation alliance block chain, and constructs a corresponding block structure, wherein the block structure comprises block header information and block body information; expressing the airspace using plans by using airspace grid coding, taking each airspace using plan as block body information, and forming an airspace scheme by the set of all airspace using plans; in the airspace scheme, determining whether conflicts with the spatial positions and the use time of other airspaces according to the spatial positions and the use time of the airspace use plan; if no conflict exists, reserving the airspace scheme; if collision exists, adjusting the airspace using plan according to a preset algorithm, taking a preset airspace evaluation standard as a consensus algorithm, and selecting an optimal airspace scheme; issuing a final airspace scheme for approval in an intelligent contract mode, and finishing accounting and block packing on the determined final airspace scheme to finish chain growth. The embodiment of the application provides public transparent transmission of the whole network information by using a block chain technology, provides a fair and fair airspace use coordination means, and realizes collaborative decision of each user; reasonable airspace scheme evaluation criteria are provided, so that each user can quickly reach consensus, fairness and efficiency of airspace allocation are improved, and airspace resource utilization rate is improved.
In step 105, when performing the adjustment of the airspace usage plan according to a preset algorithm, the following may be used, but is not limited to, the following manner: calculating the space position and the using time with conflict according to a preset algorithm, sending a conflict grid and the conflict time to the conflict user account, and determining the adjustment sequence of the conflict user account according to a preset conflict user account ordering algorithm; and adjusting the self airspace using plan by the conflict user account until no conflict exists, evaluating the airspace scheme according to a preset airspace evaluation standard, determining an airspace allocation scheme, and respectively transmitting the airspace allocation scheme to the corresponding conflict user account.
When sorting according to the preset conflict user accounts, for example, sorting according to priority may be adopted, and an exemplary airspace scheme includes 3 conflict user accounts, sorting the conflict user accounts according to priority to obtain a conflict user account 1, a conflict user account 3 and a conflict user account 2 according to priority, then the conflict user account 2 with the lowest priority adjusts its airspace using plan preferentially, the conflict user account 3 adjusts its airspace using plan again, and finally the conflict user account 1 adjusts its airspace using plan until no conflict exists.
For example, assume that the airspace user of conflicting user account 2 selects to change the airspace usage time to obtain a new airspace usage scheme, even if A2 becomes A2 '= { (Ni, ti+t), 1+.ltoreq.i+.ltoreq.l2 }, where T is a safe time interval, and A2' is the airspace usage requirement obtained after the modification. After the adjustment is evaluated, no conflict exists, and the block is repackaged, as shown in fig. 5, fig. 5 shows a block structure diagram after adjustment according to the embodiment of the present application.
In order to prevent transmission errors and malicious tampering, the embodiment of the present application calculates the space domain scheme by adopting a preset calibration error correction algorithm before executing step 103 to determine whether the space domain scheme collides with the space positions and the use times of other spaces according to the space positions and the use times of the space domain use plans in the space domain scheme. In practical application, the embodiment of the application adopts a spatial domain scheme calibration and error correction algorithm based on a hash algorithm and a merck tree, and calculates a hash value Hn=H (An) of the spatial domain use requirement of a user, wherein n is more than or equal to 1 and less than or equal to 10, and H is the designed hash algorithm. The specific implementation manners of the merck tree construction method, the airspace scheme calibration and the error correction algorithm refer to the implementation manners in the prior art, and the embodiments of the present application are not described in detail herein.
The embodiment of the application can also realize the dynamic allocation of airspace:
and initiating an occupied airspace application to the blockchain by the user account with the airspace adjustment requirement, and responding and allocating the occupied airspace application according to the execution flow of the embodiment so as to form a new airspace scheme. The airspace situation changes rapidly, the airspace utilization and coordination increase rapidly, users needing to adjust airspace temporarily initiate application on a blockchain, and a new airspace scheme is formed through collaborative decision of all airspace users, and the application is automatically issued and executed.
If the airspace using requirement of the user changes, all the steps described in the embodiment are carried out again.
In summary, the embodiment of the application provides the public transparent transmission of the whole network information by using the block chain technology, and realizes that each airspace user grasps the consistent airspace situation; providing a fair and fair airspace use coordination means to realize collaborative decision of each user; providing reasonable airspace scheme evaluation criteria, and realizing rapid consensus among all users; the security of the airspace information on the chain is ensured by adopting methods such as homomorphic encryption, zero knowledge proof and the like; setting a common account and a super account, and combining the advantages of centralized fair negotiation and centralized management. In a word, by applying the method provided by the embodiment of the application, the fairness and efficiency of airspace allocation can be improved, and the airspace resource utilization rate can be improved.
Since the block-chain-based airspace allocation device described in this embodiment is a device capable of executing the block-chain-based airspace allocation method in this embodiment, those skilled in the art can know the specific implementation of the block-chain-based airspace allocation device and various variations thereof, so how the block-chain-based airspace allocation device implements the block-chain-based airspace allocation method in this embodiment will not be described in detail. As long as those skilled in the art implement the apparatus for implementing the block chain-based airspace allocation method in the embodiments of the present application, the apparatus falls within the scope of the present application.
The embodiment of the application also provides a airspace allocation device based on the block chain, as shown in fig. 6, which comprises the following steps:
a construction unit 21, configured to establish a spatial allocation alliance blockchain, and construct a corresponding block structure, where the block structure includes block header information and block body information;
a first processing unit 22, configured to express the airspace usage plans in a gridding coding, and use each airspace usage plan as block body information, where a set of all airspace usage plans forms an airspace plan;
a determining unit 23, configured to determine whether a conflict with the spatial position and the usage time of other airspace occurs according to the spatial position and the usage time of the airspace usage plan in the airspace scheme;
a retaining unit 24, configured to retain the spatial domain scheme when the determining unit determines that there is no collision;
a second processing unit 25, configured to adjust the airspace usage plan according to a preset algorithm when the determining unit determines that there is a conflict, and select an optimal airspace scheme by using a preset airspace evaluation criterion as a consensus algorithm;
and a third processing unit 26, configured to issue a final airspace scheme for performing approval in a smart contract manner, complete billing and block packing for the determined final airspace scheme, and complete chain growth.
Further, as shown in fig. 7, the second processing unit 25 includes:
the sending module 251 is configured to calculate the spatial location and the usage time of the conflict according to a preset algorithm, and send a conflict grid and the conflict time to a conflict user account;
a determining module 252, configured to determine an adjustment order of the conflicting user accounts according to a preset conflicting user account ordering algorithm;
and the processing module 253 is used for adjusting the self airspace using plan by the conflict user account until no conflict exists, evaluating the airspace scheme according to a preset airspace evaluation standard, determining the airspace allocation scheme and respectively transmitting the airspace allocation scheme to the corresponding conflict user account.
Further, as shown in fig. 7, the apparatus further includes:
an error correction unit 27, configured to calibrate and correct the airspace scheme based on a hash algorithm and a merck tree before the determining unit 23 determines, in the airspace scheme, whether a conflict with spatial positions and usage times of other airspaces occurs according to spatial positions and usage times of airspace usage plans.
The blockchain application architecture constructed by the construction unit comprises:
the first layer is a service application layer and is used for providing a display interface and realizing airspace allocation service flow;
the second layer is a core design layer, encapsulates all business logic applied to the block chain by airspace adjustment, and realizes various business functions in an intelligent contract manner;
the third layer is a basic service layer, which converts the blockchain billing capability, the blockchain operation and maintenance capability and the blockchain supporting facility capability into a programmable interface to provide bottom layer support for the first layer and the second layer.
Further, as shown in fig. 7, the apparatus further includes:
and the application unit 28 is used for initiating an occupied airspace application to the blockchain by the user account with the airspace adjustment requirement so as to form a new airspace scheme and complete chain growth.
The airspace allocation device based on the block chain provided by the embodiment of the application establishes airspace allocation alliance block chains and constructs corresponding block structures, wherein the block structures comprise block header information and block body information; expressing the airspace using plans by using airspace grid coding, taking each airspace using plan as block body information, and forming an airspace scheme by the set of all airspace using plans; in the airspace scheme, determining whether conflicts with the spatial positions and the use time of other airspaces according to the spatial positions and the use time of the airspace use plan; if no conflict exists, reserving the airspace scheme; if collision exists, adjusting the airspace using plan according to a preset algorithm, taking a preset airspace evaluation standard as a consensus algorithm, and selecting an optimal airspace scheme; issuing a final airspace scheme for approval in an intelligent contract mode, and finishing accounting and block packing on the determined final airspace scheme to finish chain growth. The embodiment of the application provides public transparent transmission of the whole network information by using a block chain technology, provides a fair and fair airspace use coordination means, and realizes collaborative decision of each user; reasonable airspace scheme evaluation criteria are provided, so that each user can quickly reach consensus, fairness and efficiency of airspace allocation are improved, and airspace resource utilization rate is improved.
The present embodiment provides a non-transitory computer-readable storage medium storing computer instructions that cause a computer to perform the methods provided by the above-described method embodiments.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In one typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include volatile memory in a computer-readable medium, random Access Memory (RAM) and/or nonvolatile memory, etc., such as Read Only Memory (ROM) or flash RAM. Memory is an example of a computer-readable medium.
Computer readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device. Computer-readable media, as defined herein, does not include transitory computer-readable media (transmission media), such as modulated data signals and carrier waves.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises an element.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The foregoing is merely exemplary of the present application and is not intended to limit the present application. Various modifications and variations of the present application will be apparent to those skilled in the art. Any modification, equivalent replacement, improvement, etc. which come within the spirit and principles of the application are to be included in the scope of the claims of the present application.

Claims (8)

1. A block chain based airspace allocation method, comprising:
establishing a airspace allocation alliance block chain, and constructing a corresponding block structure, wherein the block structure comprises block header information and block body information;
expressing the airspace using plans by using airspace grid coding, taking each airspace using plan as block body information, and forming an airspace scheme by the set of all airspace using plans;
in the airspace scheme, determining whether conflicts with the spatial positions and the use time of other airspaces according to the spatial positions and the use time of the airspace use plan;
if no conflict exists, reserving the airspace scheme;
if collision exists, adjusting the airspace using plan according to a preset algorithm, taking a preset airspace evaluation standard as a consensus algorithm, and selecting an optimal airspace scheme;
wherein, the adjusting the airspace using plan according to the preset algorithm includes:
calculating the space position and the using time with conflict according to a preset algorithm, sending a conflict grid and the conflict time to the conflict user account, and determining the adjustment sequence of the conflict user account according to a preset conflict user account ordering algorithm;
adjusting a self airspace using plan by the conflict user account until no conflict exists, evaluating an airspace scheme according to a preset airspace evaluation standard, determining an airspace allocation scheme, and respectively transmitting the airspace allocation scheme to the corresponding conflict user account;
the conflict user account adjusts the airspace using plan of the user until no conflict exists, and the method comprises the following steps:
the airspace scheme comprises 3 conflict user accounts;
the conflict user accounts are ordered according to the priority, and a conflict user account 1, a conflict user account 3 and a conflict user account 2 which are in the order of the priority are obtained;
the airspace using plan corresponding to the conflict user account 2 is preferentially adjusted in the conflict user account 2 with the lowest priority; the conflict user account 2 adjusts the airspace usage plan corresponding to the conflict user account 2, wherein the airspace user of the conflict user account 2 selects to change airspace usage time to obtain a new airspace usage plan, even if A2 is changed to A2 '= { (Ni, ti+T), i is more than or equal to 1 and less than or equal to L2}, wherein T is a safe time interval, and A2' is the airspace usage requirement obtained after modification; ni is the ith grid number of the corresponding airspace, and Ti is the service time of the corresponding airspace grid; l2 is the total number of airspace grids contained in the airspace requirement of the conflict user account 2, and the airspace grids are numbered sequentially from the starting point to the ending point of the blank requirement;
after the conflict user account 2 with the lowest priority adjusts the airspace usage plan, the conflict user account 3 adjusts the airspace usage plan corresponding to the conflict user account 3;
adjusting a airspace using plan corresponding to the conflict user account 1 by the conflict user account 1 until no conflict exists;
issuing a final airspace scheme for approval in an intelligent contract mode, and finishing accounting and block packing on the determined final airspace scheme to finish chain growth.
2. The method of claim 1, wherein prior to determining whether a conflict with spatial locations and usage times of other airspace in the airspace scheme based on spatial locations and usage times of airspace usage plans, the method further comprises:
and calibrating and correcting the airspace scheme based on a hash algorithm and a merck tree.
3. The method of claim 1, wherein building a blockchain application architecture comprises:
the first layer is a service application layer and is used for providing a display interface and realizing airspace allocation service flow;
the second layer is a core design layer, encapsulates all business logic applied to the block chain by airspace adjustment, and realizes various business functions in an intelligent contract manner;
the third layer is a basic service layer, which converts the blockchain billing capability, the blockchain operation and maintenance capability and the blockchain supporting facility capability into a programmable interface to provide bottom layer support for the first layer and the second layer.
4. A method according to claim 3, characterized in that the method further comprises:
and initiating an occupied airspace application to the blockchain by the user account with the airspace adjustment requirement to form a new airspace scheme and complete chain growth.
5. A block chain based airspace allocation device, comprising:
the construction unit is used for establishing a airspace allocation alliance block chain and constructing a corresponding block structure, wherein the block structure comprises block header information and block body information;
the first processing unit is used for expressing the airspace using plans in an airspace grid coding mode, taking each airspace using plan as block body information, and forming an airspace scheme by the set of all airspace using plans;
the determining unit is used for determining whether the space position and the using time of the airspace using plan conflict with those of other airspaces according to the airspace using plan in the airspace scheme;
a reservation unit configured to reserve the spatial domain scheme when the determination unit determines that there is no collision;
the second processing unit is used for adjusting the airspace using plan according to a preset algorithm when the determining unit determines that the conflict exists, and selecting an optimal airspace scheme by taking a preset airspace evaluation standard as a consensus algorithm;
wherein, the adjusting the airspace using plan according to the preset algorithm includes:
calculating the space position and the using time with conflict according to a preset algorithm, sending a conflict grid and the conflict time to the conflict user account, and determining the adjustment sequence of the conflict user account according to a preset conflict user account ordering algorithm;
adjusting a self airspace using plan by the conflict user account until no conflict exists, evaluating an airspace scheme according to a preset airspace evaluation standard, determining an airspace allocation scheme, and respectively transmitting the airspace allocation scheme to the corresponding conflict user account;
the conflict user account adjusts the airspace using plan of the user until no conflict exists, and the method comprises the following steps:
the airspace scheme comprises 3 conflict user accounts;
the conflict user accounts are ordered according to the priority, and a conflict user account 1, a conflict user account 3 and a conflict user account 2 which are in the order of the priority are obtained;
the airspace using plan corresponding to the conflict user account 2 is preferentially adjusted in the conflict user account 2 with the lowest priority; the conflict user account 2 adjusts the airspace usage plan corresponding to the conflict user account 2, wherein the airspace user of the conflict user account 2 selects to change airspace usage time to obtain a new airspace usage plan, even if A2 is changed to A2 '= { (Ni, ti+T), i is more than or equal to 1 and less than or equal to L2}, wherein T is a safe time interval, and A2' is the airspace usage requirement obtained after modification; ni is the ith grid number of the corresponding airspace, and Ti is the service time of the corresponding airspace grid; l2 is the total number of airspace grids contained in the airspace requirement of the conflict user account 2, and the airspace grids are numbered sequentially from the starting point to the ending point of the blank requirement;
after the conflict user account 2 with the lowest priority adjusts the airspace usage plan, the conflict user account 3 adjusts the airspace usage plan corresponding to the conflict user account 3;
adjusting a airspace using plan corresponding to the conflict user account 1 by the conflict user account 1 until no conflict exists;
and the third processing unit is used for issuing a final airspace scheme for executing approval in an intelligent contract mode, and finishing accounting and block packing on the determined final airspace scheme to finish chain growth.
6. The apparatus of claim 5, wherein the apparatus further comprises:
the error correction unit is used for calibrating and correcting the airspace scheme based on a hash algorithm and a merck tree before the determining unit determines whether the spatial position and the using time of the airspace using plan conflict with those of other airspace in the airspace scheme.
7. The apparatus of claim 5, wherein the blockchain application architecture constructed by the construction unit includes:
the first layer is a service application layer and is used for providing a display interface and realizing airspace allocation service flow;
the second layer is a core design layer, encapsulates all business logic applied to the block chain by airspace adjustment, and realizes various business functions in an intelligent contract manner;
the third layer is a basic service layer, which converts the blockchain billing capability, the blockchain operation and maintenance capability and the blockchain supporting facility capability into a programmable interface to provide bottom layer support for the first layer and the second layer.
8. The apparatus of claim 7, wherein the apparatus further comprises:
and the application unit is used for initiating an occupied airspace application to the blockchain by the user account with the airspace adjustment requirement so as to form a new airspace scheme and complete chain growth.
CN202010727105.2A 2020-07-26 2020-07-26 Airspace allocation method and device based on block chain Active CN111898900B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010727105.2A CN111898900B (en) 2020-07-26 2020-07-26 Airspace allocation method and device based on block chain

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010727105.2A CN111898900B (en) 2020-07-26 2020-07-26 Airspace allocation method and device based on block chain

Publications (2)

Publication Number Publication Date
CN111898900A CN111898900A (en) 2020-11-06
CN111898900B true CN111898900B (en) 2023-10-24

Family

ID=73190894

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010727105.2A Active CN111898900B (en) 2020-07-26 2020-07-26 Airspace allocation method and device based on block chain

Country Status (1)

Country Link
CN (1) CN111898900B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115357679B (en) * 2022-10-20 2023-02-28 中国电子科技集团公司第二十八研究所 Four-dimensional spatial domain self-adaptive rasterization planning method and device

Citations (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7689995B1 (en) * 2003-01-08 2010-03-30 Avtrex, Inc. Resolving scheduling conflicts in a recording device
CN102682626A (en) * 2011-02-22 2012-09-19 通用电气公司 Methods and systems for managing air traffic
EP2667366A1 (en) * 2012-05-25 2013-11-27 The Boeing Company Conflict detection and resolution using predicted aircraft trajectories
CN107895225A (en) * 2017-11-01 2018-04-10 北京邮电大学 A kind of cooperation type method for allocating tasks of multi-Agent Lothrus apterus
US9990854B1 (en) * 2016-03-15 2018-06-05 Rockwell Collins, Inc. Unmanned aerial system mission flight representation conversion techniques and traffic management scheme
CN108805309A (en) * 2018-06-26 2018-11-13 尹煦 A kind of parking system and its workflow based on block chain technology
CN108877290A (en) * 2018-08-03 2018-11-23 中国联合网络通信集团有限公司 Parking stall dispatching method, device, equipment and storage medium
WO2019086821A1 (en) * 2017-10-31 2019-05-09 Sita Information Networking Computing Uk Limited System and method for monitoring unmanned aircraft
CN109739255A (en) * 2018-11-29 2019-05-10 北京航空航天大学 The ship trajectory planing method of unmanned plane, apparatus and system
CN110070758A (en) * 2018-01-23 2019-07-30 贝尔直升机德事隆公司 Block chain airspace management for aerial tax services
CN110517538A (en) * 2019-08-06 2019-11-29 电子科技大学 Aircraft actively discovers and cooperates with collision-proof method and system
CN111210669A (en) * 2020-01-11 2020-05-29 中国人民解放军93209部队 Airspace conflict resolution rule creation method and system based on deduction evaluation
CN112235114A (en) * 2020-09-25 2021-01-15 西安纸贵互联网科技有限公司 Service processing system based on block chain
EP3893432A1 (en) * 2020-04-06 2021-10-13 The Boeing Company Validating a data block for a vehicle trajectory blockchain and blockchain generation system

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111307166B (en) * 2018-12-11 2023-10-03 北京图森智途科技有限公司 Method and device for constructing occupied grid map and processing equipment
US11580866B2 (en) * 2020-02-20 2023-02-14 Min-Chung Gia UAV (unmanned aerial vehicle) logistics operation and air traffic control method based on blockchain technology
US20230131553A1 (en) * 2021-10-27 2023-04-27 Volvo Car Corporation Environment-aware path planning for a self-driving vehicle using dynamic step-size search

Patent Citations (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7689995B1 (en) * 2003-01-08 2010-03-30 Avtrex, Inc. Resolving scheduling conflicts in a recording device
CN102682626A (en) * 2011-02-22 2012-09-19 通用电气公司 Methods and systems for managing air traffic
EP2667366A1 (en) * 2012-05-25 2013-11-27 The Boeing Company Conflict detection and resolution using predicted aircraft trajectories
US9990854B1 (en) * 2016-03-15 2018-06-05 Rockwell Collins, Inc. Unmanned aerial system mission flight representation conversion techniques and traffic management scheme
WO2019086821A1 (en) * 2017-10-31 2019-05-09 Sita Information Networking Computing Uk Limited System and method for monitoring unmanned aircraft
CN107895225A (en) * 2017-11-01 2018-04-10 北京邮电大学 A kind of cooperation type method for allocating tasks of multi-Agent Lothrus apterus
CN110070758A (en) * 2018-01-23 2019-07-30 贝尔直升机德事隆公司 Block chain airspace management for aerial tax services
CN108805309A (en) * 2018-06-26 2018-11-13 尹煦 A kind of parking system and its workflow based on block chain technology
CN108877290A (en) * 2018-08-03 2018-11-23 中国联合网络通信集团有限公司 Parking stall dispatching method, device, equipment and storage medium
CN109739255A (en) * 2018-11-29 2019-05-10 北京航空航天大学 The ship trajectory planing method of unmanned plane, apparatus and system
CN110517538A (en) * 2019-08-06 2019-11-29 电子科技大学 Aircraft actively discovers and cooperates with collision-proof method and system
CN111210669A (en) * 2020-01-11 2020-05-29 中国人民解放军93209部队 Airspace conflict resolution rule creation method and system based on deduction evaluation
EP3893432A1 (en) * 2020-04-06 2021-10-13 The Boeing Company Validating a data block for a vehicle trajectory blockchain and blockchain generation system
CN112235114A (en) * 2020-09-25 2021-01-15 西安纸贵互联网科技有限公司 Service processing system based on block chain

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
一种改进的飞行计划调配方法研究;张威;;信息化研究(第01期);全文 *
三维环境中多机器人协同路径规划算法;刘凯;王明孝;吴超辉;张涵斐;周桥;苏娇娆;;测绘科学技术学报(第02期);全文 *
低空通航飞行计划预先调配方法研究;田宇;张洪海;钱晓鹏;许卫卫;王立超;;武汉理工大学学报(交通科学与工程版)(第03期);全文 *
区块链技术航空应用与发展展望;王宁;王煜;张志雄;;航空科学技术(第06期);全文 *
王宁 ; 王煜 ; 张志雄 ; .区块链技术航空应用与发展展望.航空科学技术.2020,(第06期),全文. *

Also Published As

Publication number Publication date
CN111898900A (en) 2020-11-06

Similar Documents

Publication Publication Date Title
US11694170B2 (en) Method for processing data and apparatuses for implementing the same
CN105050130B (en) A kind of construction method of multidimensional interference space model
US10848338B2 (en) Systems and methods relating to a smart home manager
Miao et al. Data-driven distributionally robust vehicle balancing using dynamic region partitions
Yang et al. Schedule communication for decentralized state estimation
CN111898900B (en) Airspace allocation method and device based on block chain
CN112041860A (en) Machine learning on blockchains
US11593898B2 (en) Method for processing data and apparatuses for implementing the same
CN105637927A (en) Communication access method and user equipment
WO2016131388A1 (en) Resource allocation method and device
CN113285960B (en) Data encryption method and system for service data sharing cloud platform
Ghosal et al. Computing robustness of flexray schedules to uncertainties in design parameters
Chiasserini et al. Blockchain-based mobility verification of connected cars
Song et al. Joint design of shuffling and function assignment in heterogeneous coded distributed computing
CN103870562A (en) Regulation verifying method and system in intelligent building system
Liu et al. Topology-transparent scheduling in mobile ad hoc networks with multiple packet reception capability
CN103259746B (en) The dynamic rearrangement of service management scheduler level
CN113741542A (en) Unmanned aerial vehicle control method and device under emergency disposal scene, unmanned aerial vehicle and medium
US11075958B2 (en) Communication system and method for applying security for a time sensitive network
CN105260134B (en) Towards the map datum equilibrium storage method of dynamic space computational domain under cluster environment
US10091069B2 (en) Method for modelling information transmission network having hierarchical structure and apparatus thereof
CN110334148A (en) The method and device of data write-in block chain network in enterprise resource planning
CN113630390B (en) Network security communication method and device of terminal equipment based on big data
CN104539709B (en) The data back up method and system of distributed situation map
CN115190181B (en) Resource management method and system based on cloud management

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant