Storing method and device, communication equipment and storage medium

Abstract

The embodiment of the invention discloses an inventory method and device, communication equipment and a storage medium. The method comprises the following steps: a base station generates inventory information according to at least one of inventory service demand information, environment information, the position of the base station, the transmitting power of the base station, the position of a relay node, the transmitting power of a read-write module of the relay node and label sensitivity; the inventory information comprises a plurality of positions to which the relay node is to be moved and information representing whether label inventory operation is executed at each position; sending an instruction to the relay node based on the inventory information, wherein the instruction is used for indicating the moving position of the relay node and whether the label inventory operation is executed at the position; and receiving the inventory label information sent by the relay node.

Description

Technical Field

[0001] The present invention relates to the field of communication technology, and in particular to an inventory method, device, communication equipment and storage medium. Background Art

[0002] Radio Frequency Identification (RFID) is widely used in retail, logistics, asset management and other fields. It has the characteristics of zero power consumption, low cost and easy deployment. It is the basic enabling technology for the Internet of Everything. Traditional RFID usually reads tags "point to point" through handheld devices, which cannot achieve large-scale automatic tag reading. Therefore, the industry has begun to study passive Internet of Things technology by using the backscattering principle of RFID.

[0003] At present, the system architecture of passive Internet of Things includes a relay architecture, which includes base stations, relay nodes and tags. This architecture expands the signal coverage by deploying relay nodes, but the relay nodes deployed in this way are fixed in position. In order to achieve signal area coverage, relay nodes need to be deployed in fixed positions in advance, which consumes a lot of manpower and material resources, and the deployment time cost is high. As the deployment area increases, the number of deployed relay nodes also increases, and the equipment cost is high. In addition, due to the fixed position of the relay nodes, they are affected by "electromagnetic voids", which may make it difficult to inventory some tags. Summary of the invention

[0004] In order to solve the existing technical problems, the embodiments of the present invention provide an inventory method, apparatus, communication equipment and storage medium.

[0005] To achieve the above object, the technical solution of the embodiment of the present invention is implemented as follows:

[0006] In a first aspect, an embodiment of the present invention provides an inventory method, which is applied to a base station; the method includes:

[0007] The base station generates inventory information according to at least one of inventory service demand information, environmental information, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity; the inventory information includes a plurality of locations to which the relay node is to be moved and information indicating whether a tag inventory operation is performed at each location;

[0008] sending an instruction to the relay node based on the inventory information, the instruction being used to indicate a location where the relay node moves and whether to perform a label inventory operation at the location;

[0009] The inventory tag information sent by the relay node is received.

[0010] In the above solution, the base station generates inventory information according to at least one of the inventory service demand information, environmental information, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity, including:

[0011] The base station constructs a topology map according to at least one of the inventory service demand information, environmental information, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity; the topology map includes at least a plurality of path information;

[0012] Based on the topological graph, the shortest path capable of taking inventory of all labels is determined, and whether a relay node is required to perform a label inventory operation at a vertex position in the shortest path is determined; and inventory information is generated based on the shortest path and whether a relay node is required to perform a label inventory operation at a node position in the shortest path.

[0013] In the above scheme, the base station constructs a topology map according to at least one of the inventory service demand information, environmental information, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity, including:

[0014] The base station determines the area to be inventoried based on the service demand information and / or the environment information, and divides the area to be inventoried into a plurality of grids; at least some of the plurality of grids include tags to be inventoried;

[0015] A finite directed graph is formed according to the area to be inventoried including multiple grids, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity, and a topological graph including the finite directed graph is generated; the finite directed graph includes: multiple vertices, arcs connecting two vertices, and a cost corresponding to each arc;

[0016] Wherein, when the first vertex of the arc corresponds to the starting position of the relay node, the cost represents the sum of the number of labels within the signal coverage range of the relay node at the starting position and the position corresponding to the second vertex of the arc, and the distance between the position corresponding to the first vertex and the position corresponding to the second vertex;

[0017] When the first vertex of the arc is not the starting position of the relay node, the cost represents the number of new labels or the number of grids containing new labels within the signal coverage range of the relay node at the position corresponding to the second vertex of the arc, and the distance between the corresponding position of the first vertex and the corresponding position of the second vertex.

[0018] In the above scheme, the finite directed graph is formed according to the area to be inventoried containing multiple grids, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity, including:

[0019] Determine a plurality of vertices and arcs connecting two vertices in the finite directed graph according to the area to be inventoried that includes a plurality of grids;

[0020] Determine a first signal coverage range of the base station according to the location of the base station and the transmission power of the base station, and determine a second signal coverage range of the relay node according to the location of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity;

[0021] The cost corresponding to each arc in the finite directed graph is determined based on the first signal coverage range and the second signal coverage range; wherein, when the tag is within the second signal coverage range of the relay node and the relay node is within the first signal coverage range of the base station, it indicates that the tag can be read by the relay node.

[0022] In the above scheme, the determining of the shortest path capable of taking inventory of all tags based on the topological map comprises: generating a set of paths to be expanded including a first element, a second element and a third element based on the topological map, and storing the second element in the set to be expanded; the first element is a starting position, the second element comprises the number of inventoried tags and the moving distance from the starting position s to the current position n, and the third element comprises the total number of tags and the estimated moving distance from the starting position s to the current position n to all inventoried tags; wherein, during the initialization process, the current position n is the starting position s;

[0023] Selecting a first subpath with the best corresponding third element from the set of paths to be extended, deleting the element corresponding to the first subpath from the set of paths to be extended, and moving the element corresponding to the first subpath in the set to be extended to the extended set;

[0024] In the case that the relay node cannot inventory all labels after passing through the first subpath, the first subpath is expanded to obtain at least one second subpath, an element corresponding to the at least one second subpath is added to the set of paths to be expanded, and a second element corresponding to the second subpath with the best corresponding second element is stored in the set to be expanded, and an element corresponding to a specific second subpath in the set of paths to be expanded is deleted, where the specific second subpath is a second subpath with a corresponding third element worse than that of the second subpath with the best corresponding second element;

[0025] If the relay node can store all labels through the first subpath and the performance of the first subpath is better than the determined current optimal subpath, updating the current optimal subpath to the first subpath;

[0026] Repeating the steps of selecting a first sub-path from the set of paths to be extended and extending the first sub-path until the set of paths to be extended is empty;

[0027] The shortest path capable of inventorying all tags is output based on the expanded set.

[0028] In the above solution, adding the element corresponding to the at least one second sub-path to the set of paths to be extended includes:

[0029] Calculate the second element corresponding to each second subpath and the third element corresponding to each second subpath; add each second subpath, the second element of each second subpath and the third element of each second subpath to the set of paths to be expanded; wherein the second element includes the number of inventoried tags and the moving distance from the starting position s to the current position m, and the third element includes the total number of tags and the estimated moving distance from the starting position s to the current position m to all inventoried tags, and the current position m is the subsequent node position of the current position n.

[0030] In the above solution, the step of expanding the first subpath to obtain at least one second subpath includes: combining each node position m after the current position n with the first subpath to obtain at least one second subpath.

[0031] In the above solution, the step of determining whether a relay node is required to perform a label inventory operation at a vertex position in the shortest path includes:

[0032] If a new label is added at the vertex position and within the signal coverage of the relay node, it is determined that the relay node is required to perform a label inventory operation at the vertex position;

[0033] If no new label is added at the vertex position and within the signal coverage of the relay node, it is determined that the relay node is not required to perform a label inventory operation at the vertex position.

[0034] In the above solution, the sending of instructions to the relay node based on the inventory information includes:

[0035] The base station sends an instruction to the relay node based on the inventory information, where the instruction includes the multiple locations and indication information of whether to perform a label inventory operation at each location; or,

[0036] The base station sends a plurality of instructions to the relay node in sequence based on the inventory information, each instruction including a location and indication information of whether the location performs a label inventory operation.

[0037] In the above solution, the base station sends multiple instructions to the relay node in sequence based on the inventory information, including:

[0038] The base station sends a first instruction to the relay node, where the first instruction includes a first position and indication information of whether to perform a label inventory operation at the first position;

[0039] When the received inventory label information indicates that there is no label information, or when the received inventory label information indicates that no new labels continue to be inventoried, or when it is determined based on the received inventory label information that no new labels continue to be inventoried, a second instruction is sent to the relay node, wherein the second instruction includes a second position and indication information of whether the second position performs a label inventory operation.

[0040] In a second aspect, an embodiment of the present invention further provides an inventory method, which is applied to a relay node and includes:

[0041] The relay node receives an instruction sent by the base station, the instruction is used to indicate the position of the relay node and whether to perform a tag inventory operation at the position; the instruction is sent by the base station based on inventory information; the inventory information is generated according to at least one of inventory service demand information, environmental information, the position of the base station, the transmission power of the base station, the position of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity;

[0042] Move to the location and perform a tag inventory operation or not perform a tag inventory operation based on the instruction;

[0043] The inventory tag information is sent to the base station.

[0044] In the above solution, the performing of the label inventory operation includes: the relay node performs the label inventory operation by sending an inventory instruction until no new labels are found, and determines that the label inventory is successful.

