# US 2021/0342869 A1 · Time Interval Geolocation Community Objects with Price-Time Priority Queues for Transformed Time Interval Geolocation Units

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

- Number: US 2021/0342869 A1
- Document ID: US20210342869A1
- Status: Published application
- Kind: A1
- Application number: 17/324,051
- Filed: 2021-05-18
- Published: 2021-11-04
- Earliest claimed: 2016-09-15
- Assignees: SimpsX Technologies LLC
- Applicants: Simpsx Technologies LLC
- Inventors: Erik Mowery Simpson
- Web page: https://patentgrep.com/patent/US20210342869A1

## CPC

- G06Q 10/02: Reservations, e.g. for tickets, services or events
- G06Q 10/047: Optimisation of routes or paths, e.g. travelling salesman problem
- G01C 21/3438: {Rendezvous; Ride sharing}
- G06Q 10/04: Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" (market predictions or forecasting for commercial activities G06Q30/0202)
- G06Q 10/06315: {Needs-based resource requirements planning or analysis}
- G06Q 10/0833: Tracking
- G06Q 10/08355: {Routing methods}
- G06Q 10/10: Office automation; Time management
- G06Q 10/40: Business processes related to social networking or social networking services
- G06Q 10/42: Determination of affinities or common interests between users
- G06Q 20/027: {involving a payment switch or gateway}
- G06Q 20/0855: {involving a third party}
- G06Q 20/102: {Bill distribution or payments}
- G06Q 20/127: {Shopping or accessing services according to a time-limitation}
- G06Q 20/145: {Payments according to the detected use or quantity}
- G06Q 20/4015: {using location information}
- G06Q 30/0205: {based on location or geographical consideration}
- G06Q 30/08: Auctions
- G06Q 40/04: Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
- G06Q 40/06: Asset management; Financial planning or analysis
- G06Q 50/14: Travel agencies
- G06Q 50/40: Business processes related to the transportation industry (shipping G06Q10/083)
- G06Q 50/47: Passenger ride requests, e.g. ride-hailing
- G07B 15/06: Arrangements for road pricing or congestion charging of vehicles or vehicle users, e.g. automatic toll systems
- G07F 17/0057: {for the hiring or rent of vehicles, e.g. cars, bicycles or wheelchairs (car rental G07B15/00)}
- G01C 21/3423: {Multimodal routing}
- G06Q 30/0206: {Price or cost determination based on market factors}
- 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
- G01C: MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY (measuring liquid level G01F; radio navigation, determining distance or velocity by use of propagation effects, e.g. Doppler effects, propagation time, of radio waves, analogous arrangements using other waves G01S)
- G07B: TICKET-ISSUING APPARATUS; FARE-REGISTERING APPARATUS; FRANKING APPARATUS
- G07F: COIN-FREED OR LIKE APPARATUS (coin sorting G07D3/00; coin testing G07D5/00; {handling coins or paper currencies apart from payment activated apparatus G07D; payment architectures, schemes or protocols G06Q20/00})

## Abstract

Various implementations directed to price time priority queue routing for time interval object capacity units are provided. The method may also include generating data packet routes based on the origin location data and the destination location data. The method may further include determining virtual hubs along the data packet routes, where the virtual hubs include a first virtual hub based on the origin location data and a second virtual hub based on the destination location data. The method may additionally include receiving travel cost data for the routes for geolocation time interval object exchange units. In addition, the method may include receiving market depth data for a geolocation exchange for the geolocation exchange units based on the data packet routes. The method may also include selecting an optimized route of the routes for the geolocation exchange units based on an objective function.

## Claims

### Claim 1

A method, comprising:
receiving origin location data and destination location data from a first user, wherein the origin location data corresponds to a geographic origin and the destination location data corresponds to a geographic destination;
generating a plurality of routes based on the origin location data and the destination location data;
determining a plurality of virtual hubs along the plurality of routes, wherein the plurality of virtual hubs comprises a first virtual hub based on the origin location data and a second virtual hub based on the destination location data;
receiving travel cost data for the plurality of routes for one or more geolocation exchange units, wherein the one or more geolocation exchange units corresponds to a predetermined space traveling from the first virtual hub to the second virtual hub, and wherein the travel cost data comprises data relating to travel time, travel expenses, or combinations thereof;
receiving market depth data for a geolocation exchange for the one or more geolocation exchange units based on the plurality of routes, wherein the market depth data comprises one or more bid prices and one or more offer prices for the one or more geolocation exchange units; and
selecting an optimized route of the plurality of routes for the one or more geolocation exchange units based on an objective function, wherein the objective function uses the travel cost data, the market depth data, or combinations thereof.

### Claim 2 (depends on 1)

The method of claim 1, wherein the objective function comprises a function configured to minimize travel time, travel expenses, cost of bid prices, or combinations thereof.

### Claim 3 (depends on 1)

The method of claim 1, wherein the optimized route comprises a route for a data packet for the one or more geolocation exchange units using one or more data connections, wherein the one or more data connections comprise a portable multifunction device, wireless computer device, stationary computer device and a time object unit.

### Claim 4 (depends on 1)

The method of claim 1, wherein the predetermined space comprises a data packet capacity in one or more wired or wireless connections traveling from the first virtual hub to the second virtual hub.

### Claim 5 (depends on 1)

The method of claim 1, further comprising generating a forward commodity contract based on the selected optimized route, wherein the forward commodity contract is for physical delivery of the one or more geolocation exchange units.

