# US 2017/0372252 A1 · Virtually assisted task generation

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

- Number: US 2017/0372252 A1
- Document ID: US20170372252A1
- Status: Published application
- Kind: A1
- Application number: 15/190,311
- Filed: 2016-06-23
- Published: 2017-12-28
- Earliest claimed: 2016-06-23
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Pritpal S. Arora; Bijo S. Kappen; Gopal S. Pingali; Adinarayana Sakala
- Web page: https://patentgrep.com/patent/US20170372252A1

## CPC

- G06Q 10/063112: {Skill-based matching of a person or a group to a task}
- G06Q 10/063116: {Schedule adjustment for a person or group}
- 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

## Abstract

A method and system for automatically generating a virtual assisted task is provided. The method includes establishing secure connections between a hardware device and databases external to the hardware device. A group of tasks associated with an individual are identified and available timeframes associated with an availability of the individual are determined. A first potential score and maximum score for each task are computed. The first potential score is compared to each maximum potential score and in response, a subset of tasks are automatically selected. The subset of tasks are mapped to the available timeframes and results of the mapping a cached within a caching circuit of the hardware device. Results of the caching are presented via the hardware device.

## Claims

### Claim 1

A virtual assisted task maximization method comprising:
establishing, by a processor enabling a connectivity circuit of a hardware device, secure connections between said hardware device and a plurality of databases external to said hardware device;
identifying, by said processor based on analysis of specialized parameters, a group of tasks associated with an individual;
determining, by said processor, specified available timeframes associated with availability of said individual;
computing based on specified skills of said individual, by said processor enabling a computation circuit of said hardware device, a first potential score for each task of said group of tasks;
computing, by said processor enabling said computation circuit of said hardware device, a maximum potential score for each said task;
comparing each said first potential score to each said maximum potential score;
automatically selecting based on results of said comparing, by said processor enabling said computation circuit, a subset of tasks of said group of tasks;
mapping, by said processor, said subset of tasks to said specified available timeframes;
caching within a caching circuit of said hardware device, by said processor, results of said mapping; and
presenting via said hardware device, said results of said caching.

### Claim 2 (depends on 1)

The method of claim 1, wherein said computing each said first potential score is further based on a value associated with each said task, a reward associated with each said task, a time period associated with each said task with respect to said specified available timeframes, and a time period estimate associated with said individual addressing each said task.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
computing, by said processor enabling said computation circuit, a worker opportunity collaborator score (WOCS) for each specified collaborator of a plurality of collaborators associated with each said task by:
analyzing each said collaborator's skills with respect to skills of said individual for each said task;
overlapping time frames between each specified collaborator and said individual and success ratings for past collaborations between each specified collaborator and said individual; and
re-computing based on said WOCS, by said processor enabling said computation circuit, an updated potential score for each task of said group of tasks.

### Claim 4 (depends on 3)

The method of claim 3, further comprising:
recommending, by said processor, a highest ranked collaborator of said plurality of collaborators with respect to said individual;
selecting by said processor in response to a selection by said individual, a first collaborator of said plurality of collaborators; and
associating, by said processor, said highest ranked collaborator with said first collaborator.

### Claim 5 (depends on 1)

The method of claim 1, wherein said hardware device comprises a wearable device.

### Claim 6 (depends on 1)

The method of claim 1, further comprising:
performing said subset of tasks during said specified available timeframes.

### Claim 7 (depends on 1)

The method of claim 1, wherein said tasks comprise replacing hardware components of various hardware devices.

### Claim 8 (depends on 1)

The method of claim 1, further comprising:
identifying, by said processor tasks of said group of tasks to be eliminated based on pending tasks, prior task estimates, a rate of closure with respect to said group of tasks, and an availability of said individual with respect to said group of tasks.

### Claim 9 (depends on 1)

The method of claim 1, further comprising:
providing at least one support service for at least one of creating, integrating, hosting, maintaining, and deploying computer-readable code in the hardware device, said code being executed by the computer processor to implement: said establishing, said identifying, said determining, said computing said first potential score, said computing said maximum potential score, said comparing, said automatically selecting, said mapping, said caching, and said presenting.

### Claim 10