[0045] In the above solution, the inventory instruction includes a first parameter, and the inventory instruction including the first parameter is used to instruct the tag not to respond to the inventory instruction if it receives the inventory instruction again after the inventory has been successfully taken.

[0046] In the above scheme, the first parameter is a time parameter, and the inventory instruction including the time parameter is used to instruct the tag not to respond to the inventory instruction if it receives the inventory instruction again within the time range of the time parameter when the inventory is successful.

[0047] In the above solution, the instruction includes the multiple locations and indication information of whether to perform a tag inventory operation at each location;

[0048] The moving to the location based on the instruction and performing a label inventory operation or not performing a label inventory operation comprises: the relay node sequentially moving to the multiple locations based on the instruction and performing a label inventory operation or not performing a label inventory operation at each location.

[0049] In the above solution, the relay node moves to the multiple locations in sequence based on the instruction and performs a label inventory operation or does not perform a label inventory operation at each location, including:

[0050] The relay node moves to the first position based on the instruction, and if the label inventory operation is not performed at the first position, it moves to the second position; if the label inventory operation is performed at the first position, it sends an inventory instruction to perform the label inventory operation, and moves to the second position when it is determined that no new label is being inventoried based on the identification of the received label.

[0051] In the above solution, the instruction includes a location and indication information of whether the location performs a tag inventory operation.

[0052] In a third aspect, an embodiment of the present invention further provides an inventory device, which is applied to a base station and includes: a first processing unit and a first communication unit; wherein:

[0053] The first processing unit is used to generate inventory information according to at least one of the inventory service demand information, environmental information, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity; the inventory information includes multiple locations to which the relay node is to be moved and information indicating whether to perform a tag inventory operation at each location;

[0054] The first communication unit is used to send an instruction to the relay node based on the inventory information, wherein the instruction is used to indicate the location where the relay node moves and whether to perform a label inventory operation at the location; and is also used to receive the inventory label information sent by the relay node.

[0055] In a fourth aspect, an embodiment of the present invention further provides an inventory device, which is applied to a relay node, and comprises: a second communication unit and a second processing unit; wherein:

[0056] The second communication unit is used to receive an instruction sent by the base station, the instruction is used to indicate the position of the relay node and whether to perform a tag inventory operation at the position; the instruction is sent by the base station based on the inventory information; the inventory information is generated according to at least one of the inventory service demand information, environmental information, the position of the base station, the transmission power of the base station, the position of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity;

[0057] The second processing unit is configured to move to the location and perform or not perform a tag inventory operation based on the instruction;

[0058] The second communication unit is further configured to send inventory tag information to the base station.

[0059] In a fifth aspect, an embodiment of the present invention further provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the inventory method described in the first aspect or the second aspect of the embodiment of the present invention.

[0060] In a sixth aspect, an embodiment of the present invention further provides a communication device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the steps of the inventory method described in the first aspect or the second aspect of the embodiment of the present invention are implemented.

[0061] In a seventh aspect, an embodiment of the present invention further provides a computer program product, comprising computer program instructions, which enable a computer to execute the steps of the inventory method described in the first aspect or the second aspect of the embodiment of the present invention.

[0062] The embodiment of the present invention provides an inventory method, apparatus, communication equipment and storage medium, the method comprising: a base station generates inventory information according to at least one of inventory service demand information, environmental information, the location of the base station, the transmission power of the base station, the location of a relay node, the transmission power of a read / write module of the relay node and tag sensitivity; the inventory information comprises a plurality of locations to which the relay node is to be moved and information indicating whether a tag inventory operation is to be performed at each location; based on the inventory information, an instruction is sent to the relay node, the instruction is used to indicate the location to which the relay node is to be moved and whether a tag inventory operation is to be performed at the location; and the inventory tag information sent by the relay node is received. By adopting the technical solution of the embodiment of the present invention, on the one hand, the problem of consuming a lot of manpower, material resources and a lot of cost in deploying relay nodes at fixed locations is solved through movable relay nodes, thereby reducing the deployment time and cost of relay nodes; on the other hand, the base station generates inventory information according to at least one of the inventory business demand information, environmental information, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read-write module of the relay node and the tag sensitivity, so as to realize the planning of the movement trajectory of the relay node, which can reduce the "electromagnetic hole" phenomenon to a certain extent. BRIEF DESCRIPTION OF THE DRAWINGS

[0063] Figure 1 A schematic diagram of a system architecture for an inventory method according to an embodiment of the present invention;

[0064] Figure 2 The process diagram of the inventory method according to the embodiment of the present invention is as follows Figure 1 ;

[0065] Figure 3 The process diagram of the inventory method according to the embodiment of the present invention is as follows Figure 2 ;

[0066] Figure 4 is a schematic diagram of an inventory method according to an embodiment of the present invention;

[0067] Figure 5 Schematic diagram of the interactive process of the inventory method according to an embodiment of the present invention;

[0068] Figure 6 A schematic diagram of optimizing a scheduling scheme in an inventory method according to an embodiment of the present invention;

[0069] Figure 7 A functional schematic diagram of a mobile scheduling optimization system according to an embodiment of the present invention;

[0070] Figure 8 A schematic diagram of constructing a topology map in an inventory method according to an embodiment of the present invention;

[0071] Fig. 9A schematic diagram of an optimal path search subgraph in an inventory method according to an embodiment of the present invention;

[0072] Fig.10 The structure diagram of the inventory device according to the embodiment of the present invention is shown in FIG. Figure 1 ;

[0073] Fig.11 The structure diagram of the inventory device according to the embodiment of the present invention is shown in FIG. Figure 2 ;

[0074] Fig.12 The figure is a schematic diagram of the hardware structure of the communication device according to the embodiment of the present invention. DETAILED DESCRIPTION

[0075] The present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments.

[0076] The technical solution of the embodiment of the present invention can be applied to various communication systems, for example: a global system of mobile communication (GSM) system, a long term evolution (LTE) system or a 5G system, etc. Optionally, the 5G system or 5G network may also be referred to as a new radio (NR) system or NR network.

[0077] Exemplarily, the communication system applied in the embodiment of the present invention may include a network device and a terminal device (also referred to as a terminal, a communication terminal, etc.); the network device may be a device that communicates with the terminal device. Among them, the network device can provide communication coverage within a certain area, and can communicate with terminals located in the area. Optionally, the network device may be a base station in each communication system, such as an evolved base station (eNB, Evolutional Node B) in an LTE system, and a base station (gNB) in a 5G system or an NR system.

[0078] It should be understood that the device with communication function in the network / system in the embodiment of the present application can be referred to as a communication device. The communication device may include a network device and a terminal with communication function, and the network device and the terminal device may be the specific devices described above, which will not be repeated here; the communication device may also include other devices in the communication system, such as a network controller, a mobile management entity and other network entities, which are not limited in the embodiment of the present invention.

[0079] It should be understood that the terms "system" and "network" are often used interchangeably in this article. The term "and / or" in this article is only a description of the association relationship of associated objects, indicating that three relationships can exist. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " in this article generally indicates that the associated objects before and after are in an "or" relationship.

[0080] The terms "first", "second", etc. in the specification and claims of the present application are used to distinguish similar objects, and need not be used to describe a specific order or sequential order. It should be understood that the data used in this way can be interchangeable in appropriate circumstances, so that the embodiments of the present application described herein can be implemented in a sequence other than those illustrated or described herein, for example. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, the process, method, system, product or equipment comprising a series of steps or units need not be limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or equipment.

[0081] Figure 1 Schematic diagram of the system architecture of the inventory method of the embodiment of the present invention. Figure 1 As shown, the system architecture adapted by the inventory method of the embodiment of the present invention includes a base station, a relay node and a tag; wherein the relay node has a mobile function, for example, it has a mobile component that enables it to move according to a control instruction. In this embodiment, the relay node has a read-write function or a reader function, and can read and write tags attached to items, thereby realizing an inventory of tags. Exemplarily, the relay node can be a read-write module set on an automated guided vehicle (AGV), or a read-write module is added to the AGV.

[0082] In this embodiment, the base station can realize communication interaction with the relay node through the Uu interface, such as controlling the movement and reading instructions of the relay node; the relay node can realize the reading or inventory operation of the tag through the passive Internet of Things (Ambient IoT / Passive IoT) channel.

[0083] At least based on Figure 1 Based on the structure shown, the following embodiments of the present invention are proposed.

[0084] An embodiment of the present invention provides an inventory method. Figure 2 The process diagram of the inventory method according to the embodiment of the present invention is as follows Figure 1 ;like Figure 2 As shown, the method includes:

[0085] Step 101: The base station generates inventory information according to at least one of inventory service demand information, environmental information, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read / write module of the relay node, and tag sensitivity; the inventory information includes multiple locations to which the relay node is to be moved and information indicating whether to perform a tag inventory operation at each location;

[0086] Step 102: Sending an instruction to the relay node based on the inventory information, wherein the instruction is used to indicate the location where the relay node moves and whether to perform a label inventory operation at the location;

[0087] Step 103: Receive the inventory tag information sent by the relay node.

[0088] Accordingly, Figure 3 The process diagram of the inventory method according to the embodiment of the present invention is as follows Figure 2 ;like Figure 3 As shown, the method includes:

