US-12619891-B2 - Method and apparatus for autonomous decision of network node

US12619891B2US 12619891 B2US12619891 B2US 12619891B2US-12619891-B2

Abstract

Embodiments of the present disclosure relate to a method and an apparatus for an autonomous decision of network node. A method performed at a first network node may comprise: broadcasting a solution for a task to a network; and performing the solution, when a plurality of verification results about the solution satisfy a predetermined condition. The plurality of verification results may be from a plurality of second network nodes in the network. According to embodiments of the present disclosure, the collaboration level between different network nodes for decision of how to operate is improved.

Inventors

Zhancang Wang

Assignees

TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)

Dates

Publication Date: 20260505
Application Date: 20190805

Claims (19)

1 . A method performed at a first network node, comprising: broadcasting a solution for a task to a network; and performing the solution, when a plurality of verification results about the solution satisfy a predetermined condition; wherein the plurality of verification results is from a plurality of second network nodes in the network; wherein the first network node is an autonomous robot for taking a decision via a consensus mechanism of a distributed ledger; and wherein the solution is based on a predetermined robotic rule set, RRS, defining allowable node behaviors for the first network node.
2 . The method according to claim 1 , wherein the predetermined condition is defined via a consensus mechanism developed in the network; and wherein the consensus mechanism complies with a byzantine protocol.
3 . The method according to claim 2 , wherein the predetermined condition comprises that a proportion of second network nodes which give a positive verification result in the network is equal to or greater than a predetermined value.
4 . The method according to claim 3 , wherein the predetermined value is ⅔.
5 . The method according to claim 1 , wherein a second network node in the plurality of second network nodes verifies the solution, based on a predetermined robotic rule set, defining allowable node behaviors for the second network node; and/or wherein the first network node proposes the solution for the task, based on a predetermined robotic rule set, defining allowable node behaviors for the first network node.
6 . The method according to claim 1 , wherein the predetermined robotic rule set comprises at least one of: a plan tree, configured to identify a current plan and a state of the first network node; a solver result, including a consensus result obtained from a distributed ledger; a synchronization, including a handshake among other network nodes; an allocation authority, including a conflict resolution for a task which is sent by robotic nodes to ensure that a solution with majority positive verification results resolves the conflict; and a role switch, which happens when the first network node changes its role during runtime.
7 . The method according to claim 1 , wherein the first network node comprises at least one of: a logistics robotic, an inspection robotic, a vehicle, or an emergency detection or response robotic.
8 . A method performed at a second network node, comprising: receiving, from a network, a solution for a task of a first network node; verifying the solution; and broadcasting a verification result to the network; wherein the solution is performed by the first network node, when a plurality of verification results about the solution satisfy a predetermined condition; wherein the plurality of verification results is from a plurality of second network nodes in the network; wherein the first network node is an autonomous robot for taking a decision via a consensus mechanism of a distributed ledger; and wherein the solution is based on a predetermined robotic rule set, RRS, defining allowable node behaviors for the first network node.
9 . The method according to claim 8 , wherein the predetermined condition is defined via a consensus mechanism developed in the network; and wherein the consensus mechanism complies with a byzantine protocol.
10 . The method according to claim 9 , wherein the predetermined condition comprises that a proportion of second network nodes which give a positive verification result in the network is equal to or greater than a predetermined value.
11 . The method according to claim 10 , wherein the predetermined value is ⅔.
12 . The method according to claim 8 , wherein the second network node verifies the solution, based on a historical record about a solution to the same task; and wherein the historical record about the solution to the same task comprises a set of criteria for computing out the solution to the task.
13 . The method according to claim 12 , wherein the historical record is stored in a distributed ledger in the network; and wherein the distributed ledger comprises a serial data structure, or a parallel data structure.
14 . The method according to claim 13 , wherein the serial data structure comprises a plurality of data blocks linked in a chain; or wherein the parallel data structure is based on a directed acyclic graph.
15 . The method according to claim 8 , wherein the second network node verifies the solution, based on a predetermined robotic rule set, defining allowable node behaviors for the second network node; and/or wherein the first network node proposes the solution for the task, based on a predetermined robotic rule set, defining allowable node behaviors for the first network node.
16 . The method according to claim 8 , wherein the predetermined robotic rule set comprises at least one of: a plan tree, configured to identify a current plan and a state of the first network node; a solver result, including a consensus result obtained from a distributed ledger; a synchronization, including a handshake among other network nodes; an allocation authority, including a conflict resolution for a task which is sent by robotic nodes to ensure that a solution with majority positive verification results resolves the conflict; and a role switch, which happens when the first network node changes its role during runtime.
17 . The method according to claim 8 , wherein the second network node comprises at least one of: a logistics robotic, an inspection robotic, a vehicle, or an emergency detection or response robotic.
18 . An apparatus for a first network node, comprising: a processor; and a memory, containing instructions executable by the processor; wherein the first network node is operative to: broadcast a solution for a task to a network; and perform the solution, when a plurality of verification results about the solution satisfy a predetermined condition; wherein the plurality of verification results is from a plurality of second network nodes in the network; wherein the first network node is an autonomous robot for taking a decision via a consensus mechanism of a distributed ledger; and wherein the solution is based on a predetermined robotic rule set, RRS, defining allowable node behaviors for the first network node.
19 . An apparatus for a second network node, comprising: a processor; and a memory, containing instructions executable by the processor; wherein the second network node is operative to: receive, from a network, a solution for a task of a first network node; verify the solution; and broadcast a verification result to the network; wherein the solution is performed by the first network node, when a plurality of verification results about the solution satisfy a predetermined condition; and wherein the plurality of verification results is from a plurality of second network nodes in the network; wherein the first network node is an autonomous robot for taking a decision via a consensus mechanism of a distributed ledger; and wherein the solution is based on a predetermined robotic rule set, RRS, defining allowable node behaviors for the first network node.

