Application integration system and method using intelligent agents for integrating information access over extended networks

• US 7,454,399 B2
• Filed: 05/24/2004
• Issued: 11/18/2008
• Est. Priority Date: 10/03/2000
• Status: Expired due to Term

• Current Assignee: Celcorp Incorporated
• Original Assignee: Celcorp Incorporated
• Inventors: Matichuk, Bruce
• Primary Examiner(s): Hirl; Joseph P
• Application Number:
  US10/851,639
• Publication Number:
  US 20050027495A1
• Time in Patent Office: 1,639 Days
• Field of Search: 703/53, 703/46, 703/14, 700/49
• US Class Current: 706/53
• CPC Class Codes: G06F 9/45512 Command shells

Abstract

Models that encapsulate information on how remote applications are controlled and data is accessed are created to be used by a runtime agent that intelligently reasons out goal-oriented plans and execute tasks to solve problem statements generated by a user interface or other software agents. The models may be used to assemble workflows using a reasoning process. In particular, the models of the present invention include a state that includes a planning state and a navigational value. In embodiments of the invention, the models may include intelligent agents, a loop state, submodel invocation that allows the models to invoke agents over a network, and the ability to integrate the three application layers in a computer.

Claims

1. A navigation planner computer system comprising:

a processor;

a computer memory coupled to said processor;

one or more computer application models stored in said computer memory, each of said computer application models describing how a remote computer application is controlled by a user and comprising a state comprising an action and one or more Boolean expressions;

a user interface not part of one or more computer applications represented by the one or more computer application models, the interface for receiving a problem statement from a user, the problem statement comprising an initial condition and an end condition, said problem statement to be solved using the remote computer application and a workflow generated by the navigation planner computer system using the one or more computer application models; and

a navigation planner stored in said computer memory;

wherein when said navigation planner receives the problem statement comprising the initial condition and an end condition, each of said conditions comprising one or more Boolean expressions, said navigation planner accesses said computer application models to create the workflow for solving said problem statement, said workflow comprising an ordered combination of said one or more computer application models such that said ordered combination of computer application models contains Boolean expressions that combine to satisfy said initial condition Boolean expression and end condition Boolean expression.

2. The navigation planner computer system of claim 1 wherein said state defines a loop that represents a series of repeated steps according to a Boolean expression associated with said state.

3. The navigation planner computer system of claim 1 wherein said state defines a pattern-type used in screen navigation wherein a start of an associated action is determined at run time by evaluating an on-screen pattern.

4. The navigation planner computer system of claim 1 wherein said state represents plural services which are connected.

5. The navigation planner computer system of claim 4 wherein a first action associated with said state invokes a second action that shares a knowledge base, such that knowledge accessed by said second action is not accessed by said first action.

6. A computer-implemented navigation planning method comprising:

receiving a problem statement from a user interface, said problem statement comprising an initial condition and an end condition, each of said conditions comprising one or more Boolean expressions, said problem statement to be solved using a remote computer application and a workflow, the interface for receiving the problem statement not part of the remote computer application;

defining one or more computer application models stored in computer memory, each of said computer application models describing how a remote computer application is controlled by a user and comprising a state comprising an action and one or more Boolean expressions; and

creating the workflow for solving said problem statement, said workflow comprising an ordered combination of said computer application models such that said ordered combination of computer application models contain Boolean expressions that combine to satisfy said initial condition Boolean expression and said end condition Boolean expression.

7. The navigation planning method of claim 6 wherein said state defines a loop that represents a series of repeated steps according to a Boolean expression associated with said loop state.

8. The navigation planning method of claim 6 wherein said state defines a pattern-type used in screen navigation wherein a start of an associated action is determined at run time by evaluating an on-screen pattern.

9. The navigation planning method of claim 6 wherein said state represents plural actions which are connected.

10. The navigation planning method of claim 9 wherein a first action associated with said state invokes a second action that shares a knowledge base, such that knowledge accessed by said second action is not accessed by said first action.