[0089] Step 201: A relay node receives an instruction sent by a base station, the instruction being used to indicate a position where the relay node moves and whether to perform a tag inventory operation at the position; the instruction is sent by the base station based on inventory information; the inventory information is generated based on at least one of inventory service demand information, environmental information, a position of a base station, a transmission power of a base station, a position of a relay node, a transmission power of a read / write module of the relay node, and tag sensitivity;

[0090] Step 202: moving to the location based on the instruction and performing a tag inventory operation or not performing a tag inventory operation;

[0091] Step 203: Sending inventory tag information to the base station.

[0092] In this embodiment, on the one hand, the problem of consuming a lot of manpower, material resources and a lot of cost in deploying relay nodes at fixed locations is solved through movable relay nodes, thereby reducing the deployment time and cost of relay nodes; on the other hand, the base station generates inventory information based on at least one of the inventory business demand information, environmental information, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read-write module of the relay node and the tag sensitivity, so as to plan the movement trajectory of the relay node, which can reduce the "electromagnetic hole" phenomenon to a certain extent.

[0093] In this embodiment, the inventory service demand information specifically indicates the user's demand for the current inventory service. Exemplarily, the inventory service demand information may include inventory area information, such as the latitude and longitude range of the inventory area, or the area identifier of the factory, etc. In other optional embodiments, the inventory service demand information may also include an inventory instruction, indicating that an inventory is performed on tags in a specified area. In actual applications, the user may send the inventory service demand information to the base station through a terminal device.

[0094] In this embodiment, the environmental information, also referred to as environmental topology information, indicates the environmental content in the area where the inventory process is to be performed. Exemplarily, the environmental information may specifically include the location of each setting, the location of items, etc. in the area where the inventory process is to be performed. In practical applications, the environmental information may be obtained through a camera acquisition system, a laser radar, etc.

[0095] In this embodiment, the position of the relay node may specifically be the starting position of the relay node before the inventory is performed.

[0096] In this embodiment, the tag sensitivity, also known as the tag receiving sensitivity, indicates the power threshold for the tag to trigger the start operation. Exemplarily, when the power of the signal received by the tag exceeds the power threshold indicated by the tag sensitivity, the tag can start the subsequent operation.

[0097] In this embodiment, the location of the base station and the transmission power of the base station are related to the mobile location of the relay node. In order to ensure the communication interaction between the base station and the relay node, the base station needs to ensure that the mobile location of the relay node is within the signal coverage of the base station when generating inventory information.

[0098] In this embodiment, the transmission power of the read / write module of the relay node and the tag sensitivity are related to the mobile position of the relay node. During the tag inventory process, the position of the tag is fixed, so the base station needs to ensure that all tags are inventoried as much as possible during the process of generating inventory information. Therefore, it is necessary to ensure that the tag can receive the inventory instruction (or signaling) sent by the relay node and that the inventory instruction (or signaling) can meet the tag sensitivity requirements based on the transmission power of the read / write module of the relay node and / or the tag sensitivity and other information.

[0099] In this embodiment, the base station generates inventory information based on at least one of the inventory service demand information, environmental information, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity. The inventory information includes multiple locations in the mobile path planned for the relay node, and information on whether to perform a tag inventory operation at each location. It can be understood that the inventory information can also be called mobile scheduling inventory information.

[0100] In some optional embodiments, the inventory information may include: position 1, whether to perform a tag inventory operation at position 1; position 2, whether to perform a tag inventory operation at position 2; ...; position n, whether to perform a tag inventory operation at position n. The performing a tag inventory operation specifically refers to sending an inventory instruction, such as sending a query instruction, and executing a tag inventory process until all tags within the signal range of the location are read.

[0101] In some optional embodiments, for the base station, the sending of instructions to the relay node based on the inventory information includes: the base station sending instructions to the relay node based on the inventory information, the instructions including the multiple locations and indication information of whether to perform a label inventory operation at each location; or, the base station sending multiple instructions to the relay node in sequence based on the inventory information, each instruction including a location and indication information of whether to perform a label inventory operation at the location.

[0102] Accordingly, for the relay node, in some optional embodiments, the instruction includes the multiple locations and indication information of whether to perform a label inventory operation at each location; the moving to the location based on the instruction and performing a label inventory operation or not performing a label inventory operation includes: the relay node sequentially moves to the multiple locations based on the instruction and performs a label inventory operation or not performing a label inventory operation at each location. In other optional embodiments, the instruction includes a location and indication information of whether to perform a label inventory operation at the location.

[0103] In this embodiment, the base station may send an instruction to the relay node based on the inventory information, so that the relay node moves according to the instruction and determines whether to perform the label inventory operation. As an implementation method, the instruction sent by the base station may include all the determined positions and indication information of whether to perform the label inventory operation at each position (that is, the instruction includes the multiple positions and indication information of whether to perform the label inventory operation at each position); then the relay node may move to each position in sequence according to all the positions carried in the instruction, and determine whether to perform the label inventory operation at the corresponding position according to the indication information of whether to perform the label inventory operation at each position carried in the instruction. If it is determined to perform the label inventory operation at the corresponding position, the label inventory process is started; if it is determined not to perform the label inventory operation at the corresponding position, the label inventory is not performed, and the relay node directly moves to the next position of the corresponding position. As another implementation manner, the instruction sent by the base station may include a location and indication information of whether a label inventory operation is to be performed at the location (i.e., the base station sends multiple instructions to the relay node in sequence, each instruction includes a location and indication information of whether a label inventory operation is to be performed at the location); the relay node may move to the location according to the instruction and determine whether a label inventory operation is to be performed at the location; if it is determined to perform the label inventory operation at the location, the label inventory process is started until the label inventory is completed, and the label information is sent to the base station, and the base station further sends an instruction to the relay node again to move the relay node to the next location, and so on; if it is determined not to perform the label inventory operation at the corresponding location, the label inventory is not performed, and relevant information of no label information reporting is sent to the base station, and the base station further sends an instruction to the relay node again to move the relay node to the next location, and so on.

[0104] In some optional embodiments, the base station sends multiple instructions to the relay node in sequence based on the inventory information, including: the base station sends a first instruction to the relay node, the first instruction including a first position and indication information of whether the first position performs a label inventory operation; when the received inventory label information indicates that there is no label information, or when the received inventory label information indicates that no new labels continue to be inventoried, or when it is determined based on the received inventory label information that no new labels continue to be inventoried, sending a second instruction to the relay node, the second instruction including a second position and indication information of whether the second position performs a label inventory operation.

[0105] In this embodiment, for the case where the base station sends multiple instructions to the relay node in sequence, that is, the base station sends an instruction to the relay node, and the instruction includes a location and indication information of whether the location performs a label inventory operation, how the base station determines that the second instruction can be sent to the relay node after sending the first instruction to the relay node includes at least the following cases:

[0106] As an example, if the instruction includes a location and indication information that the label inventory operation is not performed at the location, then in this case, after receiving the instruction, the relay node moves to the location, but does not perform the label inventory operation at the location; the relay node sends inventory label information indicating that there is no label information to the base station; then the base station receives the inventory label information indicating that there is no label information. In this case, the base station sends a second instruction to the relay node to instruct the relay node to move to the next location and perform or not perform the label inventory operation at the next location.

[0107] As another example, if the instruction includes a location and indication information for performing a label inventory operation at the location, then in this case, after receiving the instruction, the relay node moves to the location and performs a label inventory operation at the location. During each round of label inventory, the relay node can determine whether to inventory a new label or continue to inventory a label that has been inventoried. If no new label continues to be inventoried under certain conditions (e.g., several rounds of label inventory processes), the relay node sends inventory label information to the base station, and the inventory label information indicates that no new label continues to be inventoried. In this case, the base station sends a second instruction to the relay node to instruct the relay node to move to the next location and perform or not perform a label inventory operation at the next location.

[0108] As another example, if the instruction includes a location and indication information for performing a label inventory operation at the location, then in this case, after receiving the instruction, the relay node moves to the location and performs a label inventory operation at the location. After executing each round of label inventory process, the relay node sends the inventory label information to the base station regardless of whether a new label is inventoried or an inventory of labels that have been inventoried is continued; then, based on the received inventory label information, the base station determines that no new labels continue to be inventoried under certain conditions (e.g., several rounds of label inventory processes), then the base station can determine that the label inventory process at the location is over, and send a second instruction to the relay node, the second instruction including the second location and indication information of whether the label inventory operation is performed at the second location.

[0109] In some optional embodiments, the relay node moves to the multiple positions in sequence based on the instruction and performs a label inventory operation or does not perform a label inventory operation at each position, including: the relay node moves to the first position based on the instruction, and if the label inventory operation is not performed at the first position, moves to the second position; if the label inventory operation is performed at the first position, sends an inventory instruction to perform the label inventory operation, and moves to the second position when it is determined that no new label is inventoried based on the identification of the received label.

[0110] As an example, the identifier of the tag may be, for example, an Electronic Product Code (EPC); in other optional examples, the identifier of the tag may also be other identifiers that can uniquely identify the tag, which is not limited in this embodiment.

[0111] In some optional embodiments, for the relay node, performing the label inventory operation includes: the relay node sends an inventory instruction to perform the label inventory operation until no new labels are found, and determines that the label inventory is successful.

