Complexity-directed cooperative problem solving

Details Complexity-directed cooperative problem solving Complexity-directed cooperative problem solving

2006-08-08

2006-08-08

Starks, Jr., Wilbert L. (Department: 2129)

Data processing: artificial intelligence

Knowledge processing system

C706S019000, C706S060000

Reexamination Certificate

active

07089220

ABSTRACT:
A cooperative solving method for controlling a plurality of constraint problem solvers identifies complexity criteria, which provide direction for selecting and for transitioning between constraint problem solvers. The method includes randomly selecting a test point and determining whether the test point satisfies a first complexity criterion. A first constraint problem solver is selected, and an alternate test point is identified by the first solver if the complexity criterion has not been satisfied. If the alternate test point is a problem solution, it is transmitted to the system. If the alternate test point is not a problem solution or if the original randomly-selected test point satisfies the complexity criterion, a second constraint solver selects a new test point. If the new test point is a problem solution, it is transmitted to the system; if the new test point is not a solution, the cooperative solver is restarted.

REFERENCES:
patent: 5175601 (1992-12-01), Fitts
patent: 5870731 (1999-02-01), Trif et al.
patent: 6088690 (2000-07-01), Gounares et al.
patent: 6144923 (2000-11-01), Grosse
patent: 6144953 (2000-11-01), Sorrells et al.
patent: 6665262 (2003-12-01), Lindskog et al.
patent: 6865562 (2005-03-01), Fromherz et al.
patent: 6886010 (2005-04-01), Kostoff
patent: 6912515 (2005-06-01), Jackson et al.
U.S. Appl. No. 09/874,167, filed Jun. 4, 2001, Markus P.J. Fromherz et al.
U.S. Appl. No. 09/874,552, filed Jun. 4, 2001, Warren B. Jackson et al.
M.J.P. Fromherz, T. Hogg, W.B. Jackson, Y. Shang, Modular Robot Control and Continuous Cosntraint Satisfaction, Proc. IJCAI-01 Workshop on Modeling and solving Problems with Constraints, Seattle, WA, 2001, p. 47-56.
B. Kitts, Regulation of Complex Systems, Proc. 1stInt'l Conf. On Complex Systems, Sep. 1997.
O.C. Martin, Combining Simulated Annealing with Local Search Heuristics, G. Laporte and I. Osman, editors, Metaheuristics in Combinatorial Optimization, p. 57-75, Annuals of Operations Research vol. 63, 1996.
M.J. Murphy, E.L. Baker, Global Local Optimizer, http://www.llnl.gov/glo/09glo.html, LLNL unclassified code #960007, Lawrence Livermore National Laboratory, Livermore CA, Nov. 1995.
Y. Shang, M.P.J. Fromherz, T. Hogg, W.B. Jackson, Complexity of Continuous, 3-SAT-like Constraint Satisfaction Problems, Proc. IJCAI-01 Workshop on Stochastic Search Algorithms, Seattle, WAS, 2001, p. 49-54.

Affiliated with

Also associated with

Rating

Complexity-directed cooperative problem solving does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Complexity-directed cooperative problem solving, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity-directed cooperative problem solving will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3667737