Information processing device, information processing method, and program

By analyzing resource sharing possibilities and node availability in the network system and dynamically setting the quorum configuration, the availability problem of traditional protocol algorithms in unstable communication environments in mobile robot networks is solved, and the stability and efficiency of protocol formation are improved.

CN118922794AInactive Publication Date: 2024-11-08SONY GROUP CORP
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202380026150.7
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2022-03-16
Filing Date
2023-02-22
Publication Date
2024-11-08
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

In network systems containing mobile robots, traditional protocol algorithms are difficult to maintain high availability in unstable communication environments, especially when wireless communication and physical resource allocation are mutually exclusive, deadlocks and communication interrupts are prone to occur, resulting in protocol errors .

Method used

By introducing analysis units into the network system to evaluate resource sharing possibilities, node availability, and task execution optimization issues, and setting a dynamic quorum configuration based on these analysis results, ensuring that the node groups formed by the protocol can be maintained in mobile and wireless communication environments Stable and efficient.

Benefits of technology

It improves the availability and stability of protocol algorithms in network systems, reduces the risks of deadlocks and communication interruptions, and ensures the success rate and efficiency of task execution.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118922794A_ABST
    Figure CN118922794A_ABST
Patent Text Reader

Abstract

A robot (10) is an information processing device that is one of a plurality of nodes in a network system (1) including nodes. The robot includes: an analysis unit (16b) that analyzes a likelihood of ensuring resources shared by nodes, availability of each node, and an optimization problem related to task execution; and a quorum number configuration setting unit (16c) (corresponding to one example of the setting unit) that sets a group of nodes participating in protocol establishment in the network system (1) on the basis of at least one of the analysis results obtained by the analysis unit (16b).
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to an information processing device, an information processing method, and a program. Background Art

[0002] “Paxos,” “Raft,” and the like are known as protocol algorithms for forming a protocol between nodes in distributed computing of a network system including a plurality of nodes capable of communication.

[0003] "Paxos" and "Raft" have a concept called quorum (for example, see Non-Patent Document 1). Quorum is a concept obtained by generalizing majority decision and includes majority decision. Acceptors are collected into a group called quorum as described above. In the Paxos protocol, an acceptor is a node that acts as a fault-tolerant "storage".

[0004] In the Paxos protocol, the client seeks agreement from all acceptors that are part of a quorum, and when all acceptors agree, the requested action can be performed. Today, many agreement algorithms implemented by common database software in network systems implement quorum.

[0005] Reference List

[0006] Non-patent literature

[0007] Non-patent document 1: [Online], ETH Zurich, [search date February 21, 2022], Internet<URL:https: / / disco.ethz.ch / courses / podc_allstars / lecture / chapter19.pdf> Summary of the invention

[0008] Technical issues

[0009] However, the above conventional technologies still have room for further improvement in order to further improve the availability of protocol algorithms in network systems.

[0010] For example, suppose a network system includes multiple robots that can move in real space. When multiple robots that can perform slightly advanced tasks share resources, there is a risk of deadlock if no agreement is reached between the robots on the securing and releasing of resources, so an agreement algorithm is necessary.

[0011] However, note that when each robot can move, the network communication required to form the protocol may not always be stable. In particular, in wireless communication, the connection may be unstable or communication may not be possible at a certain location.

[0012] Note that although the protocol algorithm has prepared a mechanism to prevent the formation of an erroneous protocol even in an environment with unstable communications, such a mechanism is usually implemented by optimizing the above-mentioned common database software for a common client-server model environment.

[0013] Furthermore, when including mobile robots, physical resources need to be considered that cannot be assumed according to common client-server model environments, such as passages and elevators for robot movement.

[0014] Therefore, the present disclosure proposes an information processing device, an information processing method, and a program that can further improve the usability of a protocol algorithm in a network system.

[0015] Solution to the problem

[0016] In order to solve the above-mentioned problems, one aspect of the information processing device according to the contents of the present disclosure is the following information processing device, which is one of the nodes in a network system including multiple nodes, and the information processing device includes: an analysis unit, which analyzes each of the following: the possibility of ensuring resources shared by the nodes, the availability of each node, and the optimization issues related to task execution; and a setting unit, which sets the group of nodes participating in the formation of a protocol in the network system based on at least one of the analysis results from the analysis unit. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] Figure 1 It is a schematic diagram for explaining an information processing method according to an embodiment of the present disclosure.

[0018] Figure 2 A configuration example of a network system according to an embodiment of the present disclosure is shown.

[0019] Figure 3 is a block diagram of a configuration example of a robot according to an embodiment of the present disclosure.

[0020] Figure 4 This is an illustration of the quorum configuration (part 1).

[0021] Figure 5 This is an illustration of the quorum configuration (part 2).

[0022] Figure 6 The relationship between the probability of securing a resource and the weight is shown.