[0112] In this embodiment, the relay node may specifically use a specified algorithm or protocol to perform the tag inventory operation. For example, for the inventory process of multiple tags, during the inventory process, the relay node may perform the inventory operation through commands such as Query, QueryAdjust, QueryRep, and ACK. The Query command contains a slot counter parameter Q. After receiving the Query command, the tags participating in the inventory will count the slot counters between 0 and 2. Q-1 A random number is selected within the range and loaded into the slot counter inside the tag. The tag whose slot counter selects 0 is converted to the response state and backscatters RN16 to the relay node; after the relay node receives the RN16 replied by the tag, it sends an ACK command to the tag with RN16 as the parameter; after the tag in the response state receives RN16, it backscatters EPC to the relay node and switches to the confirmation state. After the relay node uses the Query command to start an inventory cycle, it generally issues one or more QueryAdjust commands or QueryRep commands. The QueryAdjust command is used to change the Q value so that the tag generates a new random number; the QueryRep command reduces the value of the slot counter in the tag by 1; when the value of the slot counter of the tag is reduced to 9, the tag switches its own state to the response state, thereby executing the above process. The relay node can determine that no new tags will be inventoried for a period of time based on the received EPC, and then determine that the inventory of the tag at the current location is successful.

[0113] In some optional embodiments, the inventory instruction includes a first parameter, and the inventory instruction including the first parameter is used to instruct the tag not to respond to the inventory instruction if it receives the inventory instruction again after the inventory has been successfully performed.

[0114] In this embodiment, the inventory instruction may include a first parameter for indicating that a tag that has successfully inventoried will not respond to the inventory instruction if it receives the inventory instruction again, so as to prevent the tag from responding frequently. Exemplarily, the inventory instruction may be any instruction in the inventory process, such as at least one of Query, QueryAdjust, QueryRep, and ACK.

[0115] In some optional embodiments, the first parameter is a time parameter, and the inventory instruction including the time parameter is used to instruct the tag not to respond to the inventory instruction if it receives the inventory instruction again within the time range of the time parameter when the inventory is successful.

[0116] In this embodiment, the first parameter is a time parameter, which is used to indicate that if a tag that has successfully counted an inventory receives an inventory instruction again within the range of the time parameter, it will not respond to the inventory instruction; correspondingly, if a tag that has successfully counted an inventory receives an inventory instruction again outside the range of the time parameter, it needs to respond to the inventory instruction according to the instructions of the inventory instruction.

[0117] Figure 4 is a schematic diagram of an inventory method according to an embodiment of the present invention; Figure 5 Schematic diagram of the interactive process of the inventory method of the embodiment of the present invention; Figure 4 and Figure 5 The inventory method of the embodiment of the present invention is described. Figure 5 As shown, the method includes:

[0118] Step 301: The user sends a label inventory request to the base station, and the base station sends the inventory request to the Agv relay node (referred to as relay node for short).

[0119] Here, the inventory demand sent by the base station to the relay node is used to indicate that there is an inventory service.

[0120] Step 302: After receiving the inventory request, the relay node reports the current location s to the base station.

[0121] Step 303: The base station generates inventory information of the relay node according to the inventory service requirements, environmental information, the location of the base station, the transmission power of the base station, the location s of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity. The inventory information is a mobile scheduling inventory plan for the relay node.

[0122] Here, the inventory information can be expressed as s = n0, t0, n1, t1, ..., γ = n k ,t k , where s = n0 represents the starting position of the relay node, γ = n kIndicates the end position of the relay node, s→n1→n2→…→n k Represents the moving trajectory of the relay node, where n1, n2, ..., n k Indicates the location of the relay node; t i ∈{0,1}(i=0,1,2,…,k) means at position n i Whether to perform a read operation, t i =1 means at position n i The tag reading operation is performed at t i =0 means at position n i No tag reading operation is performed at this location. i is initialized to 0.

[0123] Step 304: The base station sends an instruction to the relay node, the instruction including the moving position n i and inventory control instructions i .

[0124] Here, the value of the inventory control instruction can be 0 or 1.

[0125] Step 305: The relay node moves to position n according to the received instruction. i , and according to the inventory control instruction t i Determines whether to perform an inventory operation.

[0126] In this example, Figure 4 As shown, the relay node can move from one location to another location (such as location n) according to the instructions sent by the base station along the planned path. i ), according to the transmission power of the read / write module of the relay node and the tag sensitivity, the signal coverage range of the relay node can be as follows Figure 4 The range shown by the circle with the Agv relay node as the center, that is, the tags within the circle can receive the instructions of the Agv relay node and respond.

[0127] Among them, if t i =0, indicating that at position n i If an inventory operation is not required, step 306 is executed: the relay node sends inventory label information indicating no label information to the base station, indicating that the label information is not inventoried.

[0128] If t i=1, the relay node starts to execute the tag inventory process, and then executes steps 307a to 307b: sends a Query instruction to the tag and executes the tag reading process; during the tag inventory process, the inventoryed tag reports the EPC to the relay node, and the relay node receives the EPC reported by the tag until the tags within the signal range are read at the current location; and executes step 307c: the relay node reports the inventory tag information to the base station, and the inventory tag information may include the ECP of the inventory tag.

[0129] Step 308: i is increased by 1, and steps 304 to 307 are repeated until the execution of the mobile scheduling inventory plan in the inventory information is completed, that is, the relay node is instructed to move to the last position and execute the corresponding instructions.

[0130] Step 309: The base station feeds back the stored tag information to the user.

[0131] In this example, when the relay node takes inventory of tags at a certain location, the number of newly added tags (or grids) covered by the signal can be achieved in a variety of ways:

[0132] Method 1: The relay node can add the parameter time in the Query command to indicate a time range. If the tag inventory is successful, the tag can retain the parameter time and no longer respond to the inventory command within the time range indicated by the parameter time. This can prevent the inventory-received tag from responding again after receiving the inventory.

[0133] Method 2: When performing label inventory at each location, the relay node completes the label inventory process at the location, that is, the relay node determines that no new labels are continuously inventoried after a period of time or several rounds of label inventory processes, that is, the relay node can compare the EPC of the newly inventoried labels with the EPC of the inventoried labels, and if it is determined that no new labels are inventoried, the relay node can send inventory label information to the base station, and the inventory label information can include the EPC of all labels inventoried at this location. After receiving the inventory label information, the base station can send the next location instruction to the relay node according to the inventory information in step 303.

[0134] Method 3: When performing label inventory at each location, the relay node performs label inventory at the location. If the EPC of the label is found, the relay node sends the label inventory information to the base station. The base station compares the EPC in the label inventory information with the EPC of the label that has been found, thereby determining whether a new label is found. Similarly, if the base station determines that no new label is found after a period of time or several rounds of label inventory, the base station can send the next location instruction to the relay node according to the inventory information in step 303.

[0135] In this embodiment, before sending instructions to the relay node, the base station generates inventory information based on at least one of the inventory service demand information, environmental information, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity, that is, plans the mobile path for the relay node and determines the locations to perform the tag inventory operation.

[0136] In some optional embodiments, the base station generates inventory information based on at least one of inventory service demand information, environmental information, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read-write module of the relay node, and tag sensitivity, including: the base station constructs a topology map based on at least one of the inventory service demand information, environmental information, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read-write module of the relay node, and tag sensitivity; the topology map includes at least multiple path information; based on the topology map, the shortest path that can inventory all tags is determined, and whether a relay node is required to perform a tag inventory operation at a vertex position in the shortest path, and the inventory information is generated based on the shortest path and whether a relay node is required to perform a tag inventory operation at a node position in the shortest path.

[0137] In this embodiment, the base station plans the shortest path capable of taking inventory of all tags for the relay node, that is, the path formed by each position included in the inventory information is the shortest path capable of taking inventory of all tags.

[0138] The traditional shortest path optimization method, taking the traditional A* method as an example, starts from the starting point and searches for the shortest path by continuously selecting and expanding nodes. In this process, for each node, only one shortest subpath from the starting point to the current node is retained. However, in the relay passive IoT mobile scheduling problem, for each location node, the path with the shortest distance may not necessarily have the largest number of inventory tags. If the tags are directly counted by repeatedly moving the location, all tags can be read, but the moving path may not be the shortest.

[0139] Based on this, the embodiment of the present invention considers the inventory completion of labels. The traditional shortest path optimization method (such as Dijkstra method, A* method, etc.) is not suitable for the problem of this embodiment. Therefore, the embodiment of the present invention models the mobility planning problem of relay nodes and designs the shortest path optimization method by constructing a topology graph.

[0140] Figure 6 Schematic diagram of optimizing the scheduling scheme in the inventory method of an embodiment of the present invention; the walls, obstacles and inventory items in the inventory area can be as follows Figure 6 As shown, a relay node may have multiple moving paths.

[0141] Figure 7 FIG. 1 is a functional diagram of a mobile scheduling optimization system according to an embodiment of the present invention; Figure 7 As shown, the system may include a topology map construction function module, a mobile scheduling planning function module and a path output function module.

