METHOD AND SYSTEM FOR DYNAMICALLY INTEGRATING BOTS

• US 20170269972A1
• Filed: 03/24/2016
• Published: 09/21/2017
• Est. Priority Date: 03/17/2016
• Status: Active Grant

• Current Assignee: Wipro Limited
• Original Assignee: Wipro Limited
• Inventors: Hosabettu, Raghavendra, Ramanna, Ramprasad Kanakatte, Mannopantar, Raghottam, Ananthasankaranarayanan, Ponnusamy, Natarajan, Harihara Vinayakaram
• Granted Patent: US 10,372,508 B2
• Time in Patent Office: Days
• CPC Class Codes: G06F 2209/482 Application
• CPC Class Codes: G06F 9/46 Multiprogramming arrangements
• CPC Class Codes: G06F 9/4843 by program, e.g. task dispatcher, supervisor, operating system
• CPC Class Codes: G06F 9/4862 the task being a mobile agent, i.e. specifically designed to migrate
• CPC Class Codes: G06F 9/4868 with creation or replication
• CPC Class Codes: G06F 9/52 Program synchronisation; Mutual exclusion, e.g. by means of semaphores

Abstract

Disclosed herein is a method and system for dynamically integrating a plurality of BOTs. The method comprises creating the plurality of BOTs offering one or more automated services, wherein each of the plurality of BOTs has a common BOT structure comprising one or more field parameters. One or more predefined functions are assigned to each of the plurality of BOTs, wherein at least one of the one or more predefined functions comprises a function value. A maturity score for each of the plurality of BOTs is determined based on the one or more field parameters and the function value upon assigning the one or more predefined functions to each of the plurality of BOTs. Finally, the plurality of BOTs are integrated by synchronizing data amongst the plurality of BOTs based on the maturity score.

Claims

1. A method for dynamically integrating a plurality of BOTs, the method comprising:

creating, by a process automation system, the plurality of BOTs offering one or more automated services, wherein each of the plurality of BOTs has a common BOT structure comprising one or more field parameters;

assigning, by the process automation system, one or more predefined functions to each of the plurality of BOTs, wherein at least one of the one or more predefined functions comprises a function value;

determining, by the process automation system, a maturity score for each of the plurality of BOTs based on the one or more field parameters and the function value; and

integrating, by the process automation system, the plurality of BOTs by synchronizing data amongst the plurality of BOTs based on the maturity score.

2. The method as claimed in claim 1, wherein the one or more field parameters comprises at least one of a BOT identification (ID) number, BOT name, BOT type, BOT type version, BOT version, BOT group name, BOT state, source file format, source file name, source file path, data version, algorithm used for processing data, BOT status, frequency of requests to the BOT, time period of the requests, reward points and penalty points, last synchronization date, last synchronization status, BOT maturity, publish topics of the BOT, subscription topics of the BOT, last published event message, last received event message, association property, work flow property, source BOT ID, target BOT ID and deploy instance count of the BOT.

3. The method as claimed in claim 1, wherein assigning the one or more predefined functions to each of the plurality of BOTs further comprises updating at least one of the one or more predefined function values upon handling of an event by a BOT from the plurality of BOTs.

4. The method as claimed in claim 3, wherein the one or more predefined functions includes at least one of starting the BOT, stopping the BOT, assembling the BOT, deploying the BOT, detecting the maturity score of the BOT, assigning the maturity score of the BOT, detecting the rank order of the BOT, assigning the rank order of the BOT, verifying the BOT, checking state of the BOT, checking the status of the BOT and assigning the threshold values of frequency, time and total number of the reward points and the penalty points.

5. The method as claimed in claim 1, wherein the maturity score for each of the plurality of BOTs is determined when the number of requests handled by each of the plurality of BOTs individually is higher than a predefined number of requests.

6. The method as claimed in claim 5, wherein determining the maturity score for each of the plurality of BOTs is based on the number of requests handled by each of the plurality of BOTs, the number of reward points and the number of penalty points assigned to each of the plurality of BOTs.

7. The method as claimed in claim 1, wherein the plurality of BOTs are synchronized when at least one of the maturity score, the frequency of requests and the time period of the requests associated with one of the plurality of BOTs is higher than a predefined maturity score, predefined frequency of requests and predefined time period of the requests respectively.

