Illumination control method, system and device, storage medium and computer program product

Abstract

The invention discloses an illumination control method, system and device, a storage medium and a computer program product, and relates to the technical field of intelligent illumination, the illumination control method is applied to at least one gateway, and the method comprises the following steps: receiving trigger detection data and adjacency data uploaded by a plurality of illumination nodes, the trigger detection data comprises a trigger frequency and a triggered frequency proportion; generating and storing a global graph data structure according to the adjacent data; performing clustering analysis on the triggering times based on a preset path clustering algorithm to obtain a target path node; generating a graded lighting instruction according to the triggered frequency proportion, the target path node and the global graph data structure; and sending the graded lighting instruction to a plurality of lighting nodes, so that the plurality of lighting nodes execute lighting operation according to the graded lighting instruction. The system can adapt to path modes of different space structures to achieve pre-illumination and differential illumination, the system maintenance cost is remarkably reduced, and invalid illumination energy consumption is reduced.

Description

Technical Field

[0001] This application relates to the field of intelligent lighting technology, and particularly to a lighting control method, system, device, storage medium, and computer program product. Background Art

[0002] In intelligent lighting scenarios such as buildings and roads, the intelligent energy-saving lighting system realizes energy optimization through occupancy detection technology. Its core principle is to detect whether the space is occupied by a user through a sensor, and accordingly control the on / off state of the lighting device. However, in scenarios where single-area lighting cannot meet user needs (such as open areas like corridors and parking lots), multi-area device linkage is required to form a continuous lighting path. Traditional linkage strategies rely on manual configuration of the logical relationship between areas. For example, it is set that when a specific sensor is triggered, the lighting devices in adjacent areas are linked and turned on. This manual intervention mode is not only inefficient and costly, but also difficult to adapt to complex and changeable actual usage environments. At the same time, it does not fully combine the actual behavior state of users to optimize the linkage strategy and lacks a differential response to the behavior state of users. Summary of the Invention

[0003] The main purpose of this application is to provide a lighting control method, system, device, storage medium, and computer program product, aiming to solve the technical problems of complex configuration, poor scene adaptability, and rigid response mechanism in the traditional solution. Through this application, it is possible to adapt to the path modes of different spatial structures to achieve pre-illumination and differential lighting, improve the lighting response speed, and reduce the energy consumption of ineffective lighting.

[0004] To achieve the above object, in a first aspect, this application proposes a lighting control method, which is applied to a node network. The node network includes multiple lighting nodes, and includes:

[0005] Perform an area scanning operation to generate trigger detection data;

[0006] Send broadcasts to multiple neighboring nodes within the communication range and receive feedback information to obtain adjacency data;

[0007] Upload the trigger detection data and the adjacency data to the gateway;

[0008] Receive the hierarchical lighting instruction sent by the gateway, and perform a lighting operation according to the hierarchical lighting instruction.

[0009] In one embodiment, the step of sending a broadcast to multiple neighboring nodes within the communication range and receiving feedback information to obtain adjacency data includes: each lighting node sends an inquiry broadcast signal to multiple neighboring nodes within the communication range; receives response confirmation signals fed back by the multiple neighboring nodes; establishes an adjacency list data structure according to the response confirmation signals, where the adjacency list data structure includes: node identifier, signal strength parameter, and update time; and determines the adjacency data according to the node identifier, the signal strength parameter, and the update time.

[0010] In one embodiment, the step of determining the adjacency data according to the node identifier, the signal strength parameter, and the update time includes: obtaining a signal strength threshold range, and determining whether the signal strength parameter falls within the signal strength threshold range; if the signal strength parameter falls within the signal strength threshold range, an adjacency relationship is established according to the node identifier, the signal strength parameter, and the update time to obtain the adjacency data.

[0011] In a second aspect, the present application also proposes another lighting control method and a gateway. There is at least one gateway, and the method includes:

[0012] Receiving trigger detection data and adjacency data uploaded by multiple lighting nodes, where the trigger detection data includes: the number of triggers, and the proportion of the number of times being triggered;

[0013] Generating and storing a global graph data structure according to the adjacency data;

[0014] Performing clustering analysis on the number of triggers based on a preset path clustering algorithm to obtain target path nodes;

[0015] Generating a hierarchical lighting instruction according to the proportion of the number of times being triggered, the target path nodes, and the global graph data structure;

[0016] Sending the hierarchical lighting instruction to the multiple lighting nodes, so that the multiple lighting nodes perform lighting operations according to the hierarchical lighting instruction.

[0017] In one embodiment, the step of performing clustering analysis on the number of triggers based on a preset path clustering algorithm to obtain target path nodes includes: performing clustering processing on the number of triggers according to a classification node data vector and a preset number of clusters to obtain initial clustering centroids; performing iterative training on the initial clustering centroids based on the classification node data vector, and merging adjacent clusters according to a dynamic merging threshold, and correspondingly adjusting the preset number of clusters; determining the node category of the lighting node according to the classification model obtained after iterative training, and if the node mean of the lighting node is higher than a preset mean, determining the lighting node as a target path node.

[0018] In one embodiment, generating a hierarchical lighting instruction according to the triggered times ratio, the target path node, and the global graph data structure includes: obtaining a preset change ratio; if the triggered times ratio is not greater than the preset change ratio, generating the hierarchical lighting instruction according to the target path node and the global graph data structure.

[0019] In one embodiment, the global graph data structure includes a triggered node, one-hop neighboring nodes, and two-hop neighboring nodes, and the hierarchical lighting instruction includes a primary lighting instruction and a secondary lighting instruction; the primary lighting instruction: sending an instruction for full-brightness lighting to the one-hop neighboring nodes; the secondary lighting instruction: if the two-hop neighboring nodes of the triggered node belong to the target path node, sending an instruction for full-brightness lighting to the one-hop neighboring nodes and the two-hop neighboring nodes; or, if the two-hop neighboring nodes of the triggered node do not belong to the target path node, sending an instruction for full-brightness lighting to the one-hop neighboring nodes and sending an instruction for low brightness or a turn-off instruction to the two-hop neighboring nodes.