[0142] Specifically, the topology map construction function module constructs a topology map based on at least one of the inventory business demand information, environmental information, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity; wherein the topology map includes at least multiple path information; optionally, the topology map may also include tag inventory information. Then, the mobile scheduling planning function module searches for the shortest path that can inventory all tags from the topology map. Specifically, after the mobile scheduling planning function module initializes the search sub-path, it cyclically selects sub-paths, expands sub-paths, and retains sub-paths until the shortest path that can inventory all tags is found. The path output function module outputs the shortest path that can inventory all tags.

[0143] In some optional embodiments, the base station constructs a topological map according to at least one of the inventory business demand information, environmental information, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read / write module of the relay node, and the sensitivity of the tag, including: the base station determines the area to be inventoried based on the business demand information and / or environmental information, and divides the area to be inventoried into multiple grids; at least part of the multiple grids include tags to be inventoried; a finite directed graph is formed according to the area to be inventoried including multiple grids, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read / write module of the relay node, and the sensitivity of the tag, and a topological map including the finite directed graph is generated. A topological graph; the finite directed graph includes: a plurality of vertices, an arc connecting two vertices, and a cost corresponding to each arc; wherein, when the first vertex of the arc corresponds to the starting position of the relay node, the cost represents the sum of the number of labels within the signal coverage of the relay node at the starting position and the position corresponding to the second vertex of the arc, and the distance between the position corresponding to the first vertex and the position corresponding to the second vertex; when the first vertex of the arc is not the starting position of the relay node, the cost represents the number of newly added labels or the number of grids containing newly added labels within the signal coverage of the relay node at the position corresponding to the second vertex of the arc, and the distance between the position corresponding to the first vertex and the position corresponding to the second vertex.

[0144] In this embodiment, the environmental information can be obtained through a monitoring camera acquisition system, a lidar, etc.; among them, the environmental information can include information such as the positions of park facilities, obstacles, and items, so as to form relevant information of the area to be inventoried; furthermore, the area to be inventoried is divided into a plurality of grids according to a set rule, where at least some grids may include tags to be inventoried, specifically, refer to Figure 6 as shown.

[0145] In this embodiment, taking the center point of the grid as the vertex, a finite directed graph is formed according to the area to be inventoried containing a plurality of grids, the position of the base station, the transmission power of the base station, the position of the relay node, the transmission power of the reading and writing module of the relay node, and the tag sensitivity. Exemplarily, the finite directed graph can be expressed as: Among them, the finite directed graph includes |N| vertices and |A| arcs (each arc includes two vertices), representing the cost corresponding to the arc. Vertex n i ∈N (i = 0, 1, 2,..., |N| - 1) represents different positions, which are represented by their position coordinates (x, y). Assuming that the number of tags to be inventoried (or the grids containing tags) is M, the cost of the arc (n i , n j ) ∈ A is a non - negative vector where c1 ∈ R + , c2 ∈ R + , 0 < i < j, i ∈ [1, |N|], j ∈ [1, |N|]. Among them, when n i = s, that is, when the first vertex of the arc is the starting position of the relay node, c1 represents the sum of the number of tags (or grids containing tags) within the signal coverage of the relay node at positions s and n j (i.e., the position corresponding to the second vertex of the arc); c2 represents the distance from position n i (i.e., the position corresponding to the first vertex of the arc) to position n j (i.e., the position corresponding to the second vertex of the arc). Otherwise, when n i ≠s, that is, when the first vertex of the arc is not the starting position of the relay node, c1 represents the number of newly added tags (or grids containing newly added tags) covered by the relay node signal at position n j (i.e., the position corresponding to the second vertex of the arc).

[0146] In this embodiment, the base station generates a topological graph containing the finite directed graph, and the topological graph is constructed as Figure 8 shown. Combined with Figure 7As shown in the system function diagram, the topology map generated by the topology map construction function module may include path and label inventory information, wherein the path may specifically refer to vertex information and arc information in a finite directed graph G; the label inventory information may specifically refer to the cost of each arc.

[0147] In some optional embodiments, the forming of a finite directed graph based on the area to be inventoried including multiple grids, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read-write module of the relay node, and the tag sensitivity includes: determining multiple vertices and arcs connecting two vertices in the finite directed graph based on the area to be inventoried including multiple grids; determining a first signal coverage range of the base station based on the location of the base station and the transmission power of the base station, and determining a second signal coverage range of the relay node based on the location of the relay node, the transmission power of the read-write module of the relay node, and the tag sensitivity; determining the cost corresponding to each arc in the finite directed graph based on the first signal coverage range and the second signal coverage range; wherein, when the tag is within the second signal coverage range of the relay node and the relay node is within the first signal coverage range of the base station, it indicates that the tag can be read by the relay node.

[0148] In this embodiment, the base station can calculate the signal coverage of the base station according to the location of the base station and the transmission power of the base station; the signal coverage of the relay node can be calculated according to the location of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity (for example, it may include the grid position and quantity). For example: the line-of-sight range, the relay node coverage radius, etc. are calculated by the Friis transmission formula. When a tag in a grid is within the signal coverage of the relay node at a certain position, and the position is also within the signal coverage of the base station (that is, the base station->relay node->tag link is connected), it is considered that the tag can be read or inventoried. Based on this, the cost corresponding to each arc can be determined.

[0149] Based on this, the problem raised in the embodiment of the present invention can be modeled as a minimum cost path planning problem in a finite directed graph G, that is, finding The path P from the starting position s to the end of inventorying all tags. Further, the base station determines the shortest path that can inventory all tags based on the topological graph containing the finite directed graph G.

[0150] In some optional embodiments, determining the shortest path capable of inventorying all labels based on the topological map includes: generating a set of paths to be expanded including a first element, a second element and a third element based on the topological map, and storing the second element in the set to be expanded; the first element is a starting position, the second element includes the number of inventoried labels and a moving distance from the starting position s to the current position n, and the third element includes the total number of labels and an estimated moving distance from the starting position s to the current position n to all inventoried labels; wherein, during the initialization process, the current position n is the starting position s; selecting the first subpath with the best third element from the set of paths to be expanded, deleting the element corresponding to the first subpath from the set of paths to be expanded, and moving the element corresponding to the first subpath in the set to be expanded to the expanded set; when the relay node cannot completely inventory the first subpath after passing through the first subpath In the case of all labels, the first subpath is extended to obtain at least one second subpath, the element corresponding to the at least one second subpath is added to the set of paths to be extended, and the second element corresponding to the second subpath with the best corresponding second element is stored in the set to be extended, and the corresponding element of the specific second subpath in the set to be extended is deleted, and the specific second subpath is a second subpath whose corresponding third element is worse than the second subpath with the best corresponding second element; in the case that the relay node can inventory all labels through the first subpath and the performance of the first subpath is better than the determined current optimal subpath, the current optimal subpath is updated to the first subpath; repeatedly select the first subpath from the set of paths to be extended and expand the first subpath until the set of paths to be extended is empty; output the shortest path that can inventory all labels based on the extended set.

[0151] In some optional embodiments, adding the elements corresponding to the at least one second sub-path to the set of paths to be expanded includes: calculating the second element corresponding to each second sub-path and the third element corresponding to each second sub-path; adding each second sub-path, the second element of each second sub-path and the third element of each second sub-path to the set of paths to be expanded; wherein the second element includes the number of inventoried tags and the moving distance from the starting position s to the current position m, and the third element includes the total number of tags and the estimated moving distance from the starting position s to the current position m to all the inventoried tags, and the current position m is the subsequent node position of the current position n.

[0152] In some optional embodiments, the expanding the first subpath to obtain at least one second subpath includes: combining each node position m after the current position n with the first subpath respectively to obtain at least one second subpath.

[0153] Before describing in detail the method for determining the shortest path capable of inventorying all tags, the data structure involved in the embodiment of the present invention is described first.

[0154] It is represented by (g1, g2), where g1 and g2 represent the number of inventoried tags and the moving distance of the relay node through the path P (from the starting position s node to the current position n node), respectively.

[0155] It is represented by (h1,h2), where h1 represents the number of tags that have not been inventoried when the relay node reaches node n via path P, and h2 represents the estimated moving distance of the relay node from this state to the state when all tags are inventoried.

[0156] It is represented by (f1, f2), where f1 is equal to the total number of tags M, and f2 represents the estimated moving distance of the relay node through the path P (from the starting position s node to the current position n node) to the inventory of all tags.

[0157] OPEN list: the set of paths to be expanded, i.e., the potential optimal subpaths, each element of which is represents the path P(s,n) from the starting node s to the node n. The path cost is The estimated cost of the optimal path through the subpath P(s,n) is

[0158] G op (n): The cost set of the subpath to be expanded from the starting node s to the node, where each element is

[0159] G cl (n): The set of extended subpath costs from the starting node s to the node, where each element is

[0160] In this embodiment, the OPEN list may be equivalent to the set of paths to be extended in the above embodiment; the second element in the path to be extended may be equivalent to The third element in the path to be expanded can be equivalent to G op (n) may be equivalent to the set to be expanded in the above embodiment; G cl (n) may be equivalent to the expanded set in the above embodiment.

[0161] The specific process includes:

