Vehicle Action-Graph Data Compression for Bandwidth-Limited Transmission

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Modern vehicles generate large quantities of data, making it impractical and technically infeasible to collect, communicate, and store all data due to limitations in available memory and computer network bandwidth.

Innovation Solution

A system where a computer on board the vehicle and a remote server store a network graph of actions performable by vehicle components, with nodes representing actions and directed links showing the order and costs of transitioning between them, allowing for the logging and transmission of reduced sequences that exclude intermediate actions, which are then reconstructed by the server.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of information

If all vehicle data is collected and transmitted, then data completeness is improved, but network bandwidth consumption increases and memory requirements increase

Engineering Contradiction:
Improvedata completenessVSAvoiddata volume
Core Design Contradiction:
Loss of informationVSQuantity of substance

Solution Approach 1:

The patent extracts only the essential elements of vehicle data sequences for transmission. By identifying and transmitting only the beginning action, final action, and cost information while excluding intermediate actions on lowest-cost paths, the system extracts the minimum necessary data to maintain sequence integrity while dramatically reducing data volume.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The system performs preliminary processing of vehicle data sequences before transmission by pre-identifying lowest-cost paths using the network graph. This preliminary action allows the system to determine which intermediate actions can be excluded in advance, enabling efficient compression without losing critical information needed for reconstruction.

Inventive Principle:
Principle #10Preliminary action

2Quantity of substance

If intermediate actions are excluded from transmission, then bandwidth usage is reduced, but data reconstruction complexity increases

Engineering Contradiction:
Improvetransmitted data volumeVSAvoidreconstruction complexity
Core Design Contradiction:
Quantity of substanceVSDevice complexity

Solution Approach 1:

The network graph serves as an intermediary structure that enables efficient data reconstruction. By pre-storing the network graph with all possible actions and transition costs at both the vehicle and server, the system creates a reference framework that simplifies the reconstruction process. The server uses this intermediary graph to efficiently identify and insert the correct intermediate actions based on the transmitted beginning and final actions.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Quantity of substance

If reduced sequences are transmitted, then memory usage is reduced, but information loss increases

Engineering Contradiction:
Improvestored data volumeVSAvoidsequence detail
Core Design Contradiction:
Quantity of substanceVSLoss of information

Solution Approach 1:

The system implements feedback through the cost information transmitted with each reduced sequence. The cost represents the probability or likelihood of the action sequence occurring, providing feedback that enables the server to assess data quality and accuracy. This feedback mechanism allows the system to maintain confidence in the reconstructed sequences even when intermediate actions are excluded.

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS12139146B2Vehicle data transmission
Publication Date: 2024.11.12 FORD GLOBAL TECH LLC
  • US12139146B2 patent drawing
  • US12139146B2 patent drawing
  • US12139146B2 patent drawing

AI summary

A system includes a computer on board a vehicle and a server remote from the vehicle. The computer and the server each store a network graph of actions performable by components of the vehicle that includes costs of transitioning between the actions. The computer is programmed to log a sequence of the actions; upon determining that a sub-sequence of the sequence constitutes a lowest-cost path from the beginning action to the final action based on the network graph, store a reduced sequence including a beginning action and a final action of the sub-sequence ordered immediately after the beginning action, the reduced sequence excluding at least one intermediate action from the sub-sequence; and transmit the reduced sequence to a server remote from the vehicle. The server is programmed to determine the sequence from the reduced sequence based on the network graph.