[0020] In one embodiment, the trigger detection data further includes: continuous trigger time, and the method further includes: obtaining a preset time threshold; if the continuous trigger time is greater than the preset time threshold, determining that the path lighting mode is a stationary mode, and the gateway does not send the secondary lighting instruction to the two-hop neighboring nodes; or, if the continuous trigger time is less than the preset time threshold, determining that the path lighting mode is a mobile mode, and the gateway sends the secondary lighting instruction to the two-hop neighboring nodes.

[0021] In a third aspect, to achieve the above object, the present application further provides an illumination control system, including:

[0022] A node network, the node network including a plurality of lighting nodes;

[0023] At least one gateway;

[0024] The node network and the gateway cooperate to implement the steps of the illumination control method in the first aspect as described above; or, implement the steps of the illumination control method in the second aspect as described above.

[0025] In a fourth aspect, to achieve the above object, the present application further provides an illumination control computer device, the device including: a memory, a processor, and a computer program stored on the memory and executable on the processor, the computer program configured to implement the steps of the illumination control method in the first aspect as described above; or, implement the steps of the illumination control method in the second aspect as described above.

[0026] Fifth aspect, to achieve the above object, the present application further provides a storage medium, the storage medium is a computer-readable storage medium, and a computer program is stored on the storage medium. When the computer program is executed by a processor, the steps of the lighting control method in the first aspect as described above are implemented; or, the steps of the lighting control method in the second aspect as described above are implemented.

[0027] Sixth aspect, to achieve the above object, the present application further provides a computer program product, the computer program product includes a computer program. When the computer program is executed by a processor, the steps of the lighting control method in the first aspect as described above are implemented; or, the steps of the lighting control method in the second aspect as described above are implemented.

[0028] One or more technical solutions proposed by the present application have at least the following technical effects: By constructing a dynamic path intelligent recognition and multi-level response coordination mechanism, the system realizes the automatic generation of inter-regional linkage configuration lighting, improves the deployment efficiency of linkage lighting strategies in complex scenarios, significantly reduces the system maintenance cost. At the same time, based on the improved clustering algorithm, it can accurately analyze the user movement trajectories in typical complex topological structures such as intersections and circular areas, ensure the complete coverage of continuous lighting paths, eliminate the lighting blind spots in traditional solutions, and have the ability of advanced user behavior perception and scene adaptive evolution, thus solving the technical problems of complex configuration, poor scene adaptability and rigid response mechanism in traditional solutions. BRIEF DESCRIPTION OF THE DRAWINGS

[0029] The drawings here are incorporated into the description and form a part of this description, showing embodiments consistent with the present application and used together with the description to explain the principles of the present application.

[0030] To more clearly illustrate the technical solutions in the embodiments of the present application or the prior art, the following will briefly introduce the drawings required for use in the description of the embodiments or the prior art. Obviously, for those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0031] Figure 1 It is a schematic flowchart of a lighting control method according to an embodiment of the present application;

[0032] Figure 2 It is a schematic flowchart of another lighting control method according to an embodiment of the present application;

[0033] Figure 3 It is a schematic structural diagram of a lighting control system according to an embodiment of the present application;

[0034] Figure 4 It is a schematic structural diagram of a device of a hardware operating environment related to the lighting control method according to an embodiment of the present application.

[0035] The realization of the purpose, functional features and advantages of this application will be further described in conjunction with the embodiments and with reference to the accompanying drawings. Detailed implementation manners

[0036] It should be understood that the specific embodiments described herein are only used to explain the technical solutions of this application and are not used to limit this application.

[0037] In order to better understand the technical solutions of this application, the following will be described in detail in conjunction with the drawings of the specification and specific implementation manners.

[0038] The following disclosure provides many different embodiments or examples for implementing different structures of this application. To simplify the disclosure of this application, components and settings of specific examples are described below. Of course, they are only examples and are not intended to limit this application. In addition, this application may repeat reference numerals and / or letters in different examples. This repetition is for the purpose of simplification and clarity and does not in itself indicate the relationship between the various embodiments and / or settings discussed.

[0039] It should be understood that when used in this specification and the appended claims, the terms "comprises" and "comprising" indicate the presence of the described features, wholes, steps, operations, elements and / or components, but do not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components and / or their combinations.

[0040] It should also be understood that the terms used in this specification of this application are only for the purpose of describing specific embodiments and are not intended to limit this application. As used in this specification of this application and the appended claims, unless the context clearly indicates otherwise, the singular forms "a", "an" and "the" are intended to include the plural forms.

[0041] It should be further understood that the term "and / or" used in this specification of this application and the appended claims refers to any combination and all possible combinations of one or more of the associated listed items, and includes these combinations.

[0042] As used in this specification and the appended claims, the term "if" can be interpreted as "when", "once", "in response to a determination" or "in response to a detection" according to the context. Similarly, the phrase "if a determination" or "if [the described condition or event] is detected" can be interpreted as meaning "once a determination is made", "in response to a determination", "once [the described condition or event] is detected" or "in response to a detection of [the described condition or event]" according to the context.

[0043] Figure 1A lighting control method provided by an embodiment of the present application is applied to a node network, and the node network includes a plurality of lighting nodes, including:

[0044] Step S10, perform an area scanning operation to generate trigger detection data.

[0045] Among them, the trigger detection data is the detection data generated when the lighting node is triggered, including but not limited to: the number of triggers, the proportion of the number of times triggered, node identification information (such as node ID), continuous trigger time, etc. After the lighting node is powered on, initialization processing is performed. A wireless channel scanning operation can be performed through an occupancy sensor (also known as an occupancy sensor, such as a PIR sensor, an infrared sensor, an ultrasonic sensor, etc.) to detect whether a detected entity exists in a certain physical area and generate corresponding trigger detection data. Specifically, the trigger condition can be that the occupancy sensor detects that an entity exists in the detected area for a preset duration, then it is determined that there is an object, and corresponding trigger detection data is generated.

[0046] Step S11, send a broadcast to a plurality of neighboring nodes within the communication range and receive feedback information to obtain adjacency data.

[0047] Among them, the neighboring nodes are lighting nodes in which each lighting node forms a neighbor relationship with other directly connected lighting nodes; the adjacency data includes but not limited to: node identification, signal strength parameter, adjacency relationship information, etc. The feedback information includes signal strength parameters and data packets. Each lighting node can communicate with other lighting nodes and transmit messages to each other. While performing the area scanning operation, the lighting node can send a probe signal containing the node identification or device identification to the surrounding lighting nodes within its communication range. The neighboring nodes receive the broadcast and generate feedback information to feedback to the lighting node that sends the inquiry broadcast. The lighting node receives and processes the feedback information generated by other lighting nodes, and establishes an adjacency relationship between it and other lighting nodes according to the feedback information to obtain the adjacency data of the neighboring nodes.