[0023] Figure 7 An example of a case where there is a high possibility of securing a resource is shown.

[0024] Figure 8 The relationship between the availability and weight of each node is shown.

[0025] Fig. 9 An example of a case where each node has high availability is shown.

[0026] Fig.10 An example of a case where a quorum configuration is selected so that an objective function is maximized or minimized according to analysis results on an optimization problem related to task execution is shown.

[0027] Fig.11 is an explanatory diagram of the analysis of an optimization problem considering tasks that have not yet been scheduled.

[0028] Fig.12 is a flow chart showing the processing steps performed by the robot.

[0029] Fig.13 A configuration example of a network system according to a modification is shown.

[0030] Fig.14 An example of a case where each node has high availability in a network system according to a modification is shown.

[0031] Fig.15 is a hardware configuration diagram showing one example of a computer that realizes the functions of a robot. DETAILED DESCRIPTION

[0032] Embodiments of the present disclosure will be described in detail below with reference to the accompanying drawings. Note that in the following embodiments, the same reference numerals are attached to the same parts to omit repeated descriptions.

[0033] Furthermore, in the following description, the information processing device according to the embodiment of the present disclosure corresponds to the robot 10 or the server device 100 included in the network system 1 which will be described later.

[0034] In addition, in the following description, a plurality of components having substantially the same functional configuration may be distinguished by appending different numerals with hyphens after the same reference numeral. For example, a plurality of components having substantially the same functional configuration may be distinguished as robot 10-1, robot 10-2, ... as needed. However, note that when there is no need to particularly distinguish a plurality of components having substantially the same functional configuration, only the same reference numeral is appended. For example, when there is no need to particularly distinguish robot 10-1, robot 10-2, ... from each other, robot 10-1, robot 10-2, ... are simply described as robot 10.

[0035] Furthermore, in the following description, a quorum mechanism is implemented in a protocol algorithm in distributed computing of a network system.

[0036] Furthermore, in the following description, “node” includes all elements that can participate in a quorum, such as the robot 10 , the server device 100 , each process of the robot 10 and the server device 100 , or a service on the Internet.

[0037] Furthermore, the present disclosure will be described in the following item order.

[0038] 1. Overview

[0039] 2. Network system configuration

[0040] 3. Robot configuration

[0041] 4. Variant

[0042] 4-1. Including server device

[0043] 4-2. When the status of each node changes

[0044] 4-3. Other variants

[0045] 5. Hardware Configuration

[0046] 6. Conclusion

[0047] <<1.Overview>>

[0048] Figure 1 1 is a schematic diagram of an information processing method according to an embodiment of the present disclosure. When a network system includes a plurality of robots that can move in a real space, various factors need to be considered to optimize the implementation of a quorum. The various factors include the distribution and mutual exclusion of physical resources such as passages and elevators shared by the robots, and the robot communication quality that tends to be unstable due to mobility.

[0049] Specifically, if Figure 1 As shown, in the embodiment of the present disclosure, it is assumed that the network system 1 includes a plurality of robots 10 - 1 , 10 - 2 , 10 - 3 , . . . which can move in a real space as nodes.

[0050] The robots 10 are dispersed on a plurality of floors of a building (see "Nth floor" and "N+1th floor" in the figure). The robots 10 perform their own tasks while allocating and mutually excluding various resources including physical resources such as passages a1 and a2 and elevator e1. That is, at least one of the robots 10 can also move between floors via the elevator e1.

[0051] In the above network system 1, in the implementation of optimizing the quorum, it is necessary to consider the allocation and mutual exclusion of physical resources such as channels a1 and a2 and elevator e1 in addition to the logical resources such as data in the database and memory shared by the robots 10. In addition, it is also necessary to consider the communication quality between the robots 10 separated by floors.

[0052] Therefore, if Figure 1 As shown, in the information processing method according to the implementation of the contents of the present disclosure, each robot 10 performing a task analyzes the possibility of ensuring resources, the availability of each node, and the optimization problems related to task execution, and sets the configuration of the quorum Q based on at least one of the analysis results.

[0053] In one example, for example, the robot 10-3 often moves between floors via the elevator e1. Then, in configuring the quorum for task execution regarding the robot 10-1, since the robot 10-3 often moves in an environment where communication is easily interrupted, the robot 10-1 determines that the robot 10-3 has low availability and reduces the weight of the robot 10-3.

[0054] Therefore, for example, the robot 10 - 1 sets a configuration of a quorum Q including the robot 10 - 1 and the robot 10 - 2 .

[0055] This can further improve the usability of the protocol algorithm in the network system 1 including the mobile object as a node. Figure 6 and Figure 7 A specific example of the analysis process regarding the possibility of securing resources is described below. Figure 8 and Fig. 9 A specific example of analysis processing regarding the availability of each node is described.

