Robot Operation Time-Slot Control for RPA Server Load Balancing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing robotic process automation (RPA) server systems face challenges in managing and monitoring a large number of robots, as the upper limit for robot registration is typically around 100 to 1000, leading to operational obstacles and complex management as the number of robots increases.
Innovation Solution
A control system that acquires log information on the operating state of robots, calculates load in each time slot, identifies high-load time slots, and reschedules robots to distribute the load by changing their operation time slots, thereby reducing server load and simplifying management.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If the number of robots registered in an RPA server is increased beyond 100-1000, then the system can handle more robotic processes, but the server becomes unable to monitor and control the robots effectively
Solution Approach 1:
The patent divides the robot population into multiple groups, each monitored by a dedicated server. Instead of having one server monitor all robots, the system segments the monitoring function across multiple servers, allowing each server to handle a manageable number of robots while the overall system supports thousands of robots.
Solution Approach 2:
The patent introduces a hierarchical monitoring structure where servers monitor robots within their groups, and a central management system coordinates across servers. This adds a dimensional layer to the monitoring architecture, enabling scalable monitoring beyond the capacity of individual servers.
2Productivity
If manual operation of robots continues for half a year before adding more robots, then existing robots can be fully utilized, but adding 100 more robots creates operational obstacles for management
Solution Approach 1:
The patent implements automated load balancing and robot assignment systems that self-manage the distribution of robots to operators. Instead of manual management of robot assignments, the system automatically monitors robot status, operator availability, and task queues, dynamically assigning robots to operators based on current system state without requiring manual intervention.
Solution Approach 2:
The patent establishes continuous feedback loops where the system monitors robot performance, operator workload, and system load in real-time. This feedback enables dynamic adjustment of robot assignments and load distribution, allowing the system to adapt to changing conditions and maintain ease of operation even as the number of robots increases.
3Productivity
If all robots operate simultaneously, then maximum productivity is achieved, but the server load becomes too high to maintain system stability
Solution Approach 1:
The patent implements periodic scheduling and load distribution mechanisms where robots are assigned to tasks in time slots or batches rather than all simultaneously. The system periodically reviews system load and dynamically adjusts robot task assignments to distribute computational load across time, maintaining productivity while preventing server overload.
Solution Approach 2:
The patent creates a dynamic system where robot task assignments, operator allocations, and server loads are continuously adjusted based on real-time conditions. Instead of static assignments, the system dynamically reallocates resources to balance productivity goals with system capacity constraints, allowing maximum utilization without exceeding server capabilities.
Data Source
AI summary
A non-transitory computer-readable storage medium storing a program that causes a computer to execute a process, the process includes acquiring information in a log regarding an operating state of a plurality of robots; based on the acquired information in the log, calculating a first load in each time slot related to control of the plurality of robots; when there is a first time slot in which the first load is higher than or equal to a first threshold, extracting a robot that performs a first task, from the plurality of robots, in the first time slot; and changing a time slot for operating the extracted robot.