[0048] Step S12, upload the trigger detection data and the adjacency data to the gateway.

[0049] After the lighting node completes the establishment of the adjacency relationship and defines the neighboring nodes, it uploads the trigger detection data and adjacency data generated by scanning to the gateway, enabling the gateway to perform analysis and calculation based on the collected data to obtain the lighting control instruction. Specifically, each time the occupancy sensor is triggered, the lighting node uploads the detected trigger detection data to the gateway once, and uploads the adjacency data once after the broadcast scan collection is completed during the initialization of the lighting node; alternatively, the lighting node can upload the detected lighting node data in real time. After the lighting node has completed the upload of the adjacency data once, it broadcasts a detection signal to the neighboring nodes periodically (which can be set according to requirements, such as every 5 minutes, every 10 minutes, etc.), and uploads the updated adjacency data after verifying the validity of the neighboring nodes; or each time the occupancy sensor is triggered, the lighting node binds and uploads the current trigger detection data and the latest adjacency data at the same time. If the adjacency data has not changed, only the increment or identifier can be uploaded. In some specific embodiments, the lighting node can regularly summarize the data and construct a data structure to send to the gateway. Each time the gateway receives the data, it performs data analysis and calculation operations to achieve the coordinated optimization of lighting control energy efficiency and response speed. In some specific embodiments, after a single lighting node completes the establishment of the adjacency relationship, it sends a feedback signal, trigger detection data, and adjacency data to the gateway. After receiving the feedback signal, the gateway notifies the next lighting node to establish the adjacency relationship, iterating through all nodes.

[0050] Step S13: Receive the hierarchical lighting instruction sent by the gateway and perform the lighting operation according to the hierarchical lighting instruction.

[0051] Among them, the hierarchical lighting instruction includes the node identifier of the target path node and the lighting parameters; the target path node is the lighting node corresponding to the user's common path; the lighting parameters can be brightness, including: full brightness (highest brightness) and low brightness, where the low brightness can be 30% of the full brightness. After the gateway completes the calculation, it sends a control instruction of the hierarchical lighting instruction to the lighting node. The lighting node receives the control instruction and triggers the lighting equipment in the detected area according to the control instruction to achieve intelligent lighting.

[0052] This embodiment achieves the following beneficial technical effects: The lighting node generates trigger detection data through scanning detection, and dynamically establishes neighboring nodes through broadcast interrogation and signal strength analysis, thereby obtaining adjacency data, which can adapt to complex and changeable physical topologies without manual intervention, significantly reducing the system deployment and maintenance costs. The lighting node ensures that the gateway always generates hierarchical lighting instructions for the linkage lighting strategy based on real-time data by automatically updating and uploading trigger detection data and adjacency data to the gateway. In addition, the direct communication ability between lighting nodes based on the neighboring relationship can achieve basic-level linkage response through locally pre-configured rules in the case of gateway response delay or offline status, effectively improving the system fault tolerance and real-time performance.

[0053] In some embodiments of the present application, broadcasting to multiple neighboring nodes within the communication range and receiving feedback information to obtain adjacency data includes:

[0054] Each lighting node sends an inquiry broadcast signal to multiple neighboring nodes within the communication range.

[0055] Among them, the inquiry broadcast signal is a detection signal including device identification broadcast by the lighting node to neighboring nodes. Each lighting node has the ability to generate feedback information after receiving the inquiry broadcast signal and send the feedback information to the lighting node that sent the inquiry broadcast. To achieve the purpose that each lighting node can define neighboring nodes, the lighting node broadcasts the detection signal for inquiry to all nodes within its communication range.

[0056] Receive response confirmation signals fed back by multiple neighboring nodes.

[0057] Among them, the response confirmation signal is a signal generated based on the response to the inquiry broadcast signal. After receiving the inquiry broadcast signal, other lighting nodes (neighboring nodes) broadcast a response confirmation signal to the lighting node that sent the inquiry broadcast signal according to the signal strength threshold or the shortest communication hop count, and the lighting node that sent the inquiry broadcast signal receives the foregoing response confirmation signal.

[0058] Establish an adjacency list data structure according to the response confirmation signal. The adjacency list data structure includes: node identification, signal strength parameter, and update time.

[0059] Among them, the adjacency list data structure can be used to store node information in the response confirmation signal, such as node identification, signal strength parameter, and update time, etc. The lighting node that sends the inquiry broadcast signal establishes an adjacency list data structure after receiving the response confirmation signal, including node identification, signal strength, and update time, to adapt to complex topological structures. In some specific embodiments, the adjacency list data structure can be dynamically adjusted according to the feedback information, such as node failure or the addition of a new lighting node, and the adjacency list data structure and adjacency data are adjusted periodically to adapt to environmental changes and improve the robustness of the system.

[0060] Determine adjacency data according to the node identification, signal strength parameter, and update time.

[0061] Proximity nodes can be determined based on the magnitude of the signal strength parameter and the node identification information (including the node ID and the update time). For example, lighting nodes with signal strength RSSI values ranging from -80 dBm to -50 dBm are determined as proximity nodes, and the adjacency relationship is established based on the node identification and the update time to obtain the corresponding adjacency data. In some specific embodiments, the proximity relationship can also be continuously verified through a periodic broadcast interrogation mechanism (such as once every 10 seconds). When the lighting node moves or environmental interference causes a decline in communication quality, invalid nodes can be automatically removed from the proximity node list, and effective proximity nodes that are always communication-reachable, function normally, and can interact stably are determined, ensuring that the linkage policy is always executed based on the latest topology structure to achieve adaptive networking and reliable linkage.

[0062] In some embodiments of the present application, determining adjacency data based on node identification, signal strength parameter, and update time includes:

[0063] Obtain the signal strength threshold range and determine whether the signal strength parameter falls within the signal strength threshold range.

