Resolving configuration conflicts using a multi-valued decision diagram
First Claim
1. A system comprising:
- a memory device adapted to store data representative of a multi-valued decision diagram (MDD) specifying a buildable space of all possible configurations of a vehicle, the MDD including a root node, a truth node, and at least one level of intervening nodes, each level of the MDD corresponding to a family of mutually-exclusive features represented by at least one node, each intervening node of a level connecting to nodes of a next adjacent level by outgoing edges having labels indicating valid features of the family and to nodes of a prior adjacent level by incoming edges that are outgoing edges of the prior adjacent level, such that a complete path from the root node through the outgoing edges to the truth node defines at least one of the valid configurations; and
a processor in communication with the memory, programmed toidentify an invalid configuration,generate a restricted buildable space, including todetermine an edit distance of each complete path indicative of a number of features to change the invalid configuration of that path to one of the valid configurations,identify a minimum of the edit distances, andremove configurations having edit distances larger than the minimum; and
identify at least one feature to change the invalid configuration to at least one valid configuration based on the restricted buildable space; and
generate output indicative of the at least one feature to change.
1 Assignment
0 Petitions
Accused Products
Abstract
A system is provided with a memory device and a processor. The memory device is adapted to store data representative of a multi-valued decision diagram (MDD) specifying a buildable space of all possible configurations of a vehicle. The processor is in communication with the memory and is programmed to identify an invalid configuration, and to generate a restricted buildable space, including to determine an edit distance of each complete path indicative of a number of features to change the invalid configuration of that path to one of the valid configurations, identify a minimum of the edit distances, and remove configurations having edit distances larger than the minimum. The processor is further programmed to identify at least one feature to change the invalid configuration to at least one valid configuration based on the restricted buildable space; and to generate output indicative of the at least one feature to change.
-
Citations
20 Claims
-
1. A system comprising:
-
a memory device adapted to store data representative of a multi-valued decision diagram (MDD) specifying a buildable space of all possible configurations of a vehicle, the MDD including a root node, a truth node, and at least one level of intervening nodes, each level of the MDD corresponding to a family of mutually-exclusive features represented by at least one node, each intervening node of a level connecting to nodes of a next adjacent level by outgoing edges having labels indicating valid features of the family and to nodes of a prior adjacent level by incoming edges that are outgoing edges of the prior adjacent level, such that a complete path from the root node through the outgoing edges to the truth node defines at least one of the valid configurations; and a processor in communication with the memory, programmed to identify an invalid configuration, generate a restricted buildable space, including to determine an edit distance of each complete path indicative of a number of features to change the invalid configuration of that path to one of the valid configurations, identify a minimum of the edit distances, and remove configurations having edit distances larger than the minimum; and identify at least one feature to change the invalid configuration to at least one valid configuration based on the restricted buildable space; and generate output indicative of the at least one feature to change. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
-
13. A method comprising:
-
storing, in a memory, data representative of a multi-valued decision diagram (MDD) specifying a buildable space of all possible configurations of a vehicle, the MDD including a root node, a truth node, and at least one level of intervening nodes, each level of the MDD corresponding to a family of mutually-exclusive features represented by at least one node, each intervening node of a level connecting to nodes of a next adjacent level by outgoing edges having labels indicating valid features of the family and to nodes of a prior adjacent level by incoming edges that are outgoing edges of the prior adjacent level, such that a complete path from the root node through the outgoing edges to the truth node defines at least one of the valid configurations; receiving input indicative of a non-guided resolution; identifying an invalid configuration; generating a restricted buildable space, including determining an edit distance of each complete path indicative of a number of features to change the invalid configuration of that path to one of the valid configurations, identifying a minimum of the edit distances, and removing configurations having edit distances larger than the minimum, generating a further restricted buildable space having a single target configuration, including determining a weight of each path in the restricted buildable space, indicative of a priority of its features, identifying the maximum weight of all paths, and removing configurations having weights that are less than the maximum weight; identifying at least one feature to change the invalid configuration to at least one valid configuration based on the further restricted buildable space; and generating output indicative of the at least one feature to change. - View Dependent Claims (14, 15, 16)
-
-
17. A method comprising:
-
storing, in a memory, data representative of a multi-valued decision diagram (MDD) specifying a buildable space of all possible configurations of a vehicle, the MDD including a root node, a truth node, and at least one level of intervening nodes, each level of the MDD corresponding to a family of mutually-exclusive features represented by at least one node, each intervening node of a level connecting to nodes of a next adjacent level by outgoing edges having labels indicating valid features of the family and to nodes of a prior adjacent level by incoming edges that are outgoing edges of the prior adjacent level, such that a complete path from the root node through the outgoing edges to the truth node defines at least one of the valid configurations; receiving input indicative of a guided resolution; identifying an invalid configuration; generating a restricted buildable space having multiple target configurations, including determining an edit distance of each complete path indicative of a number of features to change the invalid configuration of that path to one of the valid configurations, identifying a minimum of the edit distances, and removing configurations having edit distances larger than the minimum, identifying at least one family to change, including determining a bitset of the invalid configuration, determining a domain bitset of the restricted bhuildable space, calculating a bitwise conjunction of the invalid configuration bitset and the restricted buildable space bitset, and identifying the at least one family to change as a family having no active bits in the bitwise conjunction; and providing a message to a user that displays at least one feature to change from each family to change, to resolve the at least one feature. - View Dependent Claims (18, 19, 20)
-
Specification