Data processing: artificial intelligence – Knowledge processing system – Knowledge representation and reasoning technique
Reexamination Certificate
2011-05-24
2011-05-24
Holmes, Michael (Department: 2129)
Data processing: artificial intelligence
Knowledge processing system
Knowledge representation and reasoning technique
Reexamination Certificate
active
07949624
ABSTRACT:
A system includes a coordinator configured to generate a first offer representing a possible solution to a problem being solved. The coordinator is configured to generate the first offer using a first model. The system also includes multiple cooperators each configured to receive the first offer and to determine if a sub-problem associated with the problem can be solved based on the first offer and using a second model. Each cooperator is also configured to identify an infeasibility and communicate the infeasibility to the coordinator when the sub-problem cannot be solved based on the first offer. The coordinator is further configured to receive the infeasibility, generate a second offer by reducing a deviation between the first offer and a consensus of the cooperators, and provide the second offer to the cooperators. The consensus of the cooperators is based on a level of the first offer that each cooperator can achieve.
REFERENCES:
patent: 6865609 (2005-03-01), Gubbi et al.
patent: 7389350 (2008-06-01), Charters et al.
patent: 7409378 (2008-08-01), Castellani et al.
patent: 7454400 (2008-11-01), Andreoli et al.
patent: 7698218 (2010-04-01), Opaluch et al.
patent: 7716180 (2010-05-01), Vermeulen et al.
patent: 7739239 (2010-06-01), Cormie et al.
patent: 7778972 (2010-08-01), Cormie et al.
patent: 7792699 (2010-09-01), Kwei
patent: 7848966 (2010-12-01), Charuk et al.
Delay efficient sleep scheduling in wireless sensor networks, Lu, G.; Sadagopan, N.; Krishnamachari, B.; Goel, A.; INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE vol. 4 Digital Object Identifier: 10.1109/INFCOM.2005.1498532 Publication Year: 2005 , pp. 2470-2481 vol. 4.
Learning and mathematical reasoning using adaptive signal processing techniques, Mirzai, A.R.; Cowan, C.F.N.; Crawford, T.M.; Application of Artificial Intelligence Techniques to Signal Processing , IEE Colloquium on Publication Year: 1989 , pp. 2/1-2/4.
A game theoretic analysis of service competition and pricing in heterogeneous wireless access networks, Niyato, D.; Hossain, E.; Wireless Communications, IEEE Transactions on vol. 7 , Issue: 12 , Part: 2 Digital Object Identifier: 10.1109/T-WC.2008.070609 Publication Year: 2008 , pp. 5150-5155.
LCCF: A scheduling algorithm for asynchronous optical switches, Xin Li; Zhen Zhou; Hamdi, M.; High Performance Switching and Routing, 2005. HPSR. 2005 Workshop on Digital Object Identifier: 10.1109/HPSR.2005.1503198 Publication Year: 2005 , pp. 78-82.
Jeffrey D. Kelly et al., “Apparatus and Method for Order Generation and Management to Facilitate Solutions of Decision-Making Problems”, U.S. Appl. No. 12/044,639, filed Mar. 7, 2008.
Jeffrey D. Kelly et al., “Hierarchical decomposition heuristic for scheduling: Coordinated reasoning for decentralized and distributed decision-making problems”, Computers & Chemical Engineering, 2007, 22 pages.
Jeffrey D. Kelly, “The Unit-Operation-Stock Superstructure (UOSS) and the Quantity-Logic-Quality Paradigm (QLQP) for Production Scheduling in the Process Industries”, MISTA 2005 Conference, New York City, Jul. 18 to 21, 2005, 7 pages.
Jeffrey D. Kelly, “Modeling Production-Chain Information”, Information Technology, www.cepmagazine.org, Feb. 2005, pp. 28-31.
“Production Scheduler” Engineering Guide, Honeywell, Feb. 2008, 53 pages.
Robert Fourer et al., “Optimization Services 1.0 User's Manual”, Jan. 16, 2008, 77 pages.
Jeffrey D. Kelly et al., “A Projectional Model of Data for Complexity Management of Enterprise-Wide Optimization Models”, Honeywell Process Solutions, 2007, 42 pages.
Matthew H. Bassett et al., “Decomposition Techniques for the Solution of Large-Scale Scheduling Problems”, Process Systems Engineering, AIChE Journal, vol. 42, No. 12, Dec. 1996, pp. 3373-3387.
R. Cheng et al., “Price-driven coordination method for solving plant-wide MPC problems”, Journal of Process Control, 2006, 10 pages.
George B. Dantzig et al., “Decomposition Principle for Linear Programs”, Nov. 24, 1959, pp. 101-111.
Muge Erdirik Dogan et al., “A Decomposition Method for the Simultaneous Planning and Scheduling of Single-Stage Continuous Multiproduct Plants”, Ind. Eng. Chem. Res., 2006, pp. 299-315.
J. Fraser Forbes et al., “Model Accuracy for Economic Optimizing Controllers: The Bias Update Case”, Ind. Eng. Chem. Res., 1994, pp. 1919-1929.
A. .M. Geoffrion, “Generalized Benders Decomposition”, Journal of Optimization Theory and Applications, vol. 10, No. 4, 1972, pp. 237-260.
Kurt Jornsten et al., “Decomposition and iterative aggregation in hierarchical and decentralised planning structures”, European Journal of Operational Research, 1995, pp. 120-141.
Rinaldo A. Jose et al., “Pricing Interprocess Streams Using Slack Auctions”, AIChE Journal, 1999, pp. 1-53.
Ramkumar Karuppiah et al., “A Lagrangean based Branch-and-Cut algorithm for global optimization of nonconvex Mixed-Integer Nonlinear Programs with decomposable structures”, Department of Chemical Engineering, Carnegie Mellon University, Jul. 2006, pp. 1-33.
Jeffrey D. Kelly, “Chronological Decomposition Heuristic for Scheduling: Divide and Conquer Method”, AIChE Journal, vol. 48, No. 12, Dec. 2002, pp. 2995-2999.
Jeffrey D. Kelly, “Production Modeling for Multimodal Operations”, Information Technology, www.cepmagazine.org, Feb. 2004, pp. 44-46.
Jeffrey D. Kelly, “Stock Decomposition Heuristic for Scheduling: A Priority Dispatch Rule Approach”, Aug. 2004, 16 pages.
J. D. Kelly, “Logistics: The missing link in blend scheduling optimization”, Hydrocarbon Processing, Jun. 2006, pp. 1-5.
Jeffrey D. Kelly et al., “Flowsheet decomposition heuristic for scheduling: A relax-and-fit method”, Computers & Chemical Engineering, 2004, pp. 1-8.
Joseph Z. Lu, “Challenging control problems and emerging technologies in enterprise optimization”, Control Engineering Practice, 2003, pp. 847-858.
Dan Wu et al., “Decomposition approaches for the efficient solution of short-term scheduling problems”, Computers & Chemical Engineering, 2003, pp. 1261-1276.
N. Zhang et al., “Novel modelling and decomposition strategy for total site optimisation”, Computers & Chemical Engineering, 2006, pp. 765-777.
Rinaldo A. Jose et al., “Auction-Driven Coordination for Plantwide Optimization”, 1998, 6 pages.
Danielle Zyngier et al., “Multi-Product Inventory Logistics Modeling in the Process Industries”, 2007, 35 pages.
Stephen J. Wilkinson, “Aggregate Formulations for Large-Scale Process Scheduling Problems”, a Thesis submitted for the degree of Doctor of Philosophy of the University of London and for the Diploma of Membership of the Imperial College, Mar. 1996, 175 pages.
Danielle Zyngier, “Monitoring, Diagnosing and Enhancing the Performance of Linear Closed-Loop Real-Time Optimization Systems”, a Thesis Submitted to the School of Graduate Studies in Partial Fulfillment of the Requirements for the Degree, Sep. 2006, 219 pages.
Rinaldo A. Jose, “On the Optimal Coordination of Profit Maximizing Divisions Using Auctions and Price Theory”, Nov. 6, 1999, 246 pages.
Kelly Jeffrey D.
Zyngier Danielle
Holmes Michael
Honeywell International , Inc.
Munck Carter, LLP
LandOfFree
Apparatus and method for hierarchical decomposition of... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Apparatus and method for hierarchical decomposition of..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Apparatus and method for hierarchical decomposition of... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2697387