Self-Driving Car Scheduling Using Real-Time Road Status

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current self-driving car scheduling methods are inefficient due to reliance on limited location-based references, leading to low scheduling precision, as they do not account for real-time traffic conditions or road status, which can affect the timely arrival of cars at ride requests.

Innovation Solution

A self-driving car scheduling method that considers ride requests including starting and destination locations, expected arrival times, and current road status information to determine the most suitable car, incorporating real-time traffic data and route planning to ensure precise scheduling.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Device complexity

If car scheduling is performed according to only locations of assigned cars and ride request, then the scheduling process is simple, but scheduling precision is low

Engineering Contradiction:
Improvescheduling process complexityVSAvoidscheduling precision
Core Design Contradiction:
Device complexityVSMeasurement precision

Solution Approach 1:

The patent expands the scheduling parameters from simple location-based matching to include real-time traffic conditions, road status, car status, and multiple route options. This parameter enrichment enables more precise scheduling decisions while maintaining computational feasibility through structured data organization and prioritization mechanisms.

Inventive Principle:
Principle #35Parameter changes

2Measurement precision

If real-time traffic conditions and road status are considered in scheduling, then scheduling precision is improved, but the complexity of data processing increases

Engineering Contradiction:
Improvescheduling precisionVSAvoiddata processing complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The system performs preliminary data collection and organization of traffic conditions, road status, and car information before the actual scheduling decision. By pre-processing and structuring this data, the system reduces the computational burden during real-time scheduling while maintaining high precision in matching cars to ride requests.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent introduces an intermediary scheduling system that acts as a mediator between raw traffic data and final car assignment decisions. This intermediary layer processes and synthesizes multiple data sources (traffic conditions, road status, car status) into actionable scheduling parameters, simplifying the overall system architecture while improving decision accuracy.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Measurement precision

If multiple reference factors are used for car scheduling, then scheduling precision is enhanced, but the computational time increases

Engineering Contradiction:
Improvescheduling precisionVSAvoidcomputational time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent applies local quality by focusing computational resources on the most relevant factors for each specific scheduling scenario. Rather than uniformly processing all possible parameters for every ride request, the system identifies and prioritizes the most critical local factors (such as current traffic conditions near the pickup location or car availability in the vicinity), thereby reducing overall computational time while maintaining high scheduling precision.

Inventive Principle:
Principle #3Local quality

Data Source

PatentUS11340631B2Self-driving car scheduling method, car scheduling server, and self-driving car
Publication Date: 2022.05.24 HUAWEI TECH CO LTD
  • US11340631B2 patent drawing
  • US11340631B2 patent drawing
  • US11340631B2 patent drawing

AI summary

A self-driving car scheduling method, a car scheduling server, and a self-driving car includes receiving a ride request; determining, according to the ride request and driving information of self-driving cars within a management range, at least one first candidate car from the multiple self-driving cars; calculating a first time required by each first candidate car to arrive at a ride destination according to current location information, current road status information, and planned route information of each first candidate car; determining a final candidate car from the at least one first candidate car according to the first time corresponding to each first candidate car.