Outer Rim Archives
Archives · 2017 · 9639813

Granted patent

Method and device for three-weight message-passing optimization scheme

Number
9639813
Published
2017-05-02
Filed
2013-12-16
Assignee
DISNEY ENTERPRISES, INC.
Inventors
Yedidia; Jonathan et al.
CPC
G06Q10/04
Verdict
Set aside three-weight message-passing optimization scheme - generic business optimization algorithm
Source
Google Patents · FreePatentsOnline

Abstract

A method and device determines an optimization solution for an optimization problem. The method includes receiving the optimization problem havingcost functions and variables in which each of the cost functions has a predetermined relationship with select ones of the variables. The method includes generating a first messagefor each of the cost functions for each corresponding variable based upon the respective predetermined relationship and a second message for each of the variables for each corresponding cost function based upon the respective predetermined relationship. The method includes generating a disagreement variable for each corresponding pair of variables and cost functions measuring a disagreement value between the first and second beliefs. The method includes repeating steps (b), (c), and (d) until a consensus is formed between the first and second messages until the optimization solution is determined based upon the consensus.

Background

BRIEF DESCRIPTION OF THE DRAWINGS(1) FIG. 1 shows adevice for generating an optimization solution according to an exemplary embodiment.(2) FIG. 2 shows a graphical model according to an exemplary embodiment.(3) FIG. 3A shows an unsolved puzzle.(4) FIG. 3B shows a solved puzzle using the device of FIG. 1 according to anexemplary embodiment.(5) FIG. 4 shows a packing problem and solution using the device of FIG. 1 according to an exemplary embodiment.(6) FIG. 5A shows a graphical model as appliedto a multi-agent trajectory planning problem according to an exemplary embodiment.(7) FIG. 5B shows input and output variables for each minimizer block of the graphical model of FIG. 5A according to an exemplary embodiment.(8) FIG. 6 shows a method of generating an optimization solution according to an exemplary embodiment.DETAILED DESCRIPTION(9) The present invention relates to a device and method for determining an optimization solution for anoptimization problem. The method comprises (a) receiving the optimization problem, the optimization problem including a plurality of cost functions and a plurality of variables, the cost functions representing possible costs for values of the variables in the optimization problem, each of the cost functions having a predetermined relationship with select ones of the variables; (b) generating a first message for each of the cost functions for each corresponding variable based upon the respective predetermined relationship, the first message in

Claims

1. A method, comprising: (a) receiving an optimization problem, the optimization problem including a plurality of cost functions and a plurality of variables, the cost functions representing possible costs for values of the variables in the optimization problem, each of the cost functions having a predetermined relationship with select ones of the variables, wherein the optimization problem comprises a trajectory planning problem; (b)generating a first message for each of the cost functions for each corresponding variablebased upon the respective predetermined relationship, the first message indicating a first belief that the corresponding variable has a first value when the optimization problem is solved, the first message having a respective first weight indicating a certainty of thefirst message; (c) generating a second message for each of the variables for each corresponding cost function based upon the respective predetermined relationship, the second message indicating a second belief that the corresponding variable has a second value when theoptimization problem is solved, the second message having a respective second weight indicating a certainty of the second message, wherein each of the first and second weights is one of a zero weight, an infinite weight, and a standard weight; (d) generating a disagreement variable for each corresponding pair of variables and cost functions measuring a disagreement value between the first and second beliefs; (e) repeating steps (b), (c), and (d)until a consensus is formed between the first and second messages based on the cost functions and the variables, a subsequent first message being modified based upon the second message, its corresponding second weight, and the corresponding disagreement variable, and asubsequent second message being modified based upon the first message, its corresponding first weight, and the corresponding disagreement variable; and (f) determining an optimization solution based upon the consensus, wherein the optimization solution comprises a solution to the trajectory planning problem. 10. A device, comprising: a processor coupled to a memory, wherein the processor is programmed to determine an optimization solution to an optimization problem by: (a) receiving the optimization problem, the optimization problem includes a plurality of cost functions and a plurality of variables, the cost functions representing possible costs for values of the variables in the optimization problem, each ofthe cost functions having a predetermined relationship with select ones of the variables,wherein the optimization problem comprises a trajectory planning problem; (b) generating a first message for each of the cost functions for each corresponding variable based upon the respective predetermined relationship, the first message indicating a first belief that the corresponding variable has a first value when the optimization problem is solved, the first message having a respective first weight indicating a certainty of the first message; (c) generating a second message for each of the variables for each corresponding cost function based upon the respective predetermined relationship, the second message indicating a second belief that the corresponding variable has a second value when the optimization problem is solved, the second message having a respective second weight indicating a certainty of the second message, wherein each of the first and second weights is one of a zero weight, an infinite weight, and a standard weight; (d) generating a disagreement variable for each corresponding pair of variables and cost functions measuring a disagreement value between the first and second beliefs; (e) repeating steps (b), (c), and (d) until a consensus is formed between the first and second messages based on the cost functions and thevariables, a subsequent first message being modified based upon the second message, its corresponding second weight, and the corresponding disagreement variable, and a subsequent second message being modified based upon the first message, its corresponding first weight, and the corresponding disagreement variable; and (f) determining the optimization solution based upon the consensus, wherein the optimization solution comprises a solution to thetrajectory planning problem. 18. A non-transitory computer readable storage medium with an executable program stored thereon, wherein the program instructs a microprocessor to perform operations comprising: (a) receiving an optimization problem, the optimization problem includes a plurality of cost functions and a plurality of variables, the cost functions representing possible costs for values of the variables in the optimization problem, each of the cost functions having a predetermined relationship with select ones of the variables, wherein the optimization problem comprises a trajectory planning problem; (b) generating a first message for each of the cost functions for each corresponding variable based upon the respective predetermined relationship, the first message indicating a first belief that the corresponding variables has a first value when the optimization problem is solved,the first message having a respective first weight indicating a certainty of the first message; (c) generating a second message for each of the variables for each corresponding cost function based upon the respective predetermined relationship, the second message indicating a second belief that the corresponding variable has a second value when the optimization is solved, the second message having a respective second weight indicating a certainty of the second message, wherein each of the first and second weights is one of a zero weight, an infinite weight, and a standard weight; (d) generating a disagreement variable foreach corresponding pair of variables and cost functions measuring a disagreement value between the first and second beliefs; (e) repeating steps (b), (c), and (d) until a consensus is formed between the first and second messages based on the cost functions and the variables, a subsequent first message being modified based upon the second message, its corresponding second weight, and the corresponding disagreement variable, and a subsequent second message being modified based upon the first message, its corresponding first weight, andthe corresponding disagreement variable; and (f) determining an optimization solution based upon the consensus, wherein the optimization solution comprises a solution to the trajectory planning problem.