# US 2026/0087738 A1 · Virtual represenation of identified object-related achievements

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

- Number: US 2026/0087738 A1
- Document ID: US20260087738A1
- Status: Published application
- Kind: A1
- Application number: 18/890,955
- Filed: 2024-09-20
- Published: 2026-03-26
- Earliest claimed: 2024-09-20
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Xiao Xia Mao; Jialei Ma; Liang Ying Xu; Nan Nan Li; Ting Chen; Xiao Feng Ji
- Web page: https://patentgrep.com/patent/US20260087738A1

## CPC

- G06T 17/005: {Tree description, e.g. octree, quadtree}
- G06N 3/00: Computing arrangements based on biological models
- G06N 3/08: Learning methods
- G06N 5/01: Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
- G06N 20/00: Machine learning
- G06Q 50/20: Education
- G09B 5/00: Electrically-operated educational appliances (working with questions and answers G09B7/00; simulators G09B9/00; advertising or displaying in general G09F)
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- 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
- G09B: EDUCATIONAL OR DEMONSTRATION APPLIANCES; APPLIANCES FOR TEACHING, OR COMMUNICATING WITH, THE BLIND, DEAF OR MUTE; MODELS; PLANETARIA; GLOBES; MAPS; DIAGRAMS (devices for psychotechnics or for testing reaction times A61B5/16; games, sports, amusements A63; projectors, projector screens G03B)

## Abstract

Techniques are described with respect to a system, method, and computer program product for visualizing representations of achievements. An associated method includes generating at least one vector associated with a user; identifying an object associated with the user, assigning the at least one vector to a tree data structure based on the identified object; and visualizing the tree data structure within a virtual environment associated with the user.

## Claims

### Claim 1

A computer-implemented method for visualizing representations of achievements, the method comprising:
generating, by a computing device, at least one vector associated with a user;
identifying, by the computing device, an object associated with the user;
assigning, by the computing device, the at least one vector to a tree data structure based on the identified object; and
visualizing, by the computing device, the tree data structure within a virtual environment associated with the user.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein assigning the at least one vector comprises:
analyzing, by the computing device, the at least one vector to generate a maximum achievement associated with the user;
wherein the analysis is based on one or more of a user profile, an object profile, and a plurality of contextual information associated with the user.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, wherein assigning the at least one vector comprises:
assigning, by the computing device, a plurality of user vectors to the tree data structure;
wherein the plurality of user vectors are trained on at least a plurality of achievements and the plurality of achievements are represented by one or more leaf nodes of the tree data structure.

### Claim 4 (depends on 1)

The computer-implemented method of claim 1, wherein the one or more leaf nodes of the tree data structure representing the plurality of achievements are associated with the identified object.

### Claim 5 (depends on 1)

The computer-implemented method of claim 1, wherein assigning the at least one vector comprises:
traversing, by the computing device, each node of the one or more leaf nodes above a root node in a pre-determined order;
wherein a leaf node represents a single achievement and an intermediate tree node represents a multi-achievement combination.

### Claim 6 (depends on 3)

The computer-implemented method of claim 3, wherein assigning the at least one vector comprises:
extracting, by the computing device, a plurality of textual descriptions from the one or more leaf nodes to generate a plurality of user descriptions; and
assigning, by the computing device, at least one user description of the plurality of user descriptions to an unassigned leaf node.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, wherein the tree data structure comprises one or more leaf nodes functioning as interactive virtual objects within the virtual environment.

### Claim 8

A computer program product for visualizing representations of achievements, the computer program product comprising or more computer readable storage media and program instructions collectively stored on the one or more computer readable storage media, the stored program instructions comprising:
program instructions to generate at least one vector associated with a user;
program instructions to identify an object associated with the user;
program instructions to assign the at least one vector to a tree data structure based on the identified object; and
program instructions to visualize the tree data structure within a virtual environment associated with the user.

### Claim 9 (depends on 8)

The computer program product of claim 8, wherein program instructions to assign the at least one vector further comprise:
program instructions to analyze the at least one vector to generate a maximum achievement associated with the user;
wherein the analysis is based on one or more of a user profile, an object profile, and a plurality of contextual information associated with the user.

### Claim 10 (depends on 8)

The computer program product of claim 8, wherein program instructions to assign the at least one vector further comprise:
program instructions to assign a plurality of user vectors to the tree data structure;
wherein the plurality of user vectors are trained on at least a plurality of achievements and the plurality of achievements are represented by one or more leaf nodes of the tree data structure.

### Claim 11 (depends on 8)

The computer program product of claim 8, wherein the one or more leaf nodes of the tree data structure representing the plurality of achievements are associated with the identified object.

### Claim 12 (depends on 8)

The computer program product of claim 8, wherein program instructions to assign the at least one vector further comprise:
program instructions to traverse each node of the one or more leaf nodes above a root node in a pre-determined order;
wherein a leaf node represents a single achievement and an intermediate tree node represents a multi-achievement combination.

### Claim 13 (depends on 10)

The computer program product of claim 10, wherein program instructions to assign the at least one vector further comprise:
program instructions to extract a plurality of textual descriptions from the one or more leaf nodes to generate a plurality of user descriptions; and
program instructions to assign at least one user description of the plurality of user descriptions to an unassigned leaf node.

### Claim 14 (depends on 8)

The computer program product of claim 8, wherein the tree data structure comprises one or more leaf nodes functioning as interactive virtual objects within the virtual environment.

### Claim 15

A computer system for visualizing representations of achievements, the computer system comprising:
one or more processors;
one or more computer-readable memories;
program instructions stored on at least one of the one or more computer-readable memories for execution by at least one of the one or more processors, the program instructions comprising:
program instructions to generate at least one vector associated with a user;
program instructions to identify an object associated with the user;
program instructions to assign the at least one vector to a tree data structure based on the identified object; and
program instructions to visualize the tree data structure within a virtual environment associated with the user.

### Claim 16 (depends on 15)

The computer system of claim 15, wherein program instructions to assign the at least one vector further comprise:
program instructions to analyze the at least one vector to generate a maximum achievement associated with the user;
wherein the analysis is based on one or more of a user profile, an object profile, and a plurality of contextual information associated with the user.

### Claim 17 (depends on 15)

The computer system of claim 15, wherein program instructions to assign the at least one vector further comprise:
program instructions to assign a plurality of user vectors to the tree data structure;
wherein the plurality of user vectors are trained on at least a plurality of achievements and the plurality of achievements are represented by one or more leaf nodes of the tree data structure.

### Claim 18 (depends on 15)

The computer system of claim 15, wherein the one or more leaf nodes of the tree data structure representing the plurality of achievements are associated with the identified object.

### Claim 19 (depends on 17)

The computer system of claim 17, wherein program instructions to assign the at least one vector further comprise:
program instructions to traverse each node of the one or more leaf nodes above a root node in a pre-determined order;
wherein a leaf node represents a single achievement and an intermediate tree node represents a multi-achievement combination.

### Claim 20 (depends on 15)

The computer system of claim 15, wherein program instructions to assign the at least one vector further comprise:
program instructions to extract a plurality of textual descriptions from the one or more leaf nodes to generate a plurality of user descriptions; and
program instructions to assign at least one user description of the plurality of user descriptions to an unassigned leaf node.
