Active Transportation Sharing With Real-Time Ephemeral Ride Matching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional ride sharing systems rely on static computational models that inefficiently match shared transportation requests, provide vague information, and require excessive user interactions, leading to computing resource waste and inflexible user interfaces.
Innovation Solution
A dynamic transportation sharing system that intelligently matches new requestors with active transportations of existing requestors based on detected pickup and drop-off locations, providing ephemeral-transportation options in real-time, reducing the need for rigid computational models and improving interface flexibility.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional ride sharing systems use static computational models to match shared transportation requests, then the matching process is simple to implement, but the system consumes excessive computing resources and time to find matches
Solution Approach 1:
The system proactively identifies potential shared ride opportunities before users submit requests by analyzing active transportation data. The backend server continuously monitors transportation requests and identifies matching opportunities in advance, so when a user requests a shared ride, the system can immediately present pre-identified matches rather than computing them from scratch.
Solution Approach 2:
The system transitions from static matching models to dynamic matching by continuously updating transportation data in real-time. The backend server processes ongoing transportation requests and dynamically adjusts matching opportunities based on current vehicle locations, routes, and availability, allowing the system to adapt quickly to changing conditions without excessive computational overhead.
2Loss of information
If conventional systems provide shared transportation match information with historical average cost estimates, then the system can provide cost information to users, but the cost estimates lack accuracy
Solution Approach 1:
The system provides accurate, real-time cost estimates by calculating actual costs based on current route data, vehicle information, and transportation parameters. This real-time feedback mechanism replaces historical averages with dynamically computed costs that reflect the actual shared ride scenario, giving users precise cost information for decision-making.
3Reliability
If conventional systems use rigid timing windows for coordinating pickups of multiple requestors, then the system can ensure coordinated transportation, but the system reduces flexibility for users
Solution Approach 1:
The system replaces rigid timing windows with dynamic time range estimates that adapt to real-time conditions. The backend server calculates flexible pickup time ranges based on vehicle locations, route variations, and traffic conditions, allowing users to see a range of possible pickup times rather than being constrained to fixed windows. This dynamic approach maintains coordination reliability while providing user flexibility.
4Device complexity
If conventional systems require users to back out through several interfaces to change transportation parameters, then the system maintains interface structure, but the system increases user interaction complexity
Solution Approach 1:
The system separates the shared transportation selection from the main transportation request flow by providing it as a distinct option or add-on feature. Users can select shared transportation without navigating through multiple interface layers or canceling their requests. The backend server processes shared ride additions as separate matching operations, allowing users to modify their requests easily while maintaining interface structure.
5Device complexity
If conventional systems provide only shared transportation information after selection, then the system simplifies information presentation, but the system reduces interface flexibility for users
Solution Approach 1:
The system creates a unified interface that presents both shared and non-shared transportation options within the same flow. The backend server provides match information for both transportation types simultaneously, allowing users to compare and select their preferred option without being funneled into separate interface paths. This universal approach maintains interface simplicity while providing transportation flexibility.
Data Source
AI summary
The present disclosure relates to systems, non-transitory computer-readable media, and methods for detecting a potential (or active) shared transportation request from a new requestor's device and an ongoing (or otherwise active) transportation for an existing requestor by a vehicle and then extemporaneously generating an ephemeral-transportation option for display on the new requestor's device to share the ongoing transportation by the vehicle. For example, the disclosed systems can detect a pickup location and a drop-off location associated with a new requestor and one or more active transportations that correlate with the detected locations. Based on the detected pickup and drop-off locations, the disclosed systems match the new requestor with the active transportation by the vehicle for the existing requestor. The disclosed systems then provide, for display on the new requestor's device, an ephemeral-transportation option for the new requestor to share the active transportation with the existing requestor.