[0162] Step 1: Initialization. Initialize the optimal path P optis empty. P(s,s) is the path containing the starting node. Initialized to (0,0), Initialized to (M, h), where h is the estimated value of the distance to be moved (can be set according to the actual environment), for Will Stored in the set G corresponding to node s op (s). Put it in the list OPEN.

[0163] Among them, the optimal path P opt It can be equivalent to the current optimal subpath.

[0164] Step 2: Select the best subpath. Select from OPEN (Specifically ) the optimal subpath P(s,n) and delete it from OPEN. At the same time, (Specifically ) From the set G to be expanded of node n op (n) Move to the extended set G cl (n).

[0165] Step 3: Expand the subpath.

[0166] Step 3.1: If the relay node has stored all the labels through the path P(s,n), and the performance of this path is better than the optimal path P opt , update P opt is P(s,n), and execute step 4.

[0167] Step 3.2: If the relay node cannot store all the labels through the path P(s,n), then expand the path P(s,n), that is, for each subsequent node m, the path P(s,m) is formed, and calculate the corresponding estimate Calculate the corresponding path P(s,m) for each

[0168] Step 3.3 If is the optimal path (one of them) from the starting point s to the current node m. Stored in the set G corresponding to node m op (m), and delete the paths whose cost to reach node m is worse than the path P(s,m), and delete the corresponding elements in the list OPEN.

[0169] Step 4: Repeat Step 2-Step 4 until the OPEN table is empty.

[0170] Step 5: According to G cl(n) Output the shortest moving path and scheduling inventory plan for all labels starting from the starting point s. Through the above steps, the search subgraph corresponding to the topology graph is obtained.

[0171] In some optional embodiments, determining whether the relay node is required to perform a label inventory operation at the vertex position in the shortest path includes: if a new label is added at the vertex position and within the signal coverage of the relay node, determining that the relay node is required to perform a label inventory operation at the vertex position; if no new label is added at the vertex position and within the signal coverage of the relay node, determining that the relay node is not required to perform a label inventory operation at the vertex position.

[0172] Fig. 9 FIG. 1 is a schematic diagram of an optimal path search subgraph in an inventory method according to an embodiment of the present invention; Fig. 9 As shown, the final search path can be obtained (see Fig. 9 As shown by the bold arrows in the figure) n0→n2→n1→n3→n5. For the optimal path P opt =s→n1→n2…→n k Each arc (n i-1 →n i ), if its cost Middle position n i The number of newly added labels (or grids containing labels) covered by the Agv relay node signal c1 is not 0, and the location needs to be stopped for inventory. Set the corresponding inventory flag t i is 1; otherwise, no inventory operation is performed on this position, and the corresponding inventory flag t is set i is 0. Thus, the shortest path planning and scheduling inventory plan for all labels (s, t0, n1, t1, …, n k ,t k ).

[0173] Based on the above embodiments, an embodiment of the present invention further provides an inventory device, which is applied to a base station. Fig.10 The structure diagram of the inventory device according to the embodiment of the present invention is shown in FIG. Figure 1 ;like Fig.10 As shown, the device includes: a first processing unit 12 and a first communication unit 11; wherein,

[0174] The first processing unit 12 is used to generate inventory information according to at least one of the inventory service demand information, environmental information, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity; the inventory information includes multiple locations to which the relay node is to be moved and information indicating whether to perform a tag inventory operation at each location;

[0175] The first communication unit 11 is used to send instructions to the relay node based on the inventory information, wherein the instructions are used to indicate the location where the relay node moves and whether to perform a label inventory operation at the location; and is also used to receive the inventory label information sent by the relay node.

[0176] In some optional embodiments of the present invention, the first processing unit 12 is used to construct a topology map based on at least one of the inventory business demand information, environmental information, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity; the topology map includes at least a plurality of path information; based on the topology map, the shortest path that can inventory all tags is determined, and whether a relay node is required to perform a tag inventory operation at a vertex position in the shortest path is determined, and inventory information is generated based on the shortest path and whether a relay node is required to perform a tag inventory operation at a node position in the shortest path.

[0177] In some optional embodiments of the present invention, the first processing unit 12 is used to determine the area to be inventoried based on business demand information and / or environmental information, and divide the area to be inventoried into multiple grids; at least some of the multiple grids include labels with inventoried tags; a finite directed graph is formed according to the area to be inventoried including the multiple grids, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity, and a topological graph including the finite directed graph is generated; the finite directed graph includes: multiple vertices, arcs connecting two vertices, and a cost corresponding to each arc; wherein, when the first vertex of the arc corresponds to the starting position of the relay node, the cost represents the sum of the number of labels within the signal coverage range of the relay node at the starting position and the position corresponding to the second vertex of the arc, and the distance between the position corresponding to the first vertex and the position corresponding to the second vertex; when the first vertex of the arc is not the starting position of the relay node, the cost represents the number of newly added labels or the number of grids containing newly added labels within the signal coverage range of the relay node at the position corresponding to the second vertex of the arc, and the distance between the position corresponding to the first vertex and the position corresponding to the second vertex.

[0178] In some optional embodiments of the present invention, the first processing unit 12 is used to determine multiple vertices and arcs connecting two vertices in the finite directed graph according to the area to be inventoried containing multiple grids; determine a first signal coverage range of the base station according to the location of the base station and the transmission power of the base station, and determine a second signal coverage range of the relay node according to the location of the relay node, the transmission power of the read-write module of the relay node, and the tag sensitivity; determine the cost corresponding to each arc in the finite directed graph based on the first signal coverage range and the second signal coverage range; wherein, when the tag is within the second signal coverage range of the relay node and the relay node is within the first signal coverage range of the base station, it indicates that the tag can be read by the relay node.

[0179] In some optional embodiments of the present invention, the first processing unit 12 is used to generate a set of paths to be expanded including a first element, a second element and a third element based on the topological graph, and store the second element in the set to be expanded; the first element is the starting position, the second element includes the number of inventoried labels and the moving distance from the starting position s to the current position n, and the third element includes the total number of labels and the estimated moving distance from the starting position s to the current position n to all inventoried labels; wherein, during the initialization process, the current position n is the starting position s; select the first sub-path with the best third element from the set of paths to be expanded, delete the element corresponding to the first sub-path from the set of paths to be expanded, and move the element corresponding to the first sub-path in the set to be expanded to the expanded set; in the case where the relay node cannot inventory all labels after passing through the first sub-path The first subpath is extended to obtain at least one second subpath, and the elements corresponding to the at least one second subpath are added to the set of paths to be extended, and the second elements corresponding to the second subpath with the best corresponding second element are stored in the set to be extended, and the elements corresponding to the specific second subpath in the set of paths to be extended are deleted, and the specific second subpath is a second subpath whose corresponding third element is worse than the second subpath with the best corresponding second element; when the relay node can inventory all labels through the first subpath and the performance of the first subpath is better than the determined current optimal subpath, the current optimal subpath is updated to the first subpath; repeatedly select the first subpath from the set of paths to be extended and expand the first subpath until the set of paths to be extended is empty; output the shortest path that can inventory all labels based on the extended set.

[0180] In some optional embodiments of the present invention, the first processing unit 12 is used to calculate the cost in each second sub-path and the optimal path estimation cost of each second sub-path; and add each second sub-path, the cost of each second sub-path and the optimal path estimation cost of each second sub-path to the set of paths to be expanded.

[0181] In some optional embodiments of the present invention, the first processing unit 12 is configured to combine each node m after the node n with the first sub-path respectively to obtain at least one second sub-path.

[0182] In some optional embodiments of the present invention, the first processing unit 12 is used to determine that the relay node needs to perform a label inventory operation at the vertex position if a new label is added at the vertex position and within the signal coverage of the relay node; if no new label is added at the vertex position and within the signal coverage of the relay node, determine that the relay node does not need to perform a label inventory operation at the vertex position.

[0183] In some optional embodiments of the present invention, the first communication unit 11 is used to send an instruction to the relay node based on the inventory information, the instruction including the multiple locations and indication information of whether to perform a label inventory operation at each location; or, to send multiple instructions to the relay node in sequence based on the inventory information, each instruction including a location and indication information of whether to perform a label inventory operation at the location.

[0184] In some optional embodiments of the present invention, the first communication unit 11 is used to send a first instruction to the relay node, the first instruction including a first position and indication information of whether the first position performs a label inventory operation; when the received inventory label information indicates that there is no label information, or when the received inventory label information indicates that no new labels continue to be inventoryed, or when it is determined based on the received inventory label information that no new labels continue to be inventoryed, a second instruction is sent to the relay node, the second instruction including a second position and indication information of whether the second position performs a label inventory operation.

[0185] In an embodiment of the present invention, the first processing unit 12 in the device can be implemented by a central processing unit (CPU), a digital signal processor (DSP), a microcontroller unit (MCU) or a programmable gate array (FPGA) in actual applications; the first communication unit 11 in the device can be implemented by a communication module (including: basic communication kit, operating system, communication module, standardized interface and protocol, etc.) and a transceiver antenna in actual applications.

[0186] If necessary, the first processing unit 12 may include Figure 7 The topology graph construction function module, mobile scheduling planning function module and path output function module shown in.

