Connected Vehicle Intersection Scheduling via ETA

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing systems for scheduling connected vehicles to cross non-signalized intersections are inefficient as they do not account for vehicle speeds, leading to unnecessary slowing down and reduced traffic flow.

Innovation Solution

A traffic management system that receives driving data from connected vehicles, determines their estimated times of arrival based on speed and position, and schedules them to cross the intersection in order of arrival time, optimizing the crossing sequence to improve efficiency.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Device complexity

If connected vehicles are scheduled to cross the intersection based on FIFO algorithm (position-based ordering), then the scheduling system is simple to implement, but vehicles with higher speeds must significantly reduce their speed, leading to reduced traffic flow and increased energy consumption

Engineering Contradiction:
Improvescheduling system complexityVSAvoidtraffic flow efficiency
Core Design Contradiction:
Device complexityVSProductivity

Solution Approach 1:

The patent changes the scheduling parameter from position-based (FIFO) to time-based (ETA) ordering. By calculating estimated time of arrival for each vehicle considering both position and speed, the system optimizes the crossing sequence to maintain higher speeds and improve traffic flow efficiency without significantly increasing system complexity

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The patent introduces dynamic scheduling that adapts to each vehicle's speed characteristics. Instead of a static position-based queue, the system dynamically calculates ETA for each vehicle and adjusts the crossing order accordingly, allowing faster vehicles to maintain higher speeds while still ensuring safe intersection crossing

Inventive Principle:
Principle #15Dynamics

2Ease of operation

If connected vehicles are scheduled based on FIFO algorithm, then the scheduling rule is easy to implement, but vehicles experience unnecessary speed reductions, leading to increased energy consumption

Engineering Contradiction:
Improvescheduling rule simplicityVSAvoidvehicle energy consumption
Core Design Contradiction:
Ease of operationVSUse of energy by moving object

Solution Approach 1:

The patent changes the scheduling parameter from position-based (FIFO) to time-based (ETA) ordering. By calculating estimated time of arrival for each vehicle considering both position and speed, the system optimizes the crossing sequence to maintain higher speeds and improve traffic flow efficiency without significantly increasing system complexity

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The system uses real-time vehicle speed and position data to calculate ETA and determine optimal crossing order. This feedback mechanism allows the scheduling system to account for vehicle speed differences and minimize unnecessary deceleration, thereby reducing energy consumption while maintaining operational simplicity

Inventive Principle:
Principle #23Feedback

3Device complexity

If connected vehicles are scheduled based on FIFO algorithm, then the scheduling approach is straightforward, but travel time increases due to speed reductions and waiting

Engineering Contradiction:
Improvescheduling approach complexityVSAvoidvehicle travel time
Core Design Contradiction:
Device complexityVSLoss of time

Solution Approach 1:

The patent changes the scheduling parameter from position-based (FIFO) to time-based (ETA) ordering. By calculating estimated time of arrival for each vehicle considering both position and speed, the system optimizes the crossing sequence to maintain higher speeds and improve traffic flow efficiency without significantly increasing system complexity

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The system calculates ETA for each vehicle in advance before scheduling the crossing order. This preliminary calculation allows the system to optimize the crossing sequence proactively, ensuring that vehicles are scheduled in an order that minimizes speed adjustments and reduces overall travel time through the intersection

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS11661088B2System and method for scheduling connected vehicles to cross non-signalized intersections
Publication Date: 2023.05.30 TOYOTA JIDOSHA KK
  • US11661088B2 patent drawing
  • US11661088B2 patent drawing
  • US11661088B2 patent drawing

AI summary

A method comprises receiving driving data from a plurality of connected vehicles approaching an intersection, the driving data comprising a speed and position of a connected vehicle, determining estimated times of arrival that each of the connected vehicles will arrive at the intersection based on the driving data, scheduling the connected vehicles to cross the intersection in a particular order based on the estimated times of arrival, and transmitting the scheduled order to the connected vehicles.