# US 2023/0057537 A1 · Facilitating striated random restart during allocation of resources using a heuristic approach

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2023/0057537 A1
- Document ID: US20230057537A1
- Status: Published application
- Kind: A1
- Application number: 17/396,232
- Filed: 2021-08-06
- Published: 2023-02-23
- Earliest claimed: 2021-08-06
- Assignees: AT&T Intellectual Property I, L.P.
- Applicants: AT&T Intellectual Property I, L.P.
- Inventors: Rudolph Mappus; Laxmikanth Vallamsetla; Surekha Padala
- Web page: https://patentgrep.com/patent/US20230057537A1

## CPC

- G06Q 10/06312: {Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling}
- G06F 18/2113: by ranking or filtering the set of features, e.g. using a measure of variance or of feature cross-correlation
- G06F 18/23213: with fixed number of clusters, e.g. K-means clustering
- G06N 5/01: Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
- G06Q 10/063116: {Schedule adjustment for a person or group}
- G06N 20/00: Machine learning
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

Facilitating striated random restart during routing of resources using a heuristic approach is provided herein. Operations of a system can include, separating objects of a group of objects into a first grouping and a second grouping, assigning first objects of the first grouping and second objects of the second grouping to respective resource elements, resulting in a first classification. A search space is enabled and includes, at respective iterations of a group of iterations, selecting a defined priority level, removing third objects of the second grouping that do not satisfy the defined priority level from the first classification, and assigning the third objects to the respective resource elements, resulting in a second classification. The first objects and the second objects, other than the third objects, remain assigned according to the first classification. According to an implementation, the schedule search reduces a search space of the group of objects.

## Claims

### Claim 1

A method, comprising:
based on defined constraints associated with objects of a group of objects, allocating, by a system comprising a processor, the objects to respective resource elements of a group of resource elements, resulting in a first allocation, wherein respective priority levels are assigned to the objects;
reassigning, by the system, first objects of the group of objects to the respective resource elements, resulting in a second allocation, wherein the first objects comprise respective priority levels that fail to satisfy a threshold priority level, and wherein second objects of the group of objects remain assigned according to the first allocation, and wherein the second objects comprise respective priority levels that satisfy the threshold priority level; and
based on a determination that a first rank of the first allocation is a higher rank than a second rank of the second allocation, facilitating, by the system, implementation of the first allocation, wherein the facilitating comprises discarding the second allocation.

### Claim 2 (depends on 1)

The method of claim 1, wherein the reassigning comprises reducing a search space of the group of objects, and wherein the allocating, the reassigning, and the facilitating are performed within a defined time period.

### Claim 3 (depends on 1)

The method of claim 1, wherein the defined constraints comprise, for respective resource elements, a distance time and an idle time.

### Claim 4 (depends on 1)

The method of claim 1, wherein the determination is a first determination, and wherein the method further comprises:
based on a second determination that the second rank of the second allocation is more than the first rank of the first allocation, facilitating, by the system, implementation of the second allocation, wherein the facilitating comprises discarding the first allocation.

### Claim 5 (depends on 1)

The method of claim 1, wherein the determination is a first determination, and wherein the method further comprises:
reassigning, by the system, third objects of the group of objects to the respective resource elements, resulting in a third allocation, wherein the third objects comprise respective priority levels that fail to satisfy the threshold priority level, wherein fourth objects of the group of objects remain assigned according to the first allocation, and wherein the fourth objects comprise respective priority levels that satisfy the threshold priority level; and
based on a second determination that a third rank of the third allocation is more than the first rank of the first allocation, facilitating, by the system, implementation of the third allocation, wherein the facilitating comprises discarding the first allocation.

### Claim 6 (depends on 1)

The method of claim 1, wherein the reassigning comprises permuting, by the system, the first objects randomly between the respective resource elements.

### Claim 7 (depends on 1)

The method of claim 1, wherein the reassigning comprises using a striation function to divide the group of objects into a finite number of groupings.

### Claim 8 (depends on 7)

The method of claim 7, wherein respective objects of the group of objects belong to a single grouping of the finite number of groupings.

### Claim 9

A system comprising:
a processor; and
a memory that stores executable instructions that, when executed by the processor, facilitate performance of operations, comprising:
separating objects of a group of objects into a first grouping and a second grouping;
assigning first objects of the first grouping and second objects of the second grouping to respective resource elements, resulting in a first classification;
enabling a schedule search, wherein the enabling comprises:
at respective iterations of a group of iterations, selecting a defined priority level based on respective defined priority levels assigned to the objects of the group of objects;
removing third objects of the second grouping that do not satisfy the defined priority level from the first classification; and
assigning the third objects to the respective resource elements, resulting in a second classification, wherein the first objects and the second objects, other than the third objects, remain assigned according to the first classification.

### Claim 10 (depends on 9)

The system of claim 9, wherein the first objects are classified as anchor objects that satisfy one of the defined priority level or a defined duration level.

### Claim 11 (depends on 9)

The system of claim 9, wherein after the assigning the first objects, the operations comprise randomly permutating the second objects among the respective resource elements.

### Claim 12 (depends on 9)

The system of claim 9, wherein the separating comprises using a striation function that separates the objects into a finite number of groupings.

### Claim 13 (depends on 12)

The system of claim 12, wherein the striation function is an unsupervised clustering process.

### Claim 14 (depends on 12)

The system of claim 12, wherein the striation function is a quintile operation.

### Claim 15 (depends on 12)

The system of claim 12, wherein the striation function is a quartile operation.

### Claim 16 (depends on 12)

The system of claim 12, wherein the striation function is a decile operation.

### Claim 17 (depends on 9)

The system of claim 9, wherein the schedule search reduces a search space of the group of objects.

### Claim 18

A non-transitory machine-readable medium, comprising executable instructions that, when executed by a processor, facilitate performance of operations, comprising:
determining a first assignment of objects comprising:
segregating a group of objects into a first group of first objects and a second group of second objects using a striation process;
assigning the first objects to resource elements, wherein the first objects satisfy a defined priority level, and
after the assigning the first objects, assigning the second objects to the resource elements, wherein the second objects fail to satisfy the defined priority level;
determining a second assignment of objects comprising:
segregating the second objects into third objects and fourth objects using the striation process;
reassigning the third objects to the resource elements, wherein the fourth objects and the first objects are not reassigned;
determining a first ranking for the first assignment of objects and a second ranking for the second assignment of objects; and
facilitating implementation of the second assignment of objects based on the second ranking being determined to be a higher ranking than the first ranking.

### Claim 19 (depends on 18)

The non-transitory machine-readable medium of claim 18, wherein the determining the first assignment of objects and the determining the second assignment of objects comprises reducing a search space associated with the group of objects.

### Claim 20 (depends on 18)

The non-transitory machine-readable medium of claim 18, wherein the determining the first assignment of objects, the determining the second assignment of objects, the determining the ranking, and the facilitating are executed by the processor within a defined time period.