[0056] In addition, we will refer to Fig.10 and Fig.11 A specific example of the analysis process of the optimization problem related to task execution is described. Note that, for illustration purposes, in the analysis process of the optimization problem related to task execution, the robot 10 selects a quorum configuration so that the objective function related to task execution is maximized or minimized.

[0057] A configuration example of the network system 1 to which the information processing method according to an embodiment of the present disclosure is applied will be specifically described below.

[0058] <<2. Network system configuration>>

[0059] Figure 2 FIG. 1 shows a configuration example of a network system 1 according to an embodiment of the present disclosure. Figure 2As shown, the network system 1 includes a plurality of robots 10 , namely, a robot 10 - 1 to a robot 10 - n (n is a natural number).

[0060] The robot 10 includes a moving mechanism 13 (see Figure 3 ), and can move at least autonomously or non-autonomously. In addition, the robot 10 is based on the task information 15a (see Figure 3 ) perform the tasks assigned to them.

[0061] Furthermore, the robots 10 may wirelessly communicate with each other via a network N or directly wirelessly communicate with each other. The network N includes, for example, a local area network, the Internet, a mobile phone network, and a short-range wireless communication network.

[0062] Note that since each robot 10 moves in the network system 1 , it is assumed that communication between the robots 10 is not always stable.

[0063] <<3. Robot Configuration>>

[0064] Next, Figure 3 is a block diagram showing a configuration example of the robot 10 according to an embodiment of the present disclosure. Note that Figure 3 Only components necessary to describe the features of the embodiments of the present disclosure are shown, and description of common components is omitted.

[0065] In other words, Figure 3 The components in the figure are functional and conceptual, and are not necessarily required to be physically configured as shown. For example, the specific form of distribution / integration of each block is not limited to the form shown, and all blocks or part of the blocks can be configured in a functionally or physically distributed / integrated manner in any unit according to various loads and usage conditions.

[0066] In addition, in reference Figure 3 In the description of the present invention, descriptions of already described components may be simplified or omitted.

[0067] like Figure 3 As shown, the robot 10 includes a sensor unit 11 , a robot mechanism 12 , a moving mechanism 13 , a communication unit 14 , a storage unit 15 , and a control unit 16 .

[0068] The sensor unit 11 is constituted by a group of various sensors mounted on the robot 10. The sensor unit 11 senses conditions inside and outside the robot 10. The sensor unit 11 includes, for example, a camera, a global positioning system (GPS) sensor, and an inertial sensor.

[0069] The robot mechanism 12 includes various mechanisms for the robot 10 to perform tasks. For example, the robot mechanism 12 includes a manipulator. The moving mechanism 13 is used to move the robot 10. The control unit 16 controls the robot mechanism 12 and the moving mechanism 13 according to the task performed by the robot 10 when the task is performed.

[0070] The communication unit 14 is implemented by, for example, a wireless communication module. The communication unit 14 is directly and wirelessly connected to the above-mentioned network N or another robot 10. The communication unit 14 transmits information to or receives information from other robots 10.

[0071] For example, the storage unit 15 is implemented by a semiconductor memory element such as a random access memory (RAM), a read only memory (ROM), and a flash memory, or a storage device such as a hard disk and an optical disk. Figure 3 In the example in , the storage unit 15 stores task information 15a, node information 15b, resource information 15c, quorum configuration information 15d, protocol status information 15e, and performance information 15f.

[0072] The task information 15a is related to the task performed by the robot 10. The task information 15a includes the execution date and time, execution location, and execution content of the task. The node information 15b is related to each node included in the network system 1. The node information 15b includes information on the attributes of each node.

[0073] The resource information 15c is related to each resource included in the network system 1 and shared by the robot 10. The node information 15b and the resource information 15c are dynamically updated according to the performance of the task execution of the robot 10. For example, the robot 10 updates the current position of the host node included in the node information 15b and the information on the resources occupied or released by the host node included in the resource information 15c according to the performance of the task execution.

[0074] The quorum configuration information 15d is related to the quorum configuration set by the robot 10. The quorum configuration information 15d includes the network address of each node belonging to the set quorum.

[0075] The protocol status information 15e includes the real-time protocol status in the quorum processing. The performance information 15f is related to the performance of the task executed by the robot 10. In addition to the performance of the task execution, the performance information 15f also includes whether an agreement has been formed in the quorum in the task execution and the communication performance with other nodes.

[0076] Note that by forming an agreement on a write request to each node belonging to the set quorum or a read request from one of the nodes and executing the request, various information 15a to 15f stored in the storage unit 15 and each data included therein can be shared between nodes.

[0077] The control unit 16 is a controller and is implemented by, for example, a central processing unit (CPU) and a micro processing unit (MPU) executing a program (not shown) according to an embodiment of the present disclosure stored in the storage unit 15 using a RAM as a work area. In addition, the control unit 16 may be implemented by an integrated circuit such as an application specific integrated circuit (ASIC) or a field programmable gate array (FPGA).

