US 12,217,027 B2
Visual programming of machine learning state machines
Yueqi Li, San Jose, CA (US)
Assigned to Deere & Company, Moline, IL (US)
Filed by Deere & Company, Moline, IL (US)
Filed on Aug. 11, 2023, as Appl. No. 18/233,256.
Application 18/233,256 is a continuation of application No. 17/408,866, filed on Aug. 23, 2021, granted, now 11,755,345.
Prior Publication US 2023/0385083 A1, Nov. 30, 2023
Int. Cl. G06F 8/35 (2018.01); G06F 8/34 (2018.01); G06F 9/451 (2018.01); G06F 11/36 (2006.01); G06N 3/042 (2023.01); G06N 3/045 (2023.01); G06N 20/00 (2019.01); G06F 17/12 (2006.01); G06Q 30/0241 (2023.01); G06T 11/20 (2006.01); G07G 5/00 (2006.01)
CPC G06F 8/34 (2013.01) [G06F 9/451 (2018.02); G06F 11/3608 (2013.01); G06N 3/042 (2023.01); G06N 3/045 (2023.01); G06N 20/00 (2019.01); G06F 17/12 (2013.01); G06Q 30/0277 (2013.01); G06T 11/206 (2013.01); G07G 5/00 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A method implemented using one or more processors, comprising:
causing one or more graphical user interfaces (GUIs) to be rendered on one or more displays, wherein each GUI of the one or more GUIs includes a working canvas on which a plurality of nodes corresponding to at least some of a plurality of available logical routines are manipulable to form a graph defining a machine learning state machine, wherein edges of the graph represent logical couplings between the logical routines of the plurality of available logical routines that are represented by the nodes of the graph;
identifying first and second partially redundant nodes in the graph, the first and second partially redundant nodes having at least one overlapping logical operation, the first partially redundant node having a first non-overlapping logical operation, the second partially redundant node having a second non-overlapping logical operation, wherein the at least one overlapping logical operation represents execution of one or more machine learning models;
merging the at least one overlapping logical operation of the first and second partially redundant nodes into a consolidated logical routine;
logically coupling the first non-overlapping logical operation with the consolidated logical routine; and
logically coupling the second non-overlapping logical operation with the consolidated logical routine.