[0064] Among them, the signal strength threshold range can be an interval formed by presetting the upper and lower limits of the signal strength of proximity nodes. For example, the signal strength RSSI value ranging from -80 dBm to -50 dBm can be set as the signal strength threshold range. By determining whether the signal strength parameter in the feedback information falls within this signal strength threshold range, it is further determined whether the lighting node sending the feedback information can be defined as a proximity node.

[0065] If the signal strength parameter falls within the signal strength threshold range, establish an adjacency relationship based on the node identification, signal strength parameter, and update time to obtain adjacency data.

[0066] If the signal strength parameter in the feedback information falls within the signal strength threshold range, the lighting node sending the feedback information meets the definition of a proximity node. When a single lighting node has completed defining all proximity nodes, the adjacency relationship is established, and adjacency data is obtained for uploading to the gateway. Interference lighting nodes are filtered out through the signal strength threshold range to ensure the physical accuracy of the adjacency relationship and the stability of data transmission.

[0067] Figure 2 Another lighting control method provided by the embodiments of the present application is applied to a gateway, and at least one gateway is included, including:

[0068] Step S20: Receive trigger detection data and adjacency data uploaded by multiple lighting nodes. The trigger detection data includes: the number of triggers and the proportion of the number of times triggered.

[0069] Among them, the trigger count is the count information of the number of times the lighting node is triggered; the triggered count ratio is the ratio of the triggered count of the triggered node and its all one-hop neighboring nodes. It should be noted that the lighting nodes and the gateway do not have a one-to-one correspondence relationship, but a one-to-many relationship where one gateway corresponds to multiple lighting nodes. There is at least one gateway, and there must be multiple lighting nodes. There is a binding relationship between the gateway and the nodes, and the binding relationship can be set manually. When there are multiple gateways, each gateway is responsible for lighting control, data collection, and calculation of the corresponding lighting nodes. Specifically, when the occupancy sensor of the lighting node is triggered, the lighting node becomes the triggered node, and the triggered node collects relevant detection data. After a single lighting node completes the establishment of the adjacency relationship, it sends a feedback signal, trigger detection data, and adjacency data to the gateway. The gateway maintains the triggered count of the lighting node according to the information uploaded by the lighting node and completes data collection.

[0070] Step S21, generate a global graph data structure based on the adjacency data and store it.

[0071] Among them, the global graph data structure is that after the gateway receives the adjacency data of each lighting node, it generates a graph data structure (topological graph) according to the unique ID of the lighting node. The graph data structure is the graph data structure in computer science and can use various storage structures, such as adjacency list, adjacency matrix, cross linked list, etc. Specifically, the present application can adopt an adjacency matrix: for example, the connection relationship between three nodes can be represented as the matrix [1 0 1, 0 1 0, 1 0 1], indicating that node 1 and node 3 are connected to each other, and node 2 is only connected to itself. After the gateway receives the data, it is converted into the node serial number defined by the gateway. For example, the node with the unique ID of 199332411 is converted into node number 2 in the gateway, and then the connection relationship between the nodes is converted into a graph data structure for storage.

[0072] Step S22, perform clustering analysis on the trigger count based on a preset path clustering algorithm to obtain target path nodes.

[0073] Among them, the preset path clustering algorithm is an improved clustering algorithm set in advance, such as the k-means algorithm, k-medoids algorithm, agglomerative hierarchical clustering algorithm, divisive hierarchical clustering algorithm, DBSCAN algorithm, OPTICS algorithm, k-means++ algorithm, etc. The preset path clustering algorithm is used to calculate and analyze whether the attributes of lighting nodes are lighting nodes of common paths; the target path nodes refer to lighting nodes that can form common paths of users through connection relationships. In some specific embodiments, when all lighting nodes are triggered a certain number of times or after a fixed period of time, the gateway can identify the common paths of users based on the number of times all lighting nodes are triggered, and then generate corresponding lighting control instructions. Specifically, taking the preset path clustering algorithm as the k-means++ algorithm as an example, each time the gateway receives data uploaded by lighting nodes, it uses the k-means++ clustering algorithm. By using dynamic clustering centers for optimization, combined with the trigger times and automatic k-value adjustment mechanism, it analyzes whether the attributes of the lighting nodes are target path nodes, and through algorithm analysis, it can adapt to path patterns of different spatial structures.

[0074] Step S23, generate hierarchical lighting instructions according to the trigger times ratio, target path nodes, and global graph data structure.

[0075] Step S24, send the hierarchical lighting instructions to multiple lighting nodes, so that the multiple lighting nodes perform lighting operations according to the hierarchical lighting instructions.

[0076] In some specific embodiments, when the number of times of being triggered between each lighting node reaches a certain number and the ratio no longer changes, that is, the ratio change of the number of times of being triggered between more than 95% of the lighting nodes (or all lighting nodes) does not exceed a certain range, the gateway, based on the global graph data structure, implements linkage lighting control on the triggered nodes and target path nodes through a hierarchical response mechanism. Specifically, the hierarchical lighting instructions can be divided into first-level lighting instructions, second-level lighting instructions, and third-level lighting instructions. For the triggered nodes, the lighting devices of the node where the user is located should be immediately activated and the lighting state should be maintained; for the neighboring nodes of the triggered nodes, that is, the one-hop neighboring nodes, after receiving and analyzing the data, the gateway generates a first-level lighting instruction and sends it to the one-hop neighboring nodes. After receiving the instruction, the one-hop neighboring nodes immediately activate the lighting devices within the area for full-brightness lighting; for the neighboring nodes of the neighboring nodes of the triggered nodes, that is, the two-hop neighboring nodes, after receiving and analyzing the data, the gateway determines whether the attribute of the two-hop neighboring nodes is a target path node according to the obtained analysis result. If so, a second-level lighting instruction is generated and sent to the two-hop neighboring nodes. After receiving the instruction, the two-hop neighboring nodes immediately activate the lighting devices within the area for full-brightness lighting. Otherwise, a third-level lighting instruction is generated and sent to the two-hop neighboring nodes. After receiving the instruction, the two-hop neighboring nodes turn off the lighting devices within the area or perform low-brightness lighting. In some other specific embodiments, when the lighting devices within the area range of the triggered nodes are activated for lighting, it can trigger its one-hop neighboring nodes to enter the standby state to improve the lighting efficiency. In some other specific embodiments, according to the path priority in the global graph data structure, pre-lighting instructions (such as dimming to 30% brightness) can be sent to the top N nodes with the highest probability in the user's frequently used path, and the pre-lighting delay is dynamically adjusted inversely proportional to the user's moving speed. In some other specific embodiments, low-power instructions (such as turning off the main lighting and retaining weak presence sensing) can be sent to the lighting nodes that do not belong to the target path nodes. In some other specific embodiments, the gateway can continuously monitor the deviation between the actual moving trajectory of the user and the predicted path, and update the global graph edge weights in real time through the Bayesian model, and iteratively optimize the hierarchical strategy. By explicitly modeling the physical space correlation through the global graph data structure, the lighting control is upgraded from local node linkage to global path optimization, while ensuring the user's seamless lighting experience and improving the system-level energy efficiency. And the lighting strategy generation process is completely based on the gateway's local computing resources and does not rely on external simulation platforms.