[0187] The embodiment of the present invention further provides an inventory device, which is applied to a relay node. Fig.11 The structure diagram of the inventory device according to the embodiment of the present invention is shown in FIG. Figure 2 ;like Fig.11 As shown, the device includes: a second communication unit 21 and a second processing unit 22; wherein,

[0188] The second communication unit 21 is used to receive an instruction sent by the base station, the instruction is used to indicate the position of the relay node and whether to perform a tag inventory operation at the position; the instruction is sent by the base station based on the inventory information; the inventory information is generated according to at least one of the inventory service demand information, environmental information, the position of the base station, the transmission power of the base station, the position of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity;

[0189] The second processing unit 22 is used to move to the position and perform a tag inventory operation or not perform a tag inventory operation based on the instruction;

[0190] The second communication unit 21 is further configured to send inventory tag information to the base station.

[0191] In some optional embodiments of the present invention, the second processing unit 22 is used to send an inventory instruction through the second communication unit 21 to perform a tag inventory operation until no new tags are found, and determine that the tag inventory is successful.

[0192] In some optional embodiments of the present invention, the inventory instruction includes a first parameter, and the inventory instruction including the first parameter is used to instruct the tag not to respond to the inventory instruction if it receives the inventory instruction again after the inventory has been successfully completed.

[0193] In some optional embodiments of the present invention, the first parameter is a time parameter, and the inventory instruction including the time parameter is used to instruct the tag not to respond to the inventory instruction if it receives the inventory instruction again within the time range of the time parameter when the inventory is successful.

[0194] In some optional embodiments of the present invention, the instruction includes the plurality of locations and indication information of whether to perform a tag inventory operation at each location;

[0195] The second processing unit 22 is configured to move to the plurality of locations in sequence based on the instruction and perform a tag inventory operation or not perform a tag inventory operation at each location.

[0196] In some optional embodiments of the present invention, the second processing unit 22 is used to move to the first position based on the instruction, and if the label inventory operation is not performed at the first position, move to the second position; if the label inventory operation is performed at the first position, send an inventory instruction through the first communication unit to perform the label inventory operation, and move to the second position when it is determined that no new label is to be inventoried based on the identification of the received label.

[0197] In some optional embodiments of the present invention, the instruction includes a location and indication information of whether the location performs a tag inventory operation.

[0198] In an embodiment of the present invention, the second processing unit 22 in the device can be implemented by a CPU, a DSP, an MCU or an FPGA in actual applications; the second communication unit 21 in the device can be implemented by a communication module (including: a basic communication kit, an operating system, a communication module, a standardized interface and protocol, etc.) and a transceiver antenna in actual applications.

[0199] It should be noted that: the inventory device provided in the above embodiment only uses the division of the above program modules as an example to illustrate when performing inventory. In actual applications, the above processing can be assigned to different program modules as needed, that is, the internal structure of the device is divided into different program modules to complete all or part of the above-described processing. In addition, the inventory device provided in the above embodiment and the inventory method embodiment belong to the same concept, and the specific implementation process is detailed in the method embodiment, which will not be repeated here.

[0200] An embodiment of the present invention further provides a communication device, which is a base station or a relay node. Fig.12 FIG. 1 is a schematic diagram of the hardware structure of a communication device according to an embodiment of the present invention. Fig.12As shown, the communication device includes a memory 32, a processor 31, and a computer program stored in the memory 32 and executable on the processor 31. When the processor 31 executes the program, the steps of the inventory method applied to a base station or a relay node according to an embodiment of the present invention are implemented.

[0201] Optionally, the communication device may further include at least one network interface 33. The various components in the communication device are coupled together via a bus system 34. It is understood that the bus system 34 is used to achieve connection and communication between these components. In addition to the data bus, the bus system 34 also includes a power bus, a control bus, and a status signal bus. However, for the sake of clarity, Fig.12 Various buses are labeled as bus system 34 .

[0202] It can be understood that the memory 32 can be a volatile memory or a non-volatile memory, and can also include both volatile and non-volatile memories. Among them, the non-volatile memory can be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), a magnetic random access memory (FRAM), a flash memory, a magnetic surface memory, an optical disk, or a compact disc read-only memory (CD-ROM); the magnetic surface memory can be a disk memory or a tape memory. The volatile memory can be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static random access memory (SRAM), synchronous static random access memory (SSRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDRSDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM, SyncLink Dynamic Random Access Memory), and direct RAM bus random access memory (DRRAM, Direct Rambus Random Access Memory).The memory 32 described in the embodiments of the present invention is intended to include, but is not limited to, these and any other suitable types of memory.

[0203] The method disclosed in the above embodiment of the present invention can be applied to the processor 31, or implemented by the processor 31. The processor 31 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by the hardware integrated logic circuit in the processor 31 or the instruction in the form of software. The above processor 31 can be a general-purpose processor, a DSP, or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. The processor 31 can implement or execute the methods, steps and logic block diagrams disclosed in the embodiment of the present invention. The general-purpose processor can be a microprocessor or any conventional processor, etc. In combination with the steps of the method disclosed in the embodiment of the present invention, it can be directly embodied as a hardware decoding processor to execute, or it can be executed by a combination of hardware and software modules in the decoding processor. The software module can be located in a storage medium, which is located in the memory 32. The processor 31 reads the information in the memory 32 and completes the steps of the above method in combination with its hardware.

[0204] In an exemplary embodiment, the communication device may be implemented by one or more application specific integrated circuits (ASIC), DSP, programmable logic device (PLD), complex programmable logic device (CPLD), FPGA, general purpose processor, controller, MCU, microprocessor, or other electronic components to execute the aforementioned method.

[0205] In an exemplary embodiment, the present invention also provides a computer-readable storage medium, such as a memory 32 including a computer program, which can be executed by a processor 31 of a communication device to complete the steps of the aforementioned method. The computer-readable storage medium can be a memory such as FRAM, ROM, PROM, EPROM, EEPROM, Flash Memory, magnetic surface memory, optical disk, or CD-ROM; or it can be various devices including one or any combination of the above memories.

[0206] The computer-readable storage medium provided by the embodiment of the present invention stores a computer program, which, when executed by a processor, implements the steps of the inventory method applied in a base station or a relay node by the embodiment of the present invention.

[0207] The embodiment of the present application also provides a computer program product, including a computer program, which can be executed by a communication device (such as the processor 31 of the communication device) to complete the steps of any of the aforementioned inventory methods.

[0208] The methods disclosed in several method embodiments provided in this application can be arbitrarily combined without conflict to obtain new method embodiments.

[0209] The features disclosed in several product embodiments provided in this application can be arbitrarily combined without conflict to obtain new product embodiments.

[0210] The features disclosed in several method or device embodiments provided in this application can be arbitrarily combined without conflict to obtain new method embodiments or device embodiments.

[0211] In the several embodiments provided in the present application, it should be understood that the disclosed devices and methods can be implemented in other ways. The device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as: multiple units or components can be combined, or can be integrated into another system, or some features can be ignored or not executed. In addition, the coupling, direct coupling, or communication connection between the components shown or discussed can be through some interfaces, and the indirect coupling or communication connection of the devices or units can be electrical, mechanical or other forms.

[0212] The units described above as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units; some or all of the units may be selected according to actual needs to achieve the purpose of the present embodiment.

[0213] In addition, all functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may be separately used as a unit, or two or more units may be integrated into one unit; the above-mentioned integrated units may be implemented in the form of hardware or in the form of hardware plus software functional units.

[0214] A person of ordinary skill in the art can understand that: all or part of the steps of implementing the above-mentioned method embodiment can be completed by hardware related to program instructions, and the aforementioned program can be stored in a computer-readable storage medium, which, when executed, executes the steps of the above-mentioned method embodiment; and the aforementioned storage medium includes: various media that can store program codes, such as mobile storage devices, ROM, RAM, disks or optical disks.

[0215] Alternatively, if the above-mentioned integrated unit of the present invention is implemented in the form of a software function module and sold or used as an independent product, it can also be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present invention can be essentially or partly reflected in the form of a software product that contributes to the prior art. The computer software product is stored in a storage medium and includes several instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the methods described in each embodiment of the present invention. The aforementioned storage medium includes: various media that can store program codes, such as mobile storage devices, ROM, RAM, magnetic disks or optical disks.

[0216] The above is only a specific embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed by the present invention, which should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention should be based on the protection scope of the claims.

Claims

1. An inventory method, characterized in that: The method is applied to a base station; the method comprises: The base station generates inventory information according to at least one of inventory service demand information, environmental information, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity; the inventory information includes a plurality of locations to which the relay node is to be moved and information indicating whether a tag inventory operation is performed at each location; sending an instruction to the relay node based on the inventory information, the instruction being used to indicate a location where the relay node moves and whether to perform a label inventory operation at the location; The inventory tag information sent by the relay node is received.

2. The method according to claim 1, characterized in that The base station generates inventory information according to at least one of the inventory service demand information, environmental information, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity, including: The base station constructs a topology map according to at least one of the inventory service demand information, environmental information, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity; the topology map includes at least a plurality of path information; Based on the topological graph, the shortest path capable of taking inventory of all labels is determined, and whether a relay node is required to perform a label inventory operation at a vertex position in the shortest path is determined; and inventory information is generated based on the shortest path and whether a relay node is required to perform a label inventory operation at a node position in the shortest path.