[0078] The control unit 16 includes an acquisition unit 16a, an analysis unit 16b, a quorum configuration setting unit 16c, a protocol formation processing unit 16d, a quorum processing unit 16e, and a task execution unit 16f. The control unit 16 implements or executes the functions and actions of information processing as described below.

[0079] The acquisition unit 16a acquires various sensor data output from the sensor unit 11. Furthermore, the acquisition unit 16a acquires information on a task that the robot 10 is to perform next from the task information 15a.

[0080] The analyzing unit 16 b analyzes each of the possibility of securing resources in the network system 1 , the availability of each node, and optimization issues related to task execution, according to the task that the robot 10 is to perform next.

[0081] The quorum configuration setting unit 16c sets the quorum configuration based on the analysis result of the analysis unit 16b. Figure 4 and Figure 5 An example of the quorum configuration set by the quorum configuration setting unit 16c is described. Figure 4 This is a diagram illustrating the quorum configuration (part 1). Figure 5 This is an illustration of the quorum configuration (part 2).

[0082] like Figure 4 As shown, it is assumed that the network system 1 includes three robots 10 of robots 10-1 to 10-3. In this case, the quorum configuration setting unit 16c usually sets the quorum Q so that the quorum satisfies a majority, such as Figure 4 shown.

[0083] That is to say, Figure 4In the example of , the quorum configuration setting unit 16c sets a quorum Q-1 including the robots 10-1 and 10-2. Alternatively, the quorum configuration setting unit 16c sets a quorum Q-2 including the robots 10-2 and 10-3. Note that in this case, the quorum configuration setting unit 16c sets the quorum Q so that any quorum Q includes a common node (here, the robot 10-2).

[0084] In addition, if Figure 5 As shown, the quorum configuration setting unit 16c sets the quorum Q according to the weight given to each robot 10 by the analysis unit 16b. Figure 5 In , for the convenience of explanation, each weight is expressed as an integer. Figure 5 As shown, it is assumed that the network system 1 includes five robots 10 of robots 10 - 1 to 10 - 5 .

[0085] In this case, according to Figure 4 In the example in FIG. 1 , at least three robots 10 belong to one quorum Q. When the sum of the weights of the robots 10 exceeds half of the sum of all weights, the quorum configuration setting unit 16 c may set the quorum Q by the corresponding robots 10 .

[0086] exist Figure 5 In the example of , the quorum configuration setting unit 16c can set the quorum Q by the two robots 10-1 and 10-2.

[0087] The weight of each robot 10 is given by the analysis process performed by the analysis unit 16b. Figures 6 to 11 The analysis process performed by the analysis unit 16b is described. Figure 6 The relationship between the probability of securing a resource and the weight is shown. In addition, Figure 7 An example of a case where there is a high possibility of securing a resource is shown.

[0088] also, Figure 8 The relationship between the availability and weight of each node is shown. In addition, Fig. 9 An example of a case where each node has high availability is shown. Fig.10 An example of a case where a quorum configuration is selected so as to maximize or minimize an objective function according to an analysis result on an optimization problem related to task execution is shown. Fig.11 is an explanatory diagram of the analysis of an optimization problem considering tasks that have not yet been scheduled.

[0089] First, the analyzing unit 16b performs an analysis process (first analysis process) related to the possibility of securing resources. Figure 6As shown, the analyzing unit 16b assigns a weight to each robot 10 so that the weight increases as the possibility of securing a resource increases. The possibility of securing a resource is the possibility of each node securing a resource.

[0090] like Figure 7 As shown, examples of situations with a high probability of securing resources include: a situation where each robot 10 moves on the same channel; a situation where each robot 10 is located on the same floor or in the same building; a situation where the robots 10 are physically close to each other; a situation with a high probability based on past performance; and a situation with a high probability based on future arrangements. The analysis unit 16b performs a first analysis process based on the task information 15a, node information 15b, resource information 15c, performance information 15f, etc. stored in the storage unit 15 and shared in the network system 1, and assigns a weight to each robot 10.

[0091] In addition, the analyzing unit 16b performs an analysis process (second analysis process) related to the availability of each node. Figure 8 As shown, the analysis unit 16 b assigns a weight to each robot 10 such that the weight increases as the availability of each node increases.

[0092] like Fig. 9 As shown, examples of situations in which each node has high availability include: a situation in which the moving distance is short; a situation in which the moving speed is slow; a situation in which the startup time is long; a situation in which the period belonging to the system is long; a situation in which the number of communication interruptions is small; a situation in which the moving frequency is low in an environment in which communication is easily interrupted; a situation in which high availability is obtained based on past performance; and a situation in which high availability is obtained based on future arrangements.