[0077] In some embodiments of the present application, clustering analysis is performed on the number of trigger times based on a preset path clustering algorithm to obtain target path nodes, including:

[0078] Performing clustering processing on the number of trigger times according to the classified node data vector and the preset number of clusters to obtain the initial clustering centroids.

[0079] Among them, the classified node data vector is each defined lighting node data vector; the preset number of clusters is the set number of clusters k according to the path detection requirement; the initial cluster centroid is an initial cluster center randomly selected from the classified node data vectors. In some specific embodiments, taking the k-means++ clustering algorithm as an example, the classified node data vector of each lighting node is defined as where T i : the number of trigger times of node N i itself within the time window; the total number of trigger times of one-hop neighboring nodes (directly connected nodes); the total number of trigger times of two-hop neighboring nodes (nodes indirectly connected through one-hop nodes). The preset number of clusters k = 4, that is, the algorithm objective is to divide the feature vector data into four categories. It should be noted that when k = 4, the clustering algorithm can correctly identify paths at path connection areas such as right-angle turns, T-junctions, crossroads, octagonal intersections, etc. Clustering the trigger times to obtain the initial cluster centroid, specifically:

[0080] S1. Randomly select a centroid C1 from the classified node data vectors;

[0081] S2. For each unselected data T, calculate its minimum squared distance D(T i ) = min||T i - C i || 2 ;

[0082] S3. Select the next centroid C2 according to the probability P(T i ) = D(T i ) / ∑D(T), so as to ensure that the centroids are dispersed and cover high-density areas. Repeat the above steps until 4 initial cluster centroids are selected.

[0083] Iteratively train the initial cluster centroid based on the classified node data vector, and merge adjacent clusters according to the dynamic merging threshold, and correspondingly adjust the preset number of clusters.

[0084] Specifically, it can be divided into three stages, including the assignment stage, the update stage, and the merge stage. Among them, the assignment stage: for each data T in the data vector, calculate its Euclidean distance from all initial cluster centroids, and assign it to the cluster to which the nearest initial cluster centroid belongs:

[0085] Cluster(T) = argmin j∈{1，2，3，4} ||T i - C j || 2

[0086] Update stage: Recalculate the centroid C of each clusterj , i.e., the mean value of all data points within the cluster:

[0087]

[0088] where S j is the set of data points in the j-th cluster, and |S j | is the number of data points within the cluster.

[0089] After the update phase is completed, calculate the maximum distance D between data points inter = max||T i - T j ||, where T i ∈ F, T j ∈ F.

[0090] The termination condition is to repeat the assignment phase and the update phase until the change in the position of the centroid is less than 0.01 * D inter or the preset maximum number of iterations is reached.

[0091] Merging phase: Based on the maximum distance D inter set the dynamic merging threshold θ = λD inter , where λ ∈ [0, 1]. When the distance D between the centroids of two clusters = max||C i - C j || is less than θ, merge the data points of the two clusters into one cluster and decrement the preset number of clusters k by 1. By using dynamic clustering center optimization, the clustering analysis trigger times and the automatic k-value adjustment mechanism enable the algorithm to adapt to path patterns with different spatial structures.

[0092] Determine the node category of the lighting node according to the classification model obtained after iterative training. If the node mean of the lighting node is higher than the preset mean, then determine that the lighting node is a target path node.

[0093] Among them, the node categories include target path nodes and non-path nodes; the preset mean can be the smallest value among the means of each cluster. Specifically, after clustering is completed, calculate the mean value |S j | of all data points within each cluster according to the obtained classification model, and determine which cluster the trigger times of this lighting node N i are in. If the mean of this cluster is the smallest among all clusters, then this node is a non-path node; otherwise, it is a target path node. Based on the path recognition technology of the improved clustering algorithm, it can accurately analyze the user movement trajectories in typical complex topological structures such as intersections and circular areas, ensure the complete coverage of the continuous lighting path, and eliminate the lighting blind spots in traditional solutions.

[0094] It should be noted that the above examples are only for understanding the present application and do not constitute a limitation on the lighting control method of the present application. Based on this technical concept, more forms of simple transformations are within the protection scope of the present application.

[0095] In some embodiments of the present application, a hierarchical lighting instruction is generated according to the triggered times ratio, target path nodes, and global graph data structure, including:

[0096] Obtain a preset change ratio.

[0097] If the triggered times ratio is not greater than the preset change ratio, a hierarchical lighting instruction is generated according to the target path nodes and the global graph data structure.

[0098] In some specific embodiments, the preset change ratio is the change ratio of the preset triggered times ratio, and the preset change ratio can be set according to actual needs, such as 5% or 10%. The gateway determines the path mode solidification based on the triggered times ratio. Specifically, it can determine whether the lighting nodes are continuously triggered within a time interval. Taking the preset change ratio of 10% as an example, the size of the triggered times ratio and the preset change ratio is judged. If the triggered times ratio of the lighting node is less than the preset change ratio, that is, the triggered times ratio of the node < 10%, it can be determined that the triggered times between each node have reached a certain number and the ratio no longer changes, and the triggered state of the lighting node tends to be stable. At this time, a hierarchical lighting instruction can be generated based on the hierarchical response mechanism. The hierarchical lighting instruction includes node identifiers (such as lighting node IDs) and lighting parameters (such as parameters of lighting duration).

