# US 2022/0035880 A1 · Determining feasible itinerary solutions

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

- Number: US 2022/0035880 A1
- Document ID: US20220035880A1
- Status: Published application
- Kind: A1
- Application number: 17/502,625
- Filed: 2021-10-15
- Published: 2022-02-03
- Earliest claimed: 2011-03-14
- Assignees: Amgine Technologies (US), Inc.
- Applicants: Amgine Technologies (US), Inc.
- Inventors: Naomi Liora Miller; Harold Roy Miller; Warren Stableford
- Web page: https://patentgrep.com/patent/US20220035880A1

## CPC

- G06F 16/90332: {Natural language query formulation or dialogue systems}
- G06F 16/243: {Natural language query formulation}
- G06F 16/9535: Search customisation based on user profiles and personalisation
- G06F 40/30: Semantic analysis
- G06Q 10/02: Reservations, e.g. for tickets, services or events
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- 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 for changing an itinerary based on a user change request is disclosed. The method may commence with receiving an itinerary request associated with one or more passengers. The method may continue with receiving a user itinerary change request associated with the itinerary network. The method may continue with generating an itinerary object associated with the user itinerary change request. The method may continue with modifying the itinerary network based on the itinerary object. The method may continue with processing the itinerary network using a topology of the itinerary network to create a plurality of tuples, the plurality of tuples including at least flight tuples and hotel tuples. The method may continue with performing a content search for the plurality of tuples for each of the one or more passengers. The method may continue with generating feasible itinerary solutions based on results of the content searches.

## Claims

### Claim 1

A system for changing an itinerary based on a user itinerary change request, the system comprising:
a processor configured to:
receive an itinerary network associated with one or more passengers; and
receive the user itinerary change request associated with the itinerary network;
a parser configured to:
generate an itinerary object associated with the user itinerary change request; and
modify the itinerary network based on the itinerary object; and
a scheduler configured to:
process the modified itinerary network using a topology of the itinerary network to create a plurality of tuples, the plurality of tuples including at least flight tuples and hotel tuples;
perform a content search for the plurality of tuples for each of the one or more passengers; and
generate feasible itinerary solutions based on results of the content searches.

### Claim 2 (depends on 1)

The system of claim 1, wherein the flight tuples include at least a departure data, a departure time, an arrival date, and an arrival time; and wherein the hotel tuples include at least a check-in date, a check-in time, a check-out date, and a check-out time.

### Claim 3 (depends on 1)

The system of claim 1, wherein the itinerary network comprises two or more nodes and dependencies between the two or more nodes, the two or more nodes being selected from a group of: an origin city, a destination city, a hotel, a date, a time, an airline, and a connection between flights.

### Claim 4 (depends on 3)

The system of claim 3, wherein the topology of the itinerary network comprises at least an ordered list of the two or more nodes.

### Claim 5 (depends on 3)

The system of claim 3, wherein the scheduler is further configured to create an adjacency matrix of the modified itinerary network based on a classification of the two or more nodes based on the dependencies between the two or more nodes.

### Claim 6 (depends on 3)

The system of claim 3, wherein the scheduler is further configured to create a level matrix of the modified itinerary network by selecting main nodes and child nodes that depend on the main nodes from the two or more nodes in the modified itinerary network and wherein the topology is based on the level matrix.

### Claim 7 (depends on 1)

The system of claim 1, wherein the user itinerary change request is provided via at least one of: a natural language, a typed text, and a selection of preexisting options.

### Claim 8 (depends on 1)

The system of claim 1, wherein the user itinerary change request is further associated with a group of passengers.

### Claim 9 (depends on 1)

The system of claim 1, wherein the scheduler is further configured to:
partition, for each of the one or more passengers, the flight tuples into one or more disjoint partition subsets, the disjoint partition subsets determined based on a property of interest; and
perform the content search for each disjoint partition subset of the flight tuples and for each of the hotel tuples.

### Claim 10 (depends on 9)

The system of claim 9, wherein the scheduler is further configured to perform the content search across all disjoint partition subsets for all passengers.

### Claim 11

A computer-implemented method for changing an itinerary based on a user change request, the method comprising:
receiving, by a processor, an itinerary network associated with one or more passengers;
receiving, by the processor, a user itinerary change request associated with the itinerary network;
generating, by a parser, an itinerary object associated with the user itinerary change request;
modifying, by the parser, the itinerary network based on the itinerary object;
processing, by a scheduler, the itinerary network using a topology of the itinerary network to create a plurality of tuples, the plurality of tuples including at least flight tuples and hotel tuples;
performing, by the scheduler, a content search for the plurality of tuples for each of the one or more passengers; and
generating, by the scheduler, feasible itinerary solutions based on results of the content searches.

### Claim 12 (depends on 11)

The method of claim 11, wherein the flight tuples include at least a departure data, a departure time, an arrival date, and an arrival time; and
wherein the hotel tuples include at least a check-in date, a check-in time, a check-out date, and a check-out time.

### Claim 13 (depends on 11)

The method of claim 11, wherein the itinerary network comprises at least two or more nodes and dependencies between the at least two or more nodes, the at least two or more nodes being selected from a group of: an origin city, a destination city, a hotel, a date, a time, an airline, and a connection between flights.

### Claim 14 (depends on 13)

The method of claim 13, wherein the topology of the itinerary network comprises at least an ordered list of the two or more nodes.

### Claim 15 (depends on 13)

The method of claim 13, wherein comprising creating, by the scheduler, an adjacency matrix of the modified itinerary network based on a classification of the two or more nodes based on the dependencies between the two or more nodes.

### Claim 16 (depends on 13)

The method of claim 13, further comprising creating, by the scheduler, a level matrix of the modified itinerary network by selecting main nodes and child nodes that depend on the main nodes from the two or more nodes in the modified itinerary network and wherein the topology is based on the level matrix.

### Claim 17 (depends on 11)

The method of claim 11, wherein the user itinerary change request is provided via at least one of: a natural language, a typed text, and a selection of preexisting options.

### Claim 18 (depends on 11)

The method of claim 11, wherein the user itinerary change request is further associated with a group of passengers.

### Claim 19 (depends on 11)

The method of claim 11, further comprising performing, by the scheduler, a content search across all partition subsets for all passengers.

### Claim 20 (depends on 11)

The method of claim 11, further comprising:
partitioning, by the scheduler, for each of the one or more passengers, the flight tuples into one or more disjoint partition subsets, the disjoint partition subsets determined based on a property of interest; and
performing, by the scheduler, the content search for each disjoint partition subset of the flight tuples and for each of the hotel tuples.