[0093] Therefore, for example, the analyzing unit 16b reduces the weight of the robot 10 that is activated only at a specific time, the weight of the robot 10 that is recently added, the weight of the robot 10 whose maximum speed has increased, the weight of the robot 10 whose communication is easily interrupted, and the weight of the robot 10 that frequently uses the elevator e1. Note that the moving distance, moving speed, start time, time period belonging to the system, and communication interruption information are all related to the attributes of each node.

[0094] As in the case of ensuring the possibility of resources, the analysis unit 16b performs a second analysis process based on the task information 15a, node information 15b, resource information 15c, performance information 15f, etc. stored in the storage unit 15 and shared in the network system 1, and assigns a weight to each robot 10.

[0095] In addition, the analysis unit 16b performs analysis processing (third analysis processing) on ​​the optimization problem related to task execution. In such analysis processing, the analysis unit 16b performs simulations on various quorum configurations, failure occurrences, etc. Then, the analysis unit 16b selects a quorum configuration based on the simulation results so that the objective function related to task execution is maximized or minimized.

[0096] like Fig.10 As shown, examples of execution selection that maximizes the objective function include the case where the execution selection maximizes the probability of task success. On the contrary, examples of execution selection that minimizes the objective function include the case where the execution selection minimizes the task execution time. In addition to simple execution time, task execution time also includes average execution time and worst execution time.

[0097] Note that one or both of the analysis result of the above-described first analysis process and the analysis result of the second analysis process may be appropriately considered for the third analysis process.

[0098] In addition, if Fig.11 As shown in FIG. 1 , in the third analysis process, “tasks” include “tasks that have not yet been scheduled” in addition to “tasks that have been scheduled”. Fig.11 As shown, for "unscheduled tasks", the analysis unit 16b predicts the distribution of tasks to be performed based on past performance. Afterwards, the analysis unit 16b analyzes the optimization problem so as to maximize or minimize the objective function when the predicted tasks are added to the current tasks.

[0099] This enables the analysis unit 16b to select a quorum such that the objective function is maximized or minimized including "unscheduled tasks".

[0100] Description Back Figure 3 The protocol formation processing unit 16d performs protocol formation processing based on the set quorum configuration. The protocol formation processing unit 16d generates a protocol request according to the task, and sends the protocol request to each node belonging to the set quorum configuration via the communication unit 14. In addition, the protocol formation processing unit 16d receives a protocol response to the sent protocol request from each node via the communication unit 14. In addition, the protocol formation processing unit 16d updates the protocol status information 15e according to the received protocol response.

[0101] The quorum processing unit 16e performs quorum processing based on the agreement status information 15e. Specifically, the quorum processing unit 16e determines whether an agreement has been formed based on the agreement status information 15e. In addition, when an agreement is successfully formed, the quorum processing unit 16e causes the task execution unit 16f to execute the task based on the agreement.

[0102] Furthermore, when no agreement is formed, the quorum processing unit 16e does not cause the task execution unit 16f to execute the corresponding task. Furthermore, the quorum processing unit 16e updates the performance information 15f according to the performance related to whether an agreement has been formed.

[0103] Note that the agreement formation processing unit 16d and the quorum processing unit 16e may also perform the agreement formation processing and the quorum processing for the setting itself of the quorum configuration performed by the quorum configuration setting unit 16c.

[0104] In this case, the protocol formation processing unit 16d performs a protocol formation process related to the setting of the quorum configuration. The protocol formation processing unit 16d generates a protocol request for the node that is a candidate for the desired quorum configuration belonging to the quorum configuration setting unit 16c, and transmits the protocol request to each corresponding node via the communication unit 14. In addition, the protocol formation processing unit 16d receives a response to the transmitted protocol request from each node via the communication unit 14. In addition, the protocol formation processing unit 16d updates the protocol state information 15e according to the received protocol response.

[0105] The quorum processing unit 16e determines whether an agreement has been formed based on the agreement status information 15e. Furthermore, when an agreement has been successfully formed, the quorum processing unit 16e causes the quorum configuration setting unit 16c to set a desired quorum configuration.

[0106] In addition, when no agreement is formed, the quorum processing unit 16e does not cause the quorum configuration setting unit 16c to set the desired quorum configuration. In this case, the quorum configuration setting unit 16c retries to set a new quorum configuration. In addition, the quorum processing unit 16e updates the performance information 15f based on the performance related to whether an agreement has been formed.

[0107] In terms of task execution, when the quorum processing unit 16e determines that an agreement has been successfully formed, the task execution unit 16f executes the corresponding task. In task execution, the task execution unit 16f controls the robot mechanism 12 and the mobile mechanism 13 according to the task. In addition, the task execution unit 16f updates the performance information 15f according to the performance related to the task execution.

[0108] Next, we will refer to Fig.12 A procedure for processing performed by the robot 10 is described. Fig.12 is a flowchart showing the procedure of a process executed by the robot 10 .

[0109] like Fig.12As shown, in the network system 1, the analyzing unit 16b analyzes the possibility of securing resources, the availability of each node, and optimization issues related to task execution according to the next task to be executed (step S101).