[0099] In some embodiments of the present application, the global graph data structure includes triggered nodes, one-hop neighboring nodes, and two-hop neighboring nodes, and the hierarchical lighting instruction includes a first-level lighting instruction, a second-level lighting instruction, and a third-level lighting instruction;

[0100] First-level lighting instruction: Send an instruction for full-brightness lighting to one-hop neighboring nodes.

[0101] When the lighting devices within the range of the triggered node area have entered the lighting state, for one-hop neighboring nodes, the gateway generates a first-level lighting instruction and sends it to the one-hop neighboring nodes. After receiving the instruction, the one-hop neighboring nodes immediately activate the lighting devices within the range for full-brightness lighting to replace the traditional manual configuration mode and realize pre-illumination of the associated nodes on the user's common path.

[0102] Second-level lighting instruction: If the two-hop neighboring nodes of the triggered node belong to the target path nodes, send an instruction for full-brightness lighting to the one-hop neighboring nodes and the two-hop neighboring nodes.

[0103] For two-hop neighboring nodes, corresponding lighting control instructions need to be generated in combination with node attributes. Specifically, the gateway determines whether the attributes of the two-hop neighboring nodes are target path nodes according to the obtained analysis results. If so, secondary lighting instructions are generated and sent to the two-hop neighboring nodes. After receiving the instructions, the two-hop neighboring nodes immediately activate the lighting devices within the area for full-brightness lighting to implement the pre-illumination strategy.

[0104] Tertiary lighting instructions: If the two-hop neighboring nodes of the triggered node do not belong to the target path nodes, a full-brightness lighting instruction is sent to the one-hop neighboring nodes, and a low-brightness instruction or a turn-off instruction is sent to the two-hop neighboring nodes.

[0105] If the gateway determines according to the analysis results that the two-hop neighboring nodes do not belong to the target path nodes, it does not belong to the user's common path. At this time, tertiary lighting instructions should be generated to only control the lighting devices within the area of the one-hop neighboring nodes for full-brightness lighting, while controlling the lighting devices within the area of the two-hop neighboring nodes not to be lit, or controlling the lighting devices within the area of the two-hop neighboring nodes for low-brightness lighting. The current and nearby positions of the lighting user are instantaneously responded to by the primary lighting instructions, and the potential moving directions are pre-responded to by the secondary lighting instructions and the tertiary lighting instructions, so that the lighting delay during the user's movement is reduced to imperceptible, and at the same time, the ineffective lighting energy consumption is reduced. In some specific embodiments, multi-level lighting instructions can also be set according to the actual application situation. For example, a quaternary lighting instruction can also be set to send a low-power instruction (such as turning off the main lighting and retaining a weak presence induction) to the lighting nodes that do not belong to the triggered node, the one-hop neighboring node, the two-hop neighboring node, and the target path, further reducing the ineffective lighting energy consumption.

[0106] In some embodiments of the present application, the trigger detection data further includes: continuous trigger time, and the lighting control method further includes:

[0107] Obtain a preset time threshold.

[0108] Among them, the continuous trigger time is the time when the one-hop neighboring node of the triggered node is triggered, that is, the time when the triggered node and its one-hop neighboring node are continuously triggered. The preset time threshold can be set to different values according to different scenarios and the actual deployment distance of the lighting nodes. For example, when the average deployment interval of the lighting nodes is 10m, it can be set to 30s, and when the average deployment is 2m, it can be set to 10s.

[0109] If the continuous trigger time is greater than the preset time threshold, it is determined that the path lighting mode is the stationary mode, and the gateway does not send secondary lighting instructions to the two-hop neighboring nodes; or,

[0110] If the continuous trigger time is less than the preset time threshold, it is determined that the path lighting mode is the moving mode, and the gateway sends secondary lighting instructions to the two-hop neighboring nodes.

[0111] Specifically, if the continuous triggering time is greater than the preset time threshold, it indicates that the one-hop adjacent nodes of the triggered node within the predetermined time are not triggered, that is, the user is temporarily in a stationary state, then the gateway does not send a secondary lighting instruction to the two-hop adjacent nodes, reducing lighting loss; if the continuous triggering time is less than the preset time threshold, it indicates that the one-hop adjacent nodes of the triggered node within the predetermined time are triggered, that is, the user is in a moving state, then the gateway sends a secondary lighting instruction to the two-hop adjacent nodes, so that the lighting devices within the range of the two-hop adjacent node area are triggered for lighting. Compared with the traditional full-area lighting or simple chain-triggered lighting scheme, the linkage lighting strategy of the present application can pre-light the associated nodes of the actual common path, upgrade the lighting control from local node linkage to global path optimization, meet the real-time requirements of complex scenarios, ensure the complete coverage of the continuous lighting path, and eliminate the lighting blind area in the traditional scheme.

[0112] Referring to Figure 3 , an embodiment of the present application further provides a lighting control system, including:

[0113] A node network 31, the node network 31 includes a plurality of lighting nodes 32 as Figure 1 shown;

[0114] At least one gateway 33 as Figure 2 shown;

[0115] The node network and the gateway cooperate to implement the steps of the lighting control method as Figure 1 shown; or,

[0116] Implement the steps of the lighting control method as Figure 2 shown.

[0117] In some specific embodiments, as Figure 3As shown, taking a gateway 33 and a node network 31 with multiple lighting nodes 32 as an example, the gateway 33 is wirelessly communicatively connected to the multiple lighting nodes 32, and the multiple lighting nodes 32 are wirelessly communicatively connected to each other. The multiple lighting nodes 32 detect and collect trigger detection data through occupancy sensors 34, and collect adjacent data from adjacent nodes through wireless communication, and upload the trigger detection data and the adjacent data to the gateway 33 together. After receiving the adjacent data of each lighting node, the gateway 33 generates a global graph data structure according to the unique ID of the lighting node to store the corresponding data. And through an improved clustering algorithm, using dynamic clustering center optimization, based on the clustering analysis of the trigger times and the automatic k-value adjustment mechanism, it is calculated whether the lighting node is recognized as a target path node, and then a hierarchical lighting instruction is generated correspondingly and sent to the multiple lighting nodes 32. The multiple lighting nodes 32 receive the hierarchical lighting instruction sent by the gateway 33, and trigger the lighting devices 35 within their area according to the hierarchical lighting instruction for lighting, realizing the automatic generation of inter-area linked lighting configuration, improving the deployment efficiency of linked lighting strategies in complex scenarios, accurately analyzing the user movement trajectories in typical complex topological structures such as intersections and circular areas, ensuring the complete coverage of continuous lighting paths, eliminating the lighting blind spots in traditional solutions, and having the capabilities of advanced user behavior perception and scene adaptive evolution, thus solving the technical problems of complex configuration, poor scene adaptability and rigid response mechanism in traditional solutions.

