Data processing: artificial intelligence – Miscellaneous
Reexamination Certificate
2008-07-22
2011-12-20
Rivas, Omar Fernandez (Department: 2122)
Data processing: artificial intelligence
Miscellaneous
C706S045000, C706S046000
Reexamination Certificate
active
08082220
ABSTRACT:
A device, system, and method for solving a plurality of sub-problems representing a main problem pertaining to an environment. An abstract graph corresponding to each of the sub-problems may be constructed in a computing system for each of the sub-problems. At least a first abstract graph of the abstract graphs may be resolved, for example, by decomposing one or more nodes of the first abstract graph. At least one of the one or more nodes of the first abstract graph may be associated with one or more nodes of others of the abstract graphs. At least one of the abstract graphs may be resolved using information obtained by the association. Other embodiments are described and claimed.
REFERENCES:
patent: 6574788 (2003-06-01), Levine et al.
patent: 6883148 (2005-04-01), Teig et al.
patent: 7480893 (2009-01-01), Berenbach et al.
patent: 7797177 (2010-09-01), Chung et al.
patent: 7860814 (2010-12-01), Plotnick
patent: 7954083 (2011-05-01), Berenbach et al.
patent: 7984012 (2011-07-01), Coury et al.
patent: 7987110 (2011-07-01), Cases et al.
patent: 2005/0005272 (2005-01-01), Moody et al.
patent: 2007/0094174 (2007-04-01), Hamadi et al.
patent: 2007/0094184 (2007-04-01), Emek et al.
patent: 2008/0065573 (2008-03-01), Macready
Stanton, “Hierarchical Task Analysis: Developments, Applications, and Extensions”, Applied Ergononics 37, 2006, pp. 55-79.
Lotem et al. “Using planning graphs for solving HTN planning problems”, AAAI-99 Proceedings, 1999, 7 pages.
Paolucci, M. et al., Interleaving Planning and Execution in a Multiagent Team Planning Environment, Electron. Transf. Artif. Intell., Feb. 2000, p. 33-43, 4, The Robotics Institute, Carnegie Mellon University, and IBM Research Lab in Haifa, the Tel Aviv Site.
Tambe Milind, Towards Flexible Teamwork, Journal of Artificial Intelligence 7, Sep. 1997, p. 83-124, Information Sciences Institute and Computer Science Department, University of Southern California, USA.
Grosz, Barbara J., et al., Collaborative Plans for Complex Group Action, Artificial Intelligence, 1996, p. 269-357, 86 (2).
Kutluhan Erol, et al., HTN Planning: Complexity and Expressivity, 1994, AAAI-94, p. 1123-1128, Computer Science Department, University of Maryland, US.
Kaminka A. Gal, et al., Integration of Coordination Mechanisms in the BITE Multi-Robot Architecture, ICRA-07, 2007, p. 2859-2866, Computer Science Department, Bar Ilan University, Israel.
Holte C. Robert, et al., Abstraction and reformulation in artificial intelligence, The Royal Society, Jun. 2003, p. 1197-1204, Department of Computing Science, University of Alberta, Canada.
Illah R. Nourbakhsh, Using Abstraction to Interleave Planning and Execution, Robotics Institute, 1998, Carnegie Mellon University, Pennsylvania, USA.
NP-Hard, from Wikipedia, http://en.wikipedia.org/wiki/NP-hard; saved Apr. 3, 2008.
Tanner Brian, et al., Grounding Abstractions in Predictive State Representations, IJCAI-07, p. 1077-1082, 2007, Department of Computing Science, Alberta, Canada.
International Search Report for International Application PCT/IL09/00389 dated Aug. 5, 2009.
Fridman Natalie
Hadad Meirav
Tzidon Dekel
Brown Rudnick LLP
Elbit Systems Ltd.
Fernandez Rivas Omar
LandOfFree
Computing solutions to problems using dynamic association... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Computing solutions to problems using dynamic association..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing solutions to problems using dynamic association... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4296665