[0110] Thereafter, the quorum configuration setting unit 16 c sets a quorum configuration based on at least one of the analysis results from the analysis unit 16 b (step S102 ).

[0111] After that, the protocol formation processing unit 16d sends a protocol request to each node of the quorum (step S103). In addition, the protocol formation processing unit 16d receives a protocol response to the sent protocol request (step S104). In addition, the protocol formation processing unit 16d updates the protocol state information 15e based on the received protocol response (step S105).

[0112] After that, the protocol formation processing unit 16d determines whether the reception of the protocol request and the protocol response is incomplete (step S106). When the reception is incomplete (step S106, yes), the processing from step S103 is repeated.

[0113] When the reception is complete (step S106, No), the quorum processing unit 16e determines whether an agreement is successfully formed (step S107). When an agreement is successfully formed (step S107, Yes), the task execution unit 16f executes the corresponding task (step S108).

[0114] When the agreement is not formed (step S107, No), the task execution unit 16f proceeds to step S109 without executing the corresponding task.

[0115] In step S109, the quorum processing unit 16e and the task execution unit 16f update the performance of the quorum processing or the task execution processing (step S109). Thereafter, the processing from step S101 is repeated.

[0116] <<4. Variants>>

[0117] Incidentally, the above-described embodiments of the present disclosure may include some modifications.

[0118] <4-1. Including a server device>

[0119] Fig.13 A configuration example of a network system 1A according to a modification is shown. Fig.14 An example of a case where one of the nodes in the network system 1A according to this modification is highly available is shown.

[0120] like Fig.13 As shown, Figure 2Compared with the network system 1 in the embodiment, the network system 1A according to the modification further includes a server device 100. The server device 100 is a computer that acts as an integrated server, a database server, a transaction server, an application server, and a file server in the network system 1A, for example, and can be one of the nodes. The server device 100 can be connected to the network N by wire or wirelessly.

[0121] When the server device 100 is one of the nodes, Fig. 9 Examples of high availability of each node in the Fig.14 The case shown is as a server.

[0122] <4-2. When the status of each node changes>

[0123] In addition, when the status of each node changes, the analyzing unit 16b can cause the quorum configuration setting unit 16c to dynamically change the quorum configuration according to the change. In this case, the analyzing unit 16b detects the change in the status of each node based on, for example, the sensing data of the sensor unit 11 acquired by the acquiring unit 16a and the node information 15b and the resource information 15c dynamically updated and shared between the nodes.

[0124] Thereafter, for example, when the operating state or communication situation of one of the nodes belonging to the set quorum configuration deteriorates, the analyzing unit 16b causes the quorum configuration setting unit 16c to change the quorum configuration by reducing the weight of the node. This helps to ensure the availability of the protocol algorithm in response to dynamic changes in the situation.

[0125] <4-3. Other variations>

[0126] also, Figure 4 and Figure 5 The quorum configuration in is only one example, and there are various other forms of quorum configurations. For example, subgroups based on the attributes of each node can be created in the quorum. The created subgroups can be ordered, and an algorithm for a "grid quorum system" (for example, see non-patent document 1) can be applied.

[0127] In addition, although in the above-mentioned embodiment of the present disclosure, an example of implementing the quorum in the protocol algorithm of the network systems 1 and 1A is described, the rules of the protocol formation in the group of nodes participating in the protocol formation, etc. are not limited. Therefore, the protocol algorithm may include an algorithm derived from the quorum and other algorithms that replace the quorum.

[0128] In addition, in the processing described in the embodiments of the present disclosure above, all or part of the processing described as being automatically performed may be performed manually, or all or part of the processing described as being manually performed may be automatically performed by known methods. In addition, the processing steps, specific names, and various data and parameter information included in the above-mentioned documents and drawings may be selectively changed unless otherwise specified. For example, the various information in each figure is not limited to the information shown in the figure.

[0129] In addition, each component of each device shown is functional and conceptual, and does not necessarily need to be physically configured as shown. That is, the specific form of distribution / integration of each device is not limited to the form shown in the figure, and all or part of the devices can be configured in a functionally or physically distributed / integrated manner according to various loads and usage conditions.

[0130] In addition, the above-mentioned embodiments of the present disclosure can be appropriately combined when the processing contents do not contradict each other. In addition, the order of steps in the step sequence diagram or the flowchart in the embodiment can be appropriately changed.

[0131] <<5. Hardware Configuration>>

[0132] In addition, each node such as the robot 10 and the server device 100 according to the above-mentioned embodiment of the present disclosure is configured to have, for example, Fig.15 The configuration shown is implemented by a computer 1000. The robot 10 will be described by way of example. Fig.15 10 is a hardware configuration diagram showing one example of a computer 1000 that realizes the functions of the robot 10. The computer 1000 includes a CPU 1100, a RAM 1200, a ROM 1300, a hard disk drive (HDD) 1400, a communication interface 1500, and an input / output interface 1600. The units of the computer 1000 are connected by a bus 1050.