A computer program product, comprising a computer readable hardware storage device storing a computer readable program code, said computer readable program code comprising an algorithm that when executed by a processor enabling a connectivity circuit of a hardware device implements a virtual assisted task maximization method, said method comprising:
establishing, by said processor, secure connections between said hardware device and a plurality of databases external to said hardware device;
identifying, by said processor based on analysis of specialized parameters, a group of tasks associated with an individual;
determining, by said processor, specified available timeframes associated with availability of said individual;
computing based on specified skills of said individual, by said processor enabling a computation circuit of said hardware device, a first potential score for each task of said group of tasks;
computing, by said processor enabling said computation circuit of said hardware device, a maximum potential score for each said task;
comparing each said first potential score to each said maximum potential score;
automatically selecting based on results of said comparing, by said processor enabling said computation circuit, a subset of tasks of said group of tasks;
mapping, by said processor, said subset of tasks to said specified available timeframes;
caching within a caching circuit of said hardware device, by said processor, results of said mapping; and
presenting via said hardware device, said results of said caching.

### Claim 11 (depends on 10)

The computer program product of claim 10, wherein said computing each said first potential score is further based on a value associated with each said task, a reward associated with each said task, a time period associated with each said task with respect to said specified available timeframes, and a time period estimate associated with said individual addressing each said task.

### Claim 12 (depends on 10)

The computer program product of claim 10, wherein said method further comprises:
computing, by said processor enabling said computation circuit, a worker opportunity collaborator score (WOCS) for each specified collaborator of a plurality of collaborators associated with each said task by:
analyzing each said collaborator's skills with respect to skills of said individual for each said task;
overlapping time frames between each specified collaborator and said individual and success ratings for past collaborations between each specified collaborator and said individual; and
re-computing based on said WOCS, by said processor enabling said computation circuit, an updated potential score for each task of said group of tasks.

### Claim 13 (depends on 12)

The computer program product of claim 12, wherein said method further comprises:
recommending, by said processor, a highest ranked collaborator of said plurality of collaborators with respect to said individual;
selecting by said processor in response to a selection by said individual, a first collaborator of said plurality of collaborators; and
associating, by said processor, said highest ranked collaborator with said first collaborator.

### Claim 14 (depends on 10)

The computer program product of claim 10, wherein said hardware device comprises a wearable device.

### Claim 15 (depends on 10)

The computer program product of claim 10, wherein said method further comprises:
performing said subset of tasks during said specified available timeframes.

### Claim 16 (depends on 10)

The computer program product of claim 10, wherein said tasks comprise replacing hardware components of various hardware devices.

### Claim 17 (depends on 10)

The computer program product of claim 10, wherein said method further comprises:
identifying, by said processor tasks of said group of tasks to be eliminated based on pending tasks, prior task estimates, a rate of closure with respect to said group of tasks, and an availability of said individual with respect to said group of tasks.

### Claim 18

A hardware device comprising a processor coupled to a computer-readable memory unit, said memory unit comprising instructions that when executed by the processor executes a virtual assisted task maximization method comprising:
establishing, by said processor enabling a connectivity circuit of said hardware device, secure connections between said hardware device and a plurality of databases external to said hardware device;
identifying, by said processor based on analysis of specialized parameters, a group of tasks associated with an individual;
determining, by said processor, specified available timeframes associated with availability of said individual;
computing based on specified skills of said individual, by said processor enabling a computation circuit of said hardware device, a first potential score for each task of said group of tasks;
computing, by said processor enabling said computation circuit of said hardware device, a maximum potential score for each said task;
comparing each said first potential score to each said maximum potential score;
automatically selecting based on results of said comparing, by said processor enabling said computation circuit, a subset of tasks of said group of tasks;
mapping, by said processor, said subset of tasks to said specified available timeframes;
caching within a caching circuit of said hardware device, by said processor, results of said mapping; and
presenting via said hardware device, said results of said caching.

### Claim 19 (depends on 18)

The hardware device of claim 18, wherein said computing each said first potential score is further based on a value associated with each said task, a reward associated with each said task, a time period associated with each said task with respect to said specified available timeframes, and a time period estimate associated with said individual addressing each said task.

### Claim 20 (depends on 18)

The hardware device of claim 18, wherein said method further comprises:
computing, by said processor enabling said computation circuit, a worker opportunity collaborator score (WOCS) for each specified collaborator of a plurality of collaborators associated with each said task by:
analyzing each said collaborator's skills with respect to skills of said individual for each said task;
overlapping time frames between each specified collaborator and said individual and success ratings for past collaborations between each specified collaborator and said individual; and
re-computing based on said WOCS, by said processor enabling said computation circuit, an updated potential score for each task of said group of tasks.