### Claim 6 (depends on 1)

The method of claim 1, further comprising receiving constraint data from the first user, wherein the constraint data indicates a selection by the first user of one or more conditions for traveling along the plurality of routes.

### Claim 7 (depends on 6)

The method of claim 6, further comprising:
receiving the travel cost data for the plurality of routes based on the constraint data; and
receiving the market depth data based on the plurality of routes and the constraint data.

### Claim 8 (depends on 6)

The method of claim 6, wherein the one or more conditions comprise cheapest route, single mode of connection, multiple modes of connection, fastest route, most scenic route, highest rated route, most available route, highest volume of participants for route, most frequent route, service level for route, highest safety and security level for route, gender of user, security of use, and rating of user.

### Claim 9

A computing system, comprising:
one or more processors; and
one or more memory comprising program instructions executable by the one or more processors to:
receive origin location data and destination location data from a first user, wherein the origin location data corresponds to a geographic origin and the destination location data corresponds to a geographic destination;
generate a plurality of routes based on the origin location data and the destination location data;
determine a plurality of virtual hubs along the plurality of routes, wherein the plurality of virtual hubs comprises a first virtual hub based on the origin location data and a second virtual hub based on the destination location data;
receive travel cost data for the plurality of routes for one or more geolocation exchange units, wherein the one or more geolocation exchange units corresponds to a predetermined space traveling from the first virtual hub to the second virtual hub, and wherein the travel cost data comprises data relating to travel time, travel expenses, or combinations thereof;
receive market depth data for a geolocation exchange for the one or more geolocation exchange units based on the plurality of routes, wherein the market depth data comprises one or more bid prices and one or more offer prices for the one or more geolocation exchange units; and
select an optimized route of the plurality of routes for the one or more geolocation exchange units based on an objective function, wherein the objective function uses the travel cost data, the market depth data, or combinations thereof.

### Claim 10 (depends on 9)

The computing system of claim 9, wherein the objective function comprises a function configured to minimize travel time, travel expenses, cost of bid prices, or combinations thereof.

### Claim 11 (depends on 9)

The computing system of claim 9, wherein the optimized route comprises a route for a data packet for the one or more geolocation exchange units using one or more data connections, wherein the one or more data connections comprise a portable multifunction device, wireless computer device, stationary computer device and a time object unit.

### Claim 12 (depends on 9)

The computing system of claim 9, wherein the predetermined space comprises a data packet capacity in one or more wired or wireless connections traveling from the first virtual hub to the second virtual hub.

### Claim 13 (depends on 9)

The computing system of claim 9, wherein the program instructions further comprise program instructions executable by the one or more processors to generate a forward commodity contract based on the selected optimized route, wherein the forward commodity contract is for physical delivery of the one or more geolocation exchange units.

### Claim 14 (depends on 9)

The computing system of claim 9, wherein the program instructions further comprise program instructions executable by the one or more processors to receive constraint data from the first user, wherein the constraint data indicates a selection by the first user of one or more conditions for traveling along the plurality of routes.

### Claim 15 (depends on 14)

The computing system of claim 14, wherein the program instructions further comprise program instructions executable by the one or more processors to:
receive the travel cost data for the plurality of routes based on the constraint data; and
receive the market depth data based on the plurality of routes and the constraint data.

### Claim 16 (depends on 14)

The computing system of claim 14, wherein the one or more conditions comprise cheapest route, single mode of connection, multiple modes of connection, fastest route, most scenic route, highest rated route, most available route, highest volume of participants for route, most frequent route, service level for route, highest safety and security level for route, gender of user, security of user, and rating of user.

### Claim 17

A non-transitory computer-readable medium having stored thereon a plurality of computer-executable instructions which, when executed by a computer, cause the computer to:
receive origin location data and destination location data from a first user, wherein the origin location data corresponds to a geographic origin and the destination location data corresponds to a geographic destination;
generate a plurality of routes based on the origin location data and the destination location data;
determine a plurality of virtual hubs along the plurality of routes, wherein the plurality of virtual hubs comprises a first virtual hub based on the origin location data and a second virtual hub based on the destination location data;
receive travel cost data for the plurality of routes for one or more geolocation exchange units, wherein the one or more geolocation exchange units corresponds to a predetermined space traveling from the first virtual hub to the second virtual hub, and wherein the travel cost data comprises data relating to travel time, travel expenses, or combinations thereof;
receive market depth data for a geolocation exchange for the one or more geolocation exchange units based on the plurality of routes, wherein the market depth data comprises one or more bid prices and one or more offer prices for the one or more geolocation exchange units; and
select an optimized route of the plurality of routes for the one or more geolocation exchange units based on an objective function, wherein the objective function uses the travel cost data, the market depth data, or combinations thereof.

### Claim 18 (depends on 17)

The non-transitory computer-readable medium of claim 17, wherein the objective function comprises a function configured to minimize travel time, travel expenses, cost of bid prices, or combinations thereof.

### Claim 19 (depends on 17)

The non-transitory computer-readable medium of claim 17, wherein the optimized route comprises a route for a data packet for the one or more geolocation exchange units using one or more data connections, wherein the one or more data connections comprise a portable multifunction device, wireless computer device, stationary computer device and a time object unit.

### Claim 20 (depends on 17)

The non-transitory computer-readable medium of claim 17, wherein the predetermined space comprises a data packet capacity in one or more wired or wireless connections traveling from the first virtual hub to the second virtual hub.