[0133] The CPU 1100 operates based on the program stored in the ROM 1300 or the HDD 1400 and controls each unit. For example, the CPU 1100 deploys the program stored in the ROM 1300 or the HDD 1400 on the RAM 1200 and executes processing corresponding to various programs.

[0134] The ROM 1300 stores a boot program such as a basic input output system (BIOS) executed by the CPU 1100 when the computer 1000 is started, a program depending on the hardware of the computer 1000 , and the like.

[0135] The HDD 1400 is a computer-readable recording medium that non-temporarily records a program executed by the CPU 1100 , data used by the program, and the like. Specifically, the HDD 1400 is a recording medium that records a program according to an embodiment of the present disclosure. The program is an example of the program data 1450 .

[0136] The communication interface 1500 connects the computer 1000 to an external network 1550 (eg, a network N). For example, the CPU 1100 receives data from another device via the communication interface 1500 and transmits data generated by the CPU 1100 to another device.

[0137] The input / output interface 1600 connects the input / output device 1650 to the computer 1000. For example, the CPU 1100 receives data from input devices such as a keyboard and a mouse via the input / output interface 1600. In addition, the CPU 1100 transmits data to output devices such as a display, a speaker, and a printer via the input / output interface 1600. In addition, the input / output interface 1600 can be used as a medium interface for reading a program recorded on a predetermined recording medium, etc. The medium includes, for example, an optical recording medium such as a digital versatile disc (DVD) and a phase-change rewritable disc (PD), a magneto-optical recording medium such as a magneto-optical disc (MO), a tape medium, a magnetic recording medium, and a semiconductor memory.

[0138] For example, when the computer 1000 is used as the robot 10 according to the embodiment of the present disclosure, the CPU 1100 of the computer 1000 implements the function of the control unit 16 by executing the program loaded on the RAM 1200. In addition, the HDD 1400 stores the program according to the present disclosure and the data in the storage unit 15. Note that the CPU 1100 reads the program data 1450 from the HDD 1400 and executes the program data 1450. In another example, the CPU 1100 may acquire these programs from another device via the external network 1550.

[0139] <<6. Conclusion>>

[0140] As described above, according to an embodiment of the present disclosure, the robot 10 (corresponding to one example of an “information processing device”) is one of the nodes in the network system 1 including a plurality of nodes, and includes: an analysis unit 16b that analyzes each of: a possibility of ensuring resources shared by the nodes, the availability of each node, and an optimization problem associated with task execution; and a quorum configuration setting unit 16c (corresponding to one example of a “setting unit”) that sets a group of nodes participating in the formation of a protocol in the network system 1 based on at least one of the analysis results from the analysis unit 16b. This can further improve the availability of the protocol algorithm in the network system 1.

[0141] Although the embodiments of the present disclosure have been described above, the technical scope of the present disclosure is not limited to the above-described embodiments as they are, and various modifications may be made without departing from the gist of the present disclosure. In addition, components of different embodiments and modifications may be appropriately combined.

[0142] In addition, the effects of the embodiments described in this specification are only examples and are not limiting. Other effects may be exhibited.

[0143] Note that the present technology may also have the following configurations.

[0144] (1) An information processing device, the information processing device being one of the nodes in a network system including a plurality of nodes, the information processing device comprising:

[0145] an analyzing unit that analyzes each of: a possibility of ensuring resources shared by nodes, availability of each node, and an optimization problem related to task execution; and

[0146] A setting unit that sets a group of nodes participating in the formation of a protocol in the network system based on at least one of the analysis results from the analysis unit.

[0147] (2) The information processing device according to (1), which is movable.

[0148] (3) The information processing device according to (2),

[0149] The analyzing unit analyzes the possibility of securing resources based on at least one of a moving path, a location, a distance, a past performance, and a future schedule.

[0150] (4) The information processing device according to (2) or (3),

[0151] The analyzing unit analyzes the availability of each node based on at least one of information on attributes of each node, past performance, and future schedule.

[0152] (5) The information processing device according to (4),

[0153] The information about the attributes of each node includes at least one of the following: a moving distance, a moving speed, a start time, a time period belonging to the system, and information about communication interruption of each node.

[0154] (6) The information processing device according to any one of (1) to (5),

[0155] The analysis unit analyzes optimization problems related to task execution by simulating configurations or failure occurrences of multiple groups.

[0156] (7) The information processing device according to (6),

[0157] The analyzing unit selects a group from a configuration of a plurality of groups based on the simulation result so that an objective function related to the task execution is maximized or minimized.

[0158] (8) The information processing device according to (7),

[0159] The analysis unit selects the group so as to maximize the probability of mission success.

[0160] (9) The information processing device according to (7) or (8),

