IP Library Granted Patent US 12683893
Granted Patent B2
US 12683893 · App. 18/794,218 · Granted Jul 14, 2026

Routing messages based on message priority

Inventors: Jacob Berger (McLean, VA); Charles DeVore (Brooklyn, NY); Xiaoyi Wang (McLean, VA); Lindsey May (McLean, VA); Waleed Algadhi (McLean, VA); Linsu Han (New York, NY)
Assignee: Capital One Services, LLC
H04L45/24H04L45/126
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12683893
App. No.
18/794,218
Granted
Jul 14, 2026
Kind
B2
Abstract

Methods and systems for routing messages based on message priority. In some aspects, the system may determine paths between a source and one or more destinations. The system may determine, for a first message, using a machine learning model, a first predicted path having a first distance. The system may determine, based on the first predicted path, using a Markov decision process, a priority of the first message. Based on determining that a first confidence score for the first predicted path does not exceed a threshold, the system may select a different path for the first message. The system may select the different path based on the priority of the first message and a second distance associated with the different path. The system may then re-direct the first message along the different path.

Claims (62)

1 . A system for routing messages based on priorities, the system comprising:

one or more processors and one or more non-transitory computer-readable media having computer-executable instructions stored thereon, the computer-executable instructions, when executed by the one or more processors, causing operations comprising:

determining a plurality of paths for routing messages from a source to one or more destinations, wherein each path of the plurality of paths is associated with a respective distance between the source and a respective destination of the one or more destinations;

determining, for a first message of a plurality of messages, using a machine learning model, a first predicted path of the plurality of paths, the first predicted path connecting the source and a first predicted destination of the one or more destinations;

determining, based on the first predicted path, a priority of the first message using a Markov decision process, wherein the Markov decision process utilizes agent input and a probabilistic determination;

determining whether a first confidence score associated with selecting the first predicted path for the first message exceeds a threshold, wherein the first confidence score is determined based on the priority of the first message, a first distance associated with the first predicted path, and the first predicted destination; and

based on determining that the first confidence score for the first predicted path does not exceed the threshold, selecting a different path of the plurality of paths for the first message, the different path connecting the source and a second predicted destination of the one or more destinations, wherein the different path is selected based on the priority of the first message, a second distance associated with the different path, and the second predicted destination, wherein a second confidence score for the different path exceeds the threshold.

2 . A method comprising:

determining a plurality of paths between a source and one or more destinations, wherein each path of the plurality of paths is associated with a respective distance between the source and a respective destination of the one or more destinations;

determining, for a first candidate of a plurality of candidates, using a first model, a first predicted path of the plurality of paths;

determining, based on the first predicted path, using a second model, a priority of the first candidate using agent input and a probabilistic determination;

determining that a first confidence score associated with selecting the first predicted path for the first candidate does not exceed a threshold, wherein the first confidence score is determined based on the priority of the first candidate and a first distance associated with the first predicted path; and

based on determining that the first confidence score for the first predicted path does not exceed the threshold, selecting a different path of the plurality of paths for the first candidate, wherein the different path is selected based on the priority of the first candidate and a second distance associated with the different path, wherein a second confidence score for the different path exceeds the threshold.

3 . The method of claim 2 , wherein determining the priority of the first candidate comprises determining the priority using a Markov decision process, wherein the Markov decision process utilizes the agent input and the probabilistic determination.

4 . The method of claim 2 , further comprising:

monitoring the first candidate for updates to the priority of the first candidate;

detecting an updated priority of the first candidate; and

based on detecting the updated priority, selecting an updated path of the plurality of paths for the first candidate, wherein the updated path is selected based on the updated priority of the first candidate and a third distance associated with the updated path, wherein a third confidence score for the updated path exceeds the threshold.

5 . The method of claim 2 , wherein the first predicted path connects the source and a first predicted destination of the one or more destinations.

6 . The method of claim 5 , further comprising determining the first confidence score further based on the first predicted destination.

7 . The method of claim 6 , wherein the different path connects the source and a second predicted destination of the one or more destinations, further comprising selecting the different path further based on the second predicted destination.

8 . The method of claim 5 , further comprising selecting the different path further based on the different path connecting the source and the first predicted destination via a different route than the first predicted path.

9 . The method of claim 2 , further comprising:

receiving a plurality of rules for re-directing candidates to selected paths of the plurality of paths;

determining a strategy for re-directing the first candidate from the first predicted path to the different path, wherein the strategy comprises one or more of a method for contacting the first candidate and a schedule for contacting the first candidate; and

comparing the strategy with the plurality of rules to determine whether the strategy violates any rules of the plurality of rules.

10 . The method of claim 9 , further comprising:

determining that the strategy does not violate the plurality of rules; and

approving the strategy for re-directing the first candidate from the first predicted path to the different path.

11 . The method of claim 9 , further comprising:

determining that the strategy violates one or more rules of the plurality of rules;

determining a different strategy for re-directing the first candidate from the first predicted path to the different path;

comparing the different strategy with the plurality of rules;

determining that the different strategy does not violate the plurality of rules; and

approving the different strategy for re-directing the first candidate from the first predicted path to the different path.

12 . One or more non-transitory, computer-readable media storing instructions that, when executed by one or more processors, cause operations comprising:

determining a plurality of paths between a source and one or more destinations, wherein each path of the plurality of paths is associated with a respective distance between the source and a respective destination of the one or more destinations;

determining, for a first candidate of a plurality of candidates, using a first model, a first predicted path of the plurality of paths;

determining, based on the first predicted path, using a second model, a priority of the first candidate using agent input and a probabilistic determination;

determining that a first confidence score associated with selecting the first predicted path for the first candidate does not exceed a threshold; and

based on determining that the first confidence score for the first predicted path does not exceed the threshold, selecting a different path of the plurality of paths for the first candidate, wherein a second confidence score for the different path exceeds the threshold.

13 . The one or more non-transitory, computer-readable media of claim 12 , wherein determining the priority of the first candidate comprises determining the priority using a Markov decision process, wherein the Markov decision process utilizes the agent input and the probabilistic determination.

14 . The one or more non-transitory, computer-readable media of claim 12 , wherein the first predicted path connects the source and a first predicted destination of the one or more destinations, and wherein the instructions further cause the one or more processors to perform operations comprising determining the first confidence score based on the first predicted destination, the priority of the first candidate, and a first distance associated with the first predicted path.

15 . The one or more non-transitory, computer-readable media of claim 14 , wherein the different path connects the source and a second predicted destination of the one or more destinations, further comprising selecting the different path further based on the second predicted destination, the priority of the first candidate, and a second distance associated with the different path.

16 . The one or more non-transitory, computer-readable media of claim 12 , wherein the instructions further cause the one or more processors to perform operations comprising:

monitoring the first candidate for updates to the priority of the first candidate;

detecting an updated priority of the first candidate; and

based on detecting the updated priority, selecting an updated path of the plurality of paths for the first candidate, wherein the updated path is selected based on the updated priority of the first candidate and a third distance associated with the updated path, wherein a third confidence score for the updated path exceeds the threshold.

17 . The one or more non-transitory, computer-readable media of claim 15 , further comprising selecting the different path further based on the different path connecting the source and the first predicted destination via a different route than the first predicted path.

18 . The one or more non-transitory, computer-readable media of claim 12 , wherein the instructions further cause the one or more processors to perform operations comprising:

receiving a plurality of rules for re-directing candidates to selected paths of the plurality of paths;

determining a strategy for re-directing the first candidate from the first predicted path to the different path, wherein the strategy comprises one or more of a method for contacting the first candidate and a schedule for contacting the first candidate; and

comparing the strategy with the plurality of rules to determine whether the strategy violates any rules of the plurality of rules.

19 . The one or more non-transitory, computer-readable media of claim 18 , wherein the instructions further cause the one or more processors to perform operations comprising:

determining that the strategy does not violate the plurality of rules; and

approving the strategy for re-directing the first candidate from the first predicted path to the different path.

20 . The one or more non-transitory, computer-readable media of claim 18 , wherein the instructions further cause the one or more processors to perform operations further comprising:

determining that the strategy violates one or more rules of the plurality of rules;

determining a different strategy for re-directing the first candidate from the first predicted path to the different path;

comparing the different strategy with the plurality of rules;

determining that the different strategy does not violate the plurality of rules; and

approving the different strategy for re-directing the first candidate from the first predicted path to the different path.