Vehicle Dispatch Policy Using Reinforcement Learning for Dynamic Routing

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing vehicle dispatch systems struggle to efficiently manage multiple vehicles in dynamic environments with changing conditions, such as road closures and vehicle breakdowns, due to their inability to adapt in real-time and account for continuous actions over an infinite time continuum.

Innovation Solution

A vehicle dispatch system combining linear programming and reinforcement learning to generate schedules and optimize vehicle routes, where reinforcement learning simulates actions and determines policies to maximize rewards, allowing for dynamic and adaptive dispatch decisions in uncertain environments.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If linear programming methods are used to establish vehicle schedules, then a structured schedule can be generated, but the schedule cannot be adapted to address constantly-changing environments in real time

Engineering Contradiction:
Improveadaptability to changing environmentsVSAvoidreal-time response capability
Core Design Contradiction:
Adaptability or versatilityVSLoss of time

Solution Approach 1:

The system transitions from static linear programming schedules to dynamic reinforcement learning policies that continuously adapt to changing environments. The RL agent learns optimal dispatch policies through simulation and updates them in real-time based on current state observations, enabling the system to dynamically respond to road closures, vehicle breakdowns, and other environmental changes while maintaining efficient material throughput.

Inventive Principle:
Principle #15Dynamics

2Adaptability or versatility

If greedy local search methods are used to select vehicles for tasks, then simple heuristic rules can be applied, but the set schedule must be maintained and cannot account for uncertain and constantly changing environments

Engineering Contradiction:
Improveresponse to uncertain environmentsVSAvoiddispatching system complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The system uses simulation to create virtual copies of the dispatch environment where reinforcement learning policies are trained and tested. By copying the real-world dispatch scenario into a simulated environment, the system can learn optimal policies without disrupting actual operations, then deploy these learned policies to the real system. This approach handles environmental uncertainty while managing complexity through simulation-based learning rather than complex real-time calculations.

Inventive Principle:
Principle #26Copying

3Productivity

If the number of vehicles and destinations increases, then more comprehensive coverage is achieved, but achieving efficiency objectives becomes increasingly difficult

Engineering Contradiction:
Improvematerial throughput efficiencyVSAvoiddispatching system complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The dispatching system segments the complex decision-making process into discrete states and actions that can be learned through reinforcement learning. By dividing the overall dispatch problem into manageable state-action pairs (e.g., vehicle location, task status, environmental conditions), the system can handle increased numbers of vehicles and destinations without proportionally increasing complexity. The RL agent learns optimal policies for each state independently, enabling scalable management of large fleets and multiple destinations while maintaining high material throughput efficiency.

Inventive Principle:
Principle #1Segmentation

Data Source

PatentUS11100601B2Vehicle dispatching method and system
Publication Date: 2021.08.24 AUTONOMOUS SOLUTIONS INC
  • US11100601B2 patent drawing
  • US11100601B2 patent drawing
  • US11100601B2 patent drawing

AI summary

Vehicle dispatch system includes upper stage unit, lower stage unit and interface communication unit. The upper stage unit, configured to generate vehicle schedules, is communicatively connected to the interface communication unit. The lower stage unit, communicatively connected to the upper stage unit and the interface communication unit, has two storage units and a control unit. The first storage unit stores in a state representation multiple possible states having multiple possible actions. The control unit, which receives the schedule as a state representation, is configured to simulate states during an episode by selecting a state action and determining a reward value. The second storage unit stores the reward value and has a policy linked to one possible action for each state. The interface communication unit, operable to receive and transmit vehicle communications, is configured to access the policy and its associated action and communicate the action to a vehicle.