Description

This application is a 35 U.S.C. § 371 national phase filing of International Application No. PCT/CN2019/099301, filed Aug. 5, 2019, the disclosure of which is incorporated herein by reference in its entirety. TECHNICAL FIELD The present disclosure relates generally to the technology of autonomous decision, and in particular, to a method and an apparatus for an autonomous decision of a network node. BACKGROUND This section introduces aspects that may facilitate better understanding of the present disclosure. Accordingly, the statements of this section are to be read in this light and are not to be understood as admissions about what is in the prior art or what is not in the prior art. With the development of technology of automation and communication, more and more robotics are connected with each other via a communication network, so as to form a robotics system. In such a robotics system, e.g. a swarm robotics system, a network node may be able to sense the circumstance and decide how to operate according to the situation of the circumstance. For the decision of how to operate, a locally stored algorithm of the network node may be used. The situation of the circumstance will be an input to the algorithm and an operation manner of the network node will be the corresponding output from the algorithm. Alternatively, the network node may report the situation of the circumstance of itself to a center server/management node, and get an operation instruction directly from the center server/management node. However, it is hard for the network node to get support/information from other network nodes during making decision of how to operate. Namely, the collaboration level may need to be further improved. SUMMARY This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the detailed description. This summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter. Certain aspects of the present disclosure and their embodiments may provide solutions to these or other challenges. There are, proposed herein, various embodiments which address one or more of the issues disclosed herein. A first aspect of the present disclosure provides a method performed at a first network node, comprising: broadcasting a solution for a task to a network; and performing the solution, when a plurality of verification results about the solution satisfy a predetermined condition. The plurality of verification results is from a plurality of second network nodes in the network. In embodiments of the present disclosure, the predetermined condition may be defined via a consensus mechanism developed in the network. In embodiments of the present disclosure, the consensus mechanism may comply with a byzantine protocol. In embodiments of the present disclosure, the predetermined condition may comprise that a proportion of second network nodes which give a positive verification result in the network is equal to or greater than a predetermined value. In embodiments of the present disclosure, the predetermined value may be ⅔. In embodiments of the present disclosure, the predetermined condition may comprise that a number of second network nodes which give a positive verification result is equal to or greater than a predetermined value. In embodiments of the present disclosure, a second network node in the plurality of second network nodes may verify the solution, based on a historical record about a solution to the same task. In embodiments of the present disclosure, the historical record about the solution to the same task may comprise a set of criteria for computing out the solution to the task. In embodiments of the present disclosure, the historical record may be stored in a distributed ledger in the network. In embodiments of the present disclosure, the distributed ledger may comprise a serial data structure, or a parallel data structure. In embodiments of the present disclosure, the serial data structure may comprise a plurality of data blocks linked in a chain. In embodiments of the present disclosure, the parallel data structure may be based on a directed acyclic graph. In embodiments of the present disclosure, a second network node in the plurality of second network nodes may verify the solution, based on a predetermined robotic rule set, defining allowable node behaviors for the second network node. In embodiments of the present disclosure, the first network node may propose the solution for the task, based on a predetermined robotic rule set, defining allowable node behaviors for the first network node. In embodiments of the present disclosure, the predetermined robotic rule set may comprise at least one of: a plan tree, configured to identify a current plan and a state of the first network node; a solver result, including a consensus result obtained from a distribu