Ride-Share Transfer Routing Using Joining Cost and Meeting Points

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing ride-sharing systems do not efficiently facilitate the transfer of riders between vehicles, lacking a method to determine an optimal transfer vehicle and point based on current locations and travel routes.

Innovation Solution

An information processing apparatus and method that acquire requests for vehicle transfers, determine joining costs for multiple vehicles based on their current locations and travel routes, and select a transfer vehicle and joining point that satisfy a prescribed condition, such as minimizing joining cost.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If ride sharing is implemented without transfer functionality, then simple routing is maintained, but transportation efficiency and cost savings are limited

Engineering Contradiction:
Improvetransportation efficiencyVSAvoidsystem complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The ride-sharing system is segmented into single-vehicle routing (existing functionality) and multi-vehicle transfer routing (new functionality). The controller separately handles routing calculations for each vehicle while coordinating transfer points, allowing the system to maintain simple routing for individual vehicles while achieving improved transportation efficiency through transfers.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The controller acts as an intermediary that coordinates between multiple vehicles and riders. It calculates optimal transfer points and routes, managing the complexity of multi-vehicle coordination centrally while allowing individual vehicles to operate with relatively simple routing instructions.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Ease of operation

If transfer points are not determined, then vehicle routes remain simple, but rider convenience and travel burden are reduced

Engineering Contradiction:
Improverider convenienceVSAvoidrouting calculation complexity
Core Design Contradiction:
Ease of operationVSDevice complexity

Solution Approach 1:

The controller performs preliminary calculation of optimal transfer points and routes before riders begin their journeys. By pre-determining the most convenient transfer locations based on vehicle routes and rider destinations, the system improves rider convenience without requiring complex real-time calculations during travel.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The system automatically calculates and determines transfer points and routes without requiring manual rider input or intervention. The controller autonomously optimizes routing based on vehicle locations, rider destinations, and transfer requirements, reducing the operational burden on riders while managing routing complexity centrally.

Inventive Principle:
Principle #25Self-service

3Loss of energy

If multiple vehicles coordinate transfers, then transportation cost savings increase, but route determination complexity increases

Engineering Contradiction:
Improvetransportation costVSAvoidroute determination complexity
Core Design Contradiction:
Loss of energyVSDevice complexity

Solution Approach 1:

The system merges multiple vehicle routes at designated transfer points to create coordinated multi-vehicle journeys. By combining routes strategically at transfer locations, the system achieves greater transportation cost savings through improved vehicle utilization while managing route determination complexity through centralized controller coordination.

Inventive Principle:
Principle #5Merging (Combining)

Data Source

PatentUS12276510B2Information processing apparatus, information processing method, and non-transitory storage medium
Publication Date: 2025.04.15 TOYOTA JIDOSHA KK
  • US12276510B2 patent drawing
  • US12276510B2 patent drawing
  • US12276510B2 patent drawing

AI summary

An information processing apparatus comprising a controller comprising at least one processor configured to perform: acquiring a request that a first vehicle join up with a different vehicle; determining on the basis of a piece of route information indicating a travel route for the first vehicle and current locations of a plurality of vehicles different from the first vehicle, a joining cost related to joining up with the first vehicle for each of the plurality of vehicles; determining a second vehicle that is to join up with the first vehicle and a joining point such that the joining cost satisfies a prescribed condition.