3. The method according to claim 2, characterized in that The base station constructs a topology map according to at least one of the inventory service demand information, environmental information, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity, including: The base station determines the area to be inventoried based on the service demand information and / or the environment information, and divides the area to be inventoried into a plurality of grids; at least some of the plurality of grids include tags to be inventoried; A finite directed graph is formed according to the area to be inventoried including multiple grids, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity, and a topological graph including the finite directed graph is generated; the finite directed graph includes: multiple vertices, arcs connecting two vertices, and a cost corresponding to each arc; Wherein, when the first vertex of the arc corresponds to the starting position of the relay node, the cost represents the sum of the number of labels within the signal coverage range of the relay node at the starting position and the position corresponding to the second vertex of the arc, and the distance between the position corresponding to the first vertex and the position corresponding to the second vertex; When the first vertex of the arc is not the starting position of the relay node, the cost represents the number of new labels or the number of grids containing new labels within the signal coverage range of the relay node at the position corresponding to the second vertex of the arc, and the distance between the corresponding position of the first vertex and the corresponding position of the second vertex.

4. The method according to claim 3, characterized in that The forming of a finite directed graph according to the area to be inventoried including multiple grids, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity includes: Determine a plurality of vertices and arcs connecting two vertices in the finite directed graph according to the area to be inventoried that includes a plurality of grids; Determine a first signal coverage range of the base station according to the location of the base station and the transmission power of the base station, and determine a second signal coverage range of the relay node according to the location of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity; The cost corresponding to each arc in the finite directed graph is determined based on the first signal coverage range and the second signal coverage range; wherein, when the tag is within the second signal coverage range of the relay node and the relay node is within the first signal coverage range of the base station, it indicates that the tag can be read by the relay node.

5. The method according to any one of claims 2 to 4, characterized in that: The determining, based on the topology graph, the shortest path capable of storing all labels includes: Based on the topological graph, a set of paths to be extended is generated, including a first element, a second element and a third element, and the second element is stored in the set to be extended; the first element is a starting position, the second element includes the number of inventoried tags and the moving distance from the starting position s to the current position n, and the third element includes the total number of tags and the estimated moving distance from the starting position s to the current position n to all inventoried tags; wherein, during the initialization process, the current position n is the starting position s; Selecting a first subpath with the best corresponding third element from the set of paths to be extended, deleting the element corresponding to the first subpath from the set of paths to be extended, and moving the element corresponding to the first subpath in the set to be extended to the extended set; In the case that the relay node cannot inventory all labels after passing through the first subpath, the first subpath is expanded to obtain at least one second subpath, an element corresponding to the at least one second subpath is added to the set of paths to be expanded, and a second element corresponding to the second subpath with the best corresponding second element is stored in the set to be expanded, and an element corresponding to a specific second subpath in the set of paths to be expanded is deleted, where the specific second subpath is a second subpath with a corresponding third element worse than that of the second subpath with the best corresponding second element; If the relay node can store all labels through the first subpath and the performance of the first subpath is better than the determined current optimal subpath, updating the current optimal subpath to the first subpath; Repeating the steps of selecting a first sub-path from the set of paths to be extended and extending the first sub-path until the set of paths to be extended is empty; The shortest path capable of inventorying all tags is output based on the expanded set.

6. The method according to claim 5, characterized in that The adding the element corresponding to the at least one second sub-path to the set of paths to be extended includes: Calculate the second element corresponding to each second subpath and the third element corresponding to each second subpath; add each second subpath, the second element of each second subpath and the third element of each second subpath to the set of paths to be expanded; wherein the second element includes the number of inventoried tags and the moving distance from the starting position s to the current position m, and the third element includes the total number of tags and the estimated moving distance from the starting position s to the current position m to all inventoried tags, and the current position m is the subsequent node position of the current position n.

7. The method according to claim 5, characterized in that The step of extending the first subpath to obtain at least one second subpath includes: Each node position m after the current position n is respectively combined with the first sub-path to obtain at least one second sub-path.

8. The method according to claim 3, characterized in that The determining whether a relay node is required to perform a label inventory operation at a vertex position in the shortest path includes: If a new label is added at the vertex position and within the signal coverage of the relay node, it is determined that the relay node is required to perform a label inventory operation at the vertex position; If no new label is added at the vertex position and within the signal coverage of the relay node, it is determined that the relay node is not required to perform a label inventory operation at the vertex position.

9. The method according to any one of claims 1 to 4, characterized in that: The sending an instruction to the relay node based on the inventory information includes: The base station sends an instruction to the relay node based on the inventory information, where the instruction includes the multiple locations and indication information of whether to perform a label inventory operation at each location; or, The base station sends a plurality of instructions to the relay node in sequence based on the inventory information, each instruction including a location and indication information of whether the location performs a label inventory operation.

10. The method according to claim 9, characterized in that The base station sends a plurality of instructions to the relay node in sequence based on the inventory information, including: The base station sends a first instruction to the relay node, where the first instruction includes a first position and indication information of whether to perform a label inventory operation at the first position; When the received inventory label information indicates that there is no label information, or when the received inventory label information indicates that no new labels continue to be inventoried, or when it is determined based on the received inventory label information that no new labels continue to be inventoried, a second instruction is sent to the relay node, wherein the second instruction includes a second position and indication information of whether the second position performs a label inventory operation.

11. An inventory method, characterized in that: The method is applied to a relay node, and the method comprises: The relay node receives an instruction sent by the base station, the instruction is used to indicate the position of the relay node and whether to perform a tag inventory operation at the position; the instruction is sent by the base station based on inventory information; the inventory information is generated according to at least one of inventory service demand information, environmental information, the position of the base station, the transmission power of the base station, the position of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity; Move to the location and perform a tag inventory operation or not perform a tag inventory operation based on the instruction; The inventory tag information is sent to the base station.

12. The method according to claim 11, characterized in that The performing of the tag inventory operation includes: The relay node sends an inventory instruction to perform a label inventory operation until no new labels are found, thereby determining that the label inventory is successful.

13. The method according to claim 12, characterized in that The inventory instruction includes a first parameter, and the inventory instruction including the first parameter is used to instruct the tag not to respond to the inventory instruction if it receives the inventory instruction again after the inventory has been successfully performed.

14. The method according to claim 13, characterized in that The first parameter is a time parameter. The inventory instruction including the time parameter is used to instruct the tag not to respond to the inventory instruction if the inventory instruction is received again within the time range of the time parameter when the inventory is successful.

15. The method according to claim 11, characterized in that The instruction includes the plurality of locations and indication information of whether to perform a tag inventory operation at each location; The step of moving to the location based on the instruction and performing a tag inventory operation or not performing a tag inventory operation comprises: The relay node sequentially moves to the plurality of locations based on the instruction and performs a tag inventory operation or does not perform a tag inventory operation at each location.

16. The method according to claim 15, characterized in that The relay node sequentially moves to the plurality of locations based on the instruction and performs a label inventory operation or does not perform a label inventory operation at each location, including: The relay node moves to the first position based on the instruction, and if the label inventory operation is not performed at the first position, it moves to the second position; if the label inventory operation is performed at the first position, it sends an inventory instruction to perform the label inventory operation, and moves to the second position when it is determined that no new label is being inventoried based on the identification of the received label.

17. The method according to claim 11, characterized in that The instruction includes a location and indication information of whether the location performs a tag inventory operation.

18. An inventory device, characterized in that: The device is applied to a base station, and comprises: a first processing unit and a first communication unit; wherein, The first processing unit is used to generate inventory information according to at least one of the inventory service demand information, environmental information, the location of the base station, the transmission power of the base station, the location of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity; the inventory information includes multiple locations to which the relay node is to be moved and information indicating whether to perform a tag inventory operation at each location; The first communication unit is used to send an instruction to the relay node based on the inventory information, wherein the instruction is used to indicate the location where the relay node moves and whether to perform a label inventory operation at the location; and is also used to receive the inventory label information sent by the relay node.

19. An inventory device, characterized in that: The device is applied to a relay node, and comprises: a second communication unit and a second processing unit; wherein, The second communication unit is used to receive an instruction sent by the base station, the instruction is used to indicate the position of the relay node and whether to perform a tag inventory operation at the position; the instruction is sent by the base station based on the inventory information; the inventory information is generated according to at least one of the inventory service demand information, environmental information, the position of the base station, the transmission power of the base station, the position of the relay node, the transmission power of the read / write module of the relay node, and the tag sensitivity; The second processing unit is configured to move to the location and perform or not perform a tag inventory operation based on the instruction; The second communication unit is further configured to send inventory tag information to the base station.

20. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the steps of the method described in any one of claims 1 to 10 are implemented; or, when the program is executed by a processor, the steps of the method described in any one of claims 11 to 17 are implemented.

21. A communication device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, the steps of the method described in any one of claims 1 to 10 are implemented; or, when the processor executes the program, the steps of the method described in any one of claims 11 to 17 are implemented.

22. A computer program product, characterized in that The method comprises computer program instructions, which enable a computer to execute the steps of the method according to any one of claims 1 to 10; or, the computer program instructions enable a computer to execute the steps of the method according to any one of claims 11 to 17.

Images