11. The navigation planning method of claim 6, where said ordered combination of computer application models comprises a first model and a second model, wherein a first model state Boolean expression after a first model action is compatible with a second model state Boolean expression before execution of a second model action.

12. The navigation planning method of claim 6, where creating a workflow further comprises creating a first workflow that comprises a first ordered combination of said computer application models, and wherein the navigation planning method further comprises:

creating a second workflow for solving said problem statement, said second workflow comprising a second ordered combination of said computer application models such that said second ordered combination of computer application models contain Boolean expressions that combine to satisfy said initial condition Boolean expression and said end condition Boolean expression, and

comparing said first and said second workflows and selecting between said first and second workflows based upon a pre-specified condition.

13. The navigation planning method of claim 12 wherein said pre-specified condition is counting numbers of actions in each of said first and said second ordered combinations and selecting the ordered combination having the lower number of counted actions.

14. The navigation planning method of claim 12 further comprising the steps of

implementing said first workflow;

monitoring the progress of said first workflow; and

implementing said second workflow if said first workflow fails.

15. A computer program product comprising a computer program embodied in a computer readable memory medium;

the computer program for performing navigation planning when executed, the computer program comprising;

a first code segment that receives a problem statement from a user interface, said problem statement comprising an initial condition and an end condition, each of said conditions comprising one or more Boolean expressions, said problem statement to be solved using a remote computer application and a workflow, the user interface for receiving the problem statement not part of the remote computer application;

a second code segment that accepts a user input to define one or more computer application models stored in computer memory, each of said computer application models describing how a remote computer application is controlled by a user and comprising a state comprising an action and one or more Boolean expressions; and

a third code segment that creates the workflow for solving said problem statement, said workflow comprising an ordered combination of said computer application models such that said ordered combination of computer application models contains Boolean expressions that combine to satisfy said initial condition Boolean expression and said end condition Boolean expression.

16. The computer program product of claim 15, wherein said state defines a loop that represents a series of repeated steps according to a Boolean expression associated with said loop.

17. The computer program product of claim 15, wherein said state comprises plural actions which are connected.

18. The computer program product of claim 17, wherein a first action associated with said state invokes a second action that shares a knowledge base, such that knowledge accessed by said second action is not accessed by said first action.

19. The computer program product of claim 15, wherein said ordered combination of models comprises a first model and a second model, where a first model state Boolean expression after a first model action is compatible with a second model state Boolean expression before execution of a second model action.

20. The computer program product of claim 15, where the third computer code segment creates a first workflow that comprises a first ordered combination of said models, and wherein the computer program further comprises:

a fourth code segment for creating a second workflow for solving said problem statement, said second workflow comprising a second ordered combination of said computer application models such that said second ordered combination of computer application models contain Boolean expressions that combine to satisfy said initial condition Boolean expression and said end condition Boolean expression,

a fifth code segment for implementing said first workflow;

a sixth code segment for monitoring the progress of said first workflow; and

a seventh code segment for implementing said second workflow if said first workflow fails.

21. A computer program product comprising a computer program embodied in a computer readable memory medium, the computer program for verifying a work flow when executed, the program comprising:

a first code segment that receives a problem statement from a user interface, said problem statement comprising an initial condition and an end condition, each of said conditions comprising one or more Boolean expressions, said problem statement to be solved using a remote application and a workflow, the user interface for receiving the problem statement not part of the remote computer application;

a second code segment that accepts a user input to define one or more computer application models stored in computer memory, each of said computer application models describing how a remote computer application is controlled by a user and comprising a state comprising an action and one or more Boolean expressions;

a third computer code segment that receives the workflow for solving said problem statement, said workflow comprising an ordered combination of said computer application models; and

a fourth code segment that evaluates said work flow by evaluating said ordered combination of computer application models to determine whether the Boolean expressions associated with said ordered combination of computer application models combine to satisfy said initial condition Boolean expression and said end condition Boolean expression.

22. The computer program of claim 21, where said ordered combination of computer application models comprises a first model and a second model, and wherein the fourth code segment further assesses whether a first model state Boolean expression after a first model action is compatible with a second model state Boolean expression before execution of a second model action.