# US 12,604,286 B2 · Distributed event-based coordination model > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,604,286 B2 - Document ID: US12604286B2 - Status: Granted - Kind: B2 - Application number: 17/624,264 - Filed: 2020-07-02 - Published: 2022-11-10 - Granted: 2026-04-14 - Earliest claimed: 2019-07-02 - Assignees: Phinxt Robotics Limited - Applicants: Seyo Limited - Inventors: Yanwen Chen - Web page: https://patentgrep.com/patent/US12604286B2 ## CPC - H04W 56/0025: {synchronizing potentially movable access points} - G06F 9/542: {Event management; Broadcasting; Multicasting; Notifications} - H04L 67/12: specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks - H04W 4/025: {using location based information parameters} - H04W 4/80: Services using short range communication, e.g. near-field communication [NFC], radio-frequency identification [RFID] or low energy communication - G08G 1/096791: {where the origin of the information is another vehicle} - H04W 4/46: for vehicle-to-vehicle communication [V2V] - H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72) - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) - G08G: TRAFFIC CONTROL SYSTEMS (guiding railway traffic, ensuring the safety of railway traffic B61L; arrangement of road signs or traffic signals E01F9/00; radar or analogous systems, sonar systems, lidar systems specially adapted for traffic control G01S13/91, G01S15/88, G01S17/88; {radar or analogous systems, sonar systems, lidar systems specially adapted for anti-collision purposes G01S13/93, G01S15/93, G01S17/93}) ## Abstract The present invention relates to coordinating tasks in a distributed mesh of systems, such as between autonomous vehicles, multi-camera systems, IoT distributed node systems and/or modular factories in a variety of use cases. More particularly, the present invention relates to coordinating events in a distributed mesh of systems based on parameters and constraints and can be used to provide a messaging arrangement that allows distributed systems to communicate and ensure that tasks are completed within the distributed system and/or at one or more nodes within the distributed system. Aspects and/or embodiments seek to provide a method for coordinating machines/nodes/devices of a distributed network, without a centralised system component, by synchronising devices of a distributed system without using an absolute timestamp. Instead, a logical, event-based dependency tree is collaboratively constructed by the nodes of a distributed network to manage decisions at each node of a distributed network. ## Claims ### Claim 1 A method of event-based synchronisation of states for a distributed system of moveable, physical nodes, the method comprising: each node computing its own sequence of events; and computing the sequence of events at each node comprising the following steps: establishing communication with a plurality of neighbouring ones of the nodes; each node determining a plurality of interdependent events between relevant nodes of the plurality of neighbouring nodes and agreement on the interdependent events, each of the interdependent events relating to node movement; and each node communicating its state information to its neighbouring nodes such that each of its neighbouring nodes monitors one or more states of the relevant nodes of its neighbouring nodes during execution of the events; wherein each node is operable to react to the one or more states of the relevant nodes of its plurality of neighbouring nodes. ### Claim 2 (depends on 1) The method of claim 1 wherein the event-based synchronisation comprises coordinating events for the plurality of neighbouring nodes so as to automatically accommodate a change of state for any neighbouring node during its sequence of events. ### Claim 3 (depends on 1) The method of claim 1 wherein the step of establishing communication between the plurality of neighbouring nodes comprises: sending a communication request to the plurality of neighbouring nodes; and receiving one or more responses to the communication request from one or more neighbouring nodes indicating their presence as a neighbouring node. ### Claim 4 (depends on 1) The method of claim 1 wherein each node of the distributed system or plurality of neighbouring nodes can detect one or more relevant external nodes, wherein the external nodes are not part of the distributed system of nodes or plurality of neighbouring nodes, and update its own and/or the one or more relevant external nodes' sequence of events by observing the behaviour of said one or more relevant external nodes, wherein the relevant external nodes are within a geographic proximity of the node. ### Claim 5 (depends on 1) The method of claim 1 wherein the determining the plurality of interdependent events comprises creating an event dependency tree for each of the neighbouring nodes. ### Claim 6 (depends on 5) The method of claim 5 wherein the event dependency trees are created using logical time, wherein the logical time is calculated based on the sequence of events for each of the plurality of neighbouring nodes. ### Claim 7 (depends on 1) The method of claim 1 wherein the step of each node communicating its state information to the neighbouring nodes comprises sending a state change query to neighbouring nodes. ### Claim 8 (depends on 7) The method of claim 7 wherein, upon receipt of the state change query, the neighbouring nodes determine whether the state change query is compliant with its sequence of events. ### Claim 9 (depends on 7) The method of claim 7 wherein the step of each node communicating its state information to the neighbouring nodes further comprises locally processing state information received from neighbouring nodes to determine a new sequence of events for its own and neighbouring nodes to accommodate the change of state query. ### Claim 10 (depends on 9) The method of claim 9 further comprising sending a request to execute the new event sequences to neighbouring nodes. ### Claim 11 (depends on 9) The method of claim 9 wherein the new sequence of events is determined based on a variable sample rate. ### Claim 12 (depends on 1) The method of claim 1 wherein each node is operable to react to the one of more states in dependence upon local parameters, wherein the local parameters comprise one or more of: location, speed, direction and proximity. ### Claim 13 (depends on 1) The method of claim 1 wherein each node is operable to react to the one of more states in dependence upon constraints, wherein the constraints comprise any of one or any combination of conditional constraints, dependent constraints, exclusive constraints, precedence constraints and/or coincidence constraints, optionally the conditional constraints comprise determining when a Boolean condition is satisfied. ### Claim 14 (depends on 1) The method of claim 1, wherein each node is operable to evaluate state changes of each of the neighbouring nodes and determine a sequence of events that avoids risks, wherein the risks comprise any one or a combination of physical or logical risks. ### Claim 15 (depends on 1) The method of claim 1, further comprising determining one or more states of the nodes of the plurality of neighbouring nodes, comprising comprises determining a steady state of each of the plurality of neighbouring nodes. ### Claim 16 (depends on 1) The method of claim 1, wherein the distributed system of nodes lacks a centralised system component, wherein the centralised system component comprises any or any combination of: a central server; a master node; or a centralised control component. ### Claim 17 (depends on 1) The method of claim 1, wherein the neighbouring nodes of each node can be different. ### Claim 18 (depends on 17) The method of claim 17, wherein the establishing communication comprises each node dynamically determining its neighbouring nodes. ### Claim 19 (depends on 1) A system carrying out the method of claim 1.