8. The method as claimed in claim 1, wherein communication between each of the plurality of BOTs is established using at least one of an event message service model and one or more communication Application Program Interfaces (APIs) associated with each of the plurality of BOTs.

9. A process automation system for dynamically integrating a plurality of BOTs, the process automation system comprising:

a processor; and

a memory communicatively coupled to the processor, wherein

the memory stores processor-executable instructions, which, on execution, causes the processor to;

create the plurality of BOTs offering one or more automated services, wherein each of the plurality of BOTs has a common BOT structure comprising one or more field parameters;

assign one or more predefined functions to each of the plurality of BOTs, wherein at least one of the one or more predefined functions comprises a function value;

determine a maturity score for each of the plurality of BOTs based on the one or more field parameters and the function value; and

integrate the plurality of BOTs by synchronizing data amongst the plurality of BOTs based on the maturity score.

10. The system as claimed in claim 9, wherein the one or more field parameters comprises at least one of a BOT identification (ID) number, BOT name, BOT type, BOT type version, BOT version, BOT group name, BOT state, source file format, source file name, source file path, data version, algorithm used for processing data, BOT status, frequency of requests to the BOT, time period of the requests, reward points and penalty points, last synchronization date, last synchronization status, BOT maturity, publish topics of the BOT, subscription topics of the BOT, last published event message, last received event message, association property, work flow property, source BOT ID, target BOT ID and deploy instance count of the BOT.

11. The system as claimed in claim 9, wherein the instructions cause the processor to assign the one or more predefined functions to each of the plurality of BOTs by updating at least one of the one or more predefined function values upon handling of an event by a BOT from the plurality of BOTs.

12. The system as claimed in claim 11, wherein the one or more predefined functions includes at least one of starting the BOT, stopping the BOT, assembling the BOT, deploying the BOT, detecting the maturity score of the BOT, assigning the maturity score of the BOT, detecting the rank order of the BOT, assigning the rank order of the BOT, verifying the BOT, checking state of the BOT, checking the status of the BOT and assigning the threshold values of frequency, time and total number of the reward points and the penalty points.

13. The system as claimed in claim 9, wherein the instructions cause the processor to determine the maturity score for each of the plurality of BOTs when the number of requests handled by each of the plurality of BOTs individually is higher than a predefined number of requests.

14. The system as claimed in claim 13, wherein the maturity score for each of the plurality of BOTs is determined based on the number of requests handled by each of the plurality of BOTs, the number of reward points and the number of penalty points assigned to each of the plurality of BOTs.

15. The system as claimed in claim 9, wherein the instructions cause the processor to synchronize the plurality of BOTs when at least one of the maturity score, the frequency of requests and the time period of the requests associated with one of the plurality of BOTs is higher than a predefined maturity score, predefined frequency of requests and predefined time period of the requests respectively.

16. The system as claimed in claim 9, wherein each of the plurality of BOTs communicate using at least one of an event message service model and one or more communication Application Program Interfaces (APIs) associated with each of the plurality of BOTs.

17. A non-transitory computer-readable medium storing computer-executable instructions for:

create a plurality of BOTs offering one or more automated services, wherein each of the plurality of BOTs has a common BOT structure comprising one or more field parameters;

assign one or more predefined functions to each of the plurality of BOTs, wherein at least one of the one or more predefined functions comprises a function value;

determine a maturity score for each of the plurality of BOTs based on the one or more field parameters and the function value; and

integrate the plurality of BOTs by synchronizing data amongst the plurality of BOTs based on the maturity score.

18. The non-transitory computer-readable medium of claim 17 further storing computer-executable instructions for assigning the one or more predefined functions to each of the plurality of BOTs by updating at least one of the one or more predefined function values upon handling of an event by a BOT from the plurality of BOTs.

19. The non-transitory computer-readable medium of claim 17 further storing computer-executable instructions for determining the maturity score for each of the plurality of BOTs when the number of requests handled by each of the plurality of BOTs individually is higher than a predefined number of requests

20. The non-transitory computer-readable medium of claim 17 further storing computer-executable instructions for synchronizing the plurality of BOTs when at least one of the maturity score, the frequency of requests and the time period of the requests associated with one of the plurality of BOTs is higher than a predefined maturity score, predefined frequency of requests and predefined time period of the requests respectively.