[0161] The analyzing unit selects the group so as to minimize the task execution time.

[0162] (10) The information processing device according to (7), (8) or (9),

[0163] The analysis unit analyzes optimization problems related to task execution by considering not yet scheduled tasks in addition to the scheduled tasks.

[0164] (11) The information processing device according to (10),

[0165] The analysis unit predicts the distribution of tasks that will occur in the future based on past performance, and analyzes optimization problems related to task execution so that the objective function is maximized or minimized when the predicted tasks are added to the scheduled tasks.

[0166] (12) The information processing device according to any one of (1) to (11),

[0167] The setting unit sets the group based on a quorum.

[0168] (13) The information processing device according to any one of (1) to (12), which is a robot.

[0169] (14) An information processing method performed by an information processing device, the information processing device being one of the nodes in a network system including a plurality of nodes, the information processing method comprising:

[0170] analyzing each of: the possibility of ensuring resources shared by nodes, the availability of each node, and optimization issues related to task execution; and

[0171] A group of nodes participating in the formation of a protocol in the network system is set based on at least one of the analysis results in the analysis.

[0172] (15) A program that causes a computer that is one of nodes in a network system including a plurality of nodes to perform the following operations:

[0173] analyzing each of: the possibility of ensuring resources shared by nodes, the availability of each node, and optimization issues related to task execution; and

[0174] A group of nodes participating in the formation of a protocol in the network system is set based on at least one of the analysis results in the analysis.

[0175] Reference numerals list

[0176] 1 Network system

[0177] 10. Robot

[0178] 11 sensor units

[0179] 12Robot Mechanism

[0180] 13 Mobile mechanism

[0181] 14 Communication Unit

[0182] 15 Storage Units

[0183] 15a Mission Information

[0184] 15b Node Information

[0185] 15c Resource Information

[0186] 15d Quorum Configuration Information

[0187] 15e protocol status information

[0188] 15f Performance Information

[0189] 16Control Unit

[0190] 16a Acquisition Unit

[0191] 16b Analysis Unit

[0192] 16c Quorum Configuration Settings Unit

[0193] 16d protocol formation processing unit

[0194] 16e Quorum Processing Unit

[0195] 16f Task Execution Unit

[0196] 100 server devices

Claims

1. An information processing device, the information processing device being one of the nodes in a network system including a plurality of nodes, the information processing device include: an analyzing unit that analyzes each of: a possibility of ensuring resources shared by nodes, availability of each node, and optimization issues related to task execution; as well as A setting unit that sets a group of nodes participating in the formation of a protocol in the network system based on at least one of the analysis results from the analysis unit. The information processing device according to claim 1 , which is movable.

3. The information processing device according to claim 2, in, The analyzing unit analyzes the possibility of securing resources based on at least one of a moving path, a position, a distance, a past performance, and a future schedule.

4. The information processing device according to claim 2, in, The analyzing unit analyzes the availability of each node based on at least one of information on attributes of each node, past performance, and future schedule.

5. The information processing device according to claim 4, in, The information on the attribute of each node includes at least one of the following: a moving distance, a moving speed, a start time, a time period belonging to a system, and information on a communication interruption of each node.

6. The information processing device according to claim 1, in, The analysis unit analyzes an optimization problem related to task execution by performing simulation on configuration or failure occurrence of a plurality of groups.

7. The information processing device according to claim 6, in, The analyzing unit selects a group from among a plurality of group configurations based on a result of the simulation so that an objective function related to the task execution is maximized or minimized.

8. The information processing device according to claim 7, in, The analyzing unit selects the group so as to maximize the probability of mission success.

9. The information processing device according to claim 7, in, The analyzing unit selects the group so that task execution time is minimized.

10. The information processing device according to claim 7, in, The analysis unit analyzes an optimization problem related to task execution by considering tasks that have been scheduled and tasks that have not yet been scheduled.

11. The information processing device according to claim 10, in, The analysis unit predicts the distribution of tasks that will occur in the future based on past performance, and analyzes an optimization problem related to task execution so that the objective function is maximized or minimized when the predicted tasks are added to the scheduled tasks.

12. The information processing device according to claim 1, in, The setting unit sets the group based on a quorum.

13. The information processing device according to claim 1, which is a robot.

14. An information processing method executed by an information processing device, the information processing device being one of the nodes in a network system including a plurality of nodes, the information processing method include: Analyze each of the following: the possibility of ensuring resources shared by nodes, the availability of each node, and the optimization issues related to task execution; as well as A group of nodes participating in the formation of a protocol in the network system is set based on at least one of the analysis results in the analysis.

15. A program that causes a computer that is one of nodes in a network system including a plurality of nodes to perform the following operations: analyzing each of: the possibility of ensuring resources shared by nodes, the availability of each node, and optimization issues related to task execution; and A group of nodes participating in the formation of a protocol in the network system is set based on at least one of the analysis results in the analysis.