[0118] This application provides a lighting control computer device, which includes: at least one processor; and a memory communicatively connected to the at least one processor; wherein, the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to execute the lighting control method in the first embodiment above.

[0119] Refer to the following Figure 4 , which shows a schematic structural diagram of a lighting control computer device suitable for implementing the embodiments of the present application. The lighting control computer device in the embodiments of the present application may include, but is not limited to, mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, personal digital assistants (PDAs), tablet computers (PADs), portable multimedia players (PMPs), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 4 The lighting control computer device shown is only an example and should not impose any limitations on the functions and usage scopes of the embodiments of the present application.

[0120] AsFigure 4 As shown, the lighting control computer device may include a processing device 1001 (such as a central processing unit, a graphics processing unit, etc.), which may perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 1002 or a program loaded from a storage device 1003 into a random access memory (RAM) 1004. In the RAM 1004, various programs and data required for the operation of the lighting control computer device are also stored. The processing device 1001, the ROM 1002, and the RAM 1004 are connected to each other through a bus 1005. An input / output (I / O) interface 1006 is also connected to the bus. Generally, the following systems may be connected to the I / O interface 1006: an input device 1007 including, for example, a touch screen, a touchpad, a keyboard, a mouse, an image sensor, a microphone, an accelerometer, a gyroscope, etc.; an output device 1008 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 1003 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 1009. The communication device 1009 may allow the lighting control computer device to communicate with other devices wirelessly or wiredly to exchange data. Although the lighting control computer device with various systems is shown in the figure, it should be understood that it is not required to implement or have all the shown systems. More or fewer systems may be implemented or had alternatively.

[0121] In particular, according to the embodiments disclosed in the present application, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, the embodiments disclosed in the present application include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes program codes for performing the methods shown in the flowcharts. In such an embodiment, the computer program may be downloaded and installed from a network through the communication device, or installed from the storage device 1003, or installed from the ROM 1002. When the computer program is executed by the processing device 1001, the above functions defined in the methods of the embodiments disclosed in the present application are executed.

[0122] The lighting control computer device provided by the present application adopts the lighting control method in the above embodiments, and can solve the technical problems of complex configuration, poor scene adaptability, and rigid response mechanism in the traditional solutions. Compared with the prior art, the beneficial effects of the lighting control computer device provided by the present application are the same as those of the lighting control method provided by the above embodiments, and other technical features in the lighting control computer device are the same as those disclosed in the previous embodiment method, and will not be elaborated here.

[0123] It should be understood that the various parts disclosed in this application can be implemented by hardware, software, firmware, or a combination thereof. In the description of the above embodiments, specific features, structures, materials, or characteristics can be combined in a suitable manner in any one or more embodiments or examples.

[0124] As described above, the above are only specific embodiments of this application, but the protection scope of this application is not limited thereto. Any person skilled in the art within the technical scope disclosed in this application can easily think of changes or substitutions, which should all be covered within the protection scope of this application. Therefore, the protection scope of this application should be subject to the protection scope of the claims.

[0125] This application provides a computer-readable storage medium having computer-readable program instructions (i.e., computer programs) stored thereon, and the computer-readable program instructions are used to execute the lighting control method in the above embodiments.

[0126] The computer-readable storage medium provided by this application can be, for example, a USB flash drive, but is not limited to electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices, or any combination of the above. More specific examples of the computer-readable storage medium may include, but are not limited to: electrical connections with one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM), or flash memory, optical fibers, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the above. In this embodiment, the computer-readable storage medium can be any tangible medium that contains or stores a program, and this program can be used by or in combination with an instruction execution system, device, or device. The program code contained on the computer-readable storage medium can be transmitted by any appropriate medium, including but not limited to: wires, optical cables, radio frequency (RF), etc., or any suitable combination of the above.

[0127] The above computer-readable storage medium can be included in the lighting control computer device; or it can exist separately without being assembled into the lighting control computer device.

[0128] The above computer-readable storage medium carries one or more programs, which, when executed by the lighting control computer device, cause the lighting control computer device to: realize the automatic generation of inter-region linkage configuration lighting by constructing a dynamic path intelligent recognition and multi-level response cooperation mechanism, improve the deployment efficiency of linkage lighting strategies in complex scenarios, significantly reduce the system maintenance cost, and at the same time, based on an improved clustering algorithm, accurately analyze the user movement trajectories in typical complex topological structures such as intersections and circular areas, ensure the complete coverage of continuous lighting paths, eliminate the lighting blind spots in traditional solutions, and have the ability of advanced user behavior perception and scene adaptive evolution, so as to solve the technical problems of complex configuration, poor scene adaptability and rigid response mechanism in traditional solutions.

[0129] Computer program code for performing the operations of the present application may be written in one or more programming languages or combinations thereof. The programming languages include object-oriented programming languages such as Java, Smalltalk, C++, and also include conventional procedural programming languages such as the "C" language or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, executed as a stand-alone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., by connecting through the Internet using an Internet service provider).

[0130] The flowcharts and block diagrams in the accompanying drawings illustrate the possible architectures, functions, and operations of systems, methods, and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagram may represent a module, a program segment, or a part of code that contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the blocks may occur in a different order than marked in the accompanying drawings. For example, two consecutive blocks shown may actually be executed substantially in parallel, and they may sometimes be executed in the reverse order, depending on the functions involved. It should also be noted that each block in the block diagram and / or flowchart, and the combination of blocks in the block diagram and / or flowchart, may be implemented by a dedicated hardware-based system for performing the specified functions or operations, or may be implemented by a combination of dedicated hardware and computer instructions.

[0131] The modules involved in the embodiments of the present application can be implemented in software or in hardware. In some cases, the name of the module does not constitute a limitation on the unit itself.

[0132] The readable storage medium provided by the present application is a computer-readable storage medium. The computer-readable storage medium stores computer-readable program instructions (i.e., computer programs) for executing the above-mentioned lighting control method, and can solve the technical problems of complex configuration, poor scene adaptability, and rigid response mechanism in the traditional solution. Compared with the prior art, the beneficial effects of the computer-readable storage medium provided by the present application are the same as those of the lighting control method provided by the above embodiments, and will not be elaborated here.

[0133] The present application also provides a computer program product, including a computer program, and when the computer program is executed by a processor, it implements the steps of the lighting control method as described above.

[0134] The computer program product provided by the present application can solve the technical problems of complex configuration, poor scene adaptability, and rigid response mechanism in the traditional solution. Compared with the prior art, the beneficial effects of the computer program product provided by the present application are the same as those of the lighting control method provided by the above embodiments, and will not be elaborated here.

[0135] The above are only some embodiments of the present application, and do not limit the patent scope of the present application. Any equivalent structural transformation made by using the content of the specification and drawings of the present application under the technical concept of the present application, or any direct / indirect application in other related technical fields, is included in the patent protection scope of the present application.

Claims

1. A lighting control method, applied to a node network, the node network including a plurality of lighting nodes, characterized in that, The method includes: Performing an area scan operation to generate trigger detection data; Sending broadcasts to multiple neighboring nodes within the communication range and receiving feedback information to obtain adjacency data; Uploading the trigger detection data and the adjacency data to a gateway; Receiving a hierarchical lighting instruction sent by the gateway and performing a lighting operation according to the hierarchical lighting instruction.

2. The method according to claim 1, wherein The sending broadcasts to multiple neighboring nodes within the communication range and receiving feedback information to obtain adjacency data includes: Each of the lighting nodes sends an inquiry broadcast signal to multiple neighboring nodes within the communication range; Receiving response confirmation signals fed back by multiple neighboring nodes; Establishing an adjacency list data structure according to the response confirmation signals, where the adjacency list data structure includes: node identifier, signal strength parameter, and update time; Determining the adjacency data according to the node identifier, the signal strength parameter, and the update time.

3. The method according to claim 2, characterized in that, The determining the adjacency data according to the node identifier, the signal strength parameter, and the update time includes: Obtaining a signal strength threshold range and determining whether the signal strength parameter falls within the signal strength threshold range; If the signal strength parameter falls within the signal strength threshold range, establishing an adjacency relationship according to the node identifier, the signal strength parameter, and the update time to obtain the adjacency data.

4. A lighting control method is applied to a gateway, where there is at least one gateway, and is characterized in that, The method includes: Receiving trigger detection data and adjacency data uploaded by multiple lighting nodes, where the trigger detection data includes: trigger times, proportion of triggered times; Generating and storing a global graph data structure according to the adjacency data; Performing clustering analysis on the trigger times based on a preset path clustering algorithm to obtain target path nodes; Generating a hierarchical lighting instruction according to the proportion of triggered times, the target path nodes, and the global graph data structure; Sending the hierarchical lighting instruction to multiple lighting nodes so that the multiple lighting nodes perform lighting operations according to the hierarchical lighting instruction.

5. The method according to claim 4, wherein The performing clustering analysis on the trigger times based on a preset path clustering algorithm to obtain target path nodes includes: Performing clustering processing on the trigger times according to a classification node data vector and a preset number of clusters to obtain initial clustering centroids; Iteratively training the initial clustering centroids based on the classification node data vector, merging adjacent clusters according to a dynamic merging threshold, and correspondingly adjusting the preset number of clusters; Determining the node category of the lighting node according to the classification model obtained after iterative training. If the node mean of the lighting node is higher than a preset mean, determining that the lighting node is a target path node.

6. According to the method of claim 4, the generating a hierarchical lighting instruction according to the proportion of triggered times, the target path nodes, and the global graph data structure includes: Obtaining a preset change ratio; If the proportion of triggered times is not greater than the preset change ratio, generating the hierarchical lighting instruction according to the target path nodes and the global graph data structure.

7. The method according to claim 6, characterized in that The global graph data structure includes a triggered node, one-hop neighboring nodes, and two-hop neighboring nodes, and the hierarchical lighting instructions include first-level lighting instructions, second-level lighting instructions, and third-level lighting instructions; The first-level lighting instruction: sending an instruction for full-brightness lighting to the one-hop neighboring nodes; The second-level lighting instruction: if the two-hop neighboring nodes of the triggered node belong to the target path nodes, sending an instruction for full-brightness lighting to the one-hop neighboring nodes and the two-hop neighboring nodes; The third-level lighting instruction: if the two-hop neighboring nodes of the triggered node do not belong to the target path nodes, sending an instruction for full-brightness lighting to the one-hop neighboring nodes and sending an instruction for low brightness or an off instruction to the two-hop neighboring nodes.

8. The method according to claim 7, characterized in that, The trigger detection data further includes: continuous trigger time, and the method further includes: Obtaining a preset time threshold; If the continuous trigger time is greater than the preset time threshold, determining that the path lighting mode is the stationary mode, and the gateway does not send the second-level lighting instruction to the two-hop neighboring nodes; or, If the continuous trigger time is less than the preset time threshold, determining that the path lighting mode is the mobile mode, and the gateway sends the second-level lighting instruction to the two-hop neighboring nodes.

9. A lighting control system, characterized in that, Including: A node network, the node network including a plurality of the lighting nodes as described in any one of claims 1-3; At least one gateway as described in any one of claims 4-8; The node network and the gateway cooperate to implement the steps of the lighting control method as described in any one of claims 1-3; or, Implement the steps of the lighting control method as described in any one of claims 4-8.

10. A computer device, characterized in that, The computer device includes a memory and a processor, and a computer program is stored on the memory. When the processor executes the computer program, the steps of the lighting control method as described in any one of claims 1-3 are implemented; Or, Implement the steps of the lighting control method as described in any one of claims 4-8.

11. A computer-readable storage medium, characterized in that, The storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the lighting control method as described in any one of claims 1-3 can be implemented; or, Implement the steps of the lighting control method as described in any one of claims 4-8.

12. A computer program product, characterized in that, The computer program product includes a computer program, and when the computer program is executed by a processor, the steps of the lighting control method as described in any one of claims 1-3 are implemented; or, Implement the steps of the lighting control method as described in any one of claims 4-8.

Images