Intelligent vehicles with distributed sensor architectures and embedded processing with computation and data sharing

Patent metadata

Field	Value
Publication number	US-11975714-B2
Application number	US-201916671727-A
Country	US
Kind code	B2
Filing date	Nov 1, 2019
Priority date	Nov 1, 2019
Publication date	May 7, 2024
Grant date	May 7, 2024

Abstract

Presented are embedded control systems with logic for computation and data sharing, methods for making/using such systems, and vehicles with distributed sensors and embedded processing hardware for provisioning automated driving functionality. A method for operating embedded controllers connected with distributed sensors includes receiving a first data stream from a first sensor via a first embedded controller, and storing the first data stream with a first timestamp and data lifespan via a shared data buffer in a memory device. A second data stream is received from a second sensor via a second embedded controller. A timing impact of the second data stream is calculated based on the corresponding timestamp and data lifespan. Upon determining that the timing impact does not violate a timing constraint, the first data stream is purged from memory and the second data stream is stored with a second timestamp and data lifespan in the memory device.

First claim

What is claimed:

1. A method of operating a networked set of embedded controllers operatively connected with a distributed array of sensors, the method comprising:
receiving a first data input stream from a set of the sensors via a first of the embedded controllers;
storing, via a shared data buffer in a resident memory device, the first data input stream with a first timestamp and a first data lifespan;
receiving a second data input stream from the set of sensors via a second of the embedded controllers;
determining a timing impact of the stored first data input stream based on the received second data input stream, wherein determining the timing impact includes calculating a first data elapse time t DE1 for the first data input stream as:

t

D
⁢
E
⁢
1

=

(

(

m
+
1

)

⁢
P
⁢
1

-

⌊

m
⁢
P
⁢
1

P
⁢
2

⌋

⁢
P
⁢
2

)

where m is an integer-type constant, P1 is a first invocation period for the first data input stream, and P2 is a second invocation period for the second data input stream;
determining if the timing impact violates a predefined timing constraint; and
responsive to the timing impact violating the predefined timing constraint, purging the first data input stream from the resident memory device and storing the second data input stream with a second timestamp and a second data lifespan in the resident memory device.

2. The method of claim 1 , wherein the timing impact of the stored first data input stream violates the predefined timing constraint when the first data lifespan is greater than the first data elapse time t DE1 .

3. The method of claim 2 , further comprising purging the second data input stream responsive to the timing impact not violating the predefined timing constraint.

4. The method of claim 1 , further comprising:
receiving multiple computation requests to process data generated via the distributed array of sensors; and
arranging the received computation requests within a computation request queue stored in the resident memory device.

5. The method of claim 4 , further comprising:
determining if at least two of the computation requests arranged in the computation request queue share a common computational procedure; and
responsive to a determination that none of the computation requests share the common computational procedure, maintaining a current sequence of the computation requests arranged in the computation request queue.

6. The method of claim 5 , further comprising:
responsive to the at least two of the computation requests sharing the common computational procedure, determining if a data output of the at least two of the computation requests share a common data structure; and
responsive to the data output of the at least two of the computation requests not sharing the common data structure, rearranging the current sequence of the computation requests arranged in the computation request queue into a rearranged sequence.

7. The method of claim 6 , further comprising:
responsive to the data output of the at least two of the computation requests sharing the common data structure, determining if a hardware capacity of the first or second of the embedded controllers is sufficient to complete the common computational procedure; and
responsive to the hardware capacity not being sufficient to complete the common computational procedure, rearranging the current sequence of the computation requests arranged in the computation request queue into the rearranged sequence.

8. The method of claim 7 , further comprising:
responsive to the data output of the at least two of the computation requests not sharing the common data structure and the hardware capacity not being sufficient to complete the common computational procedure, determining if the at least two of the computation requests satisfy a predefined set of utilization and timing requirements; and
responsive to the at least two of the computation requests not satisfying the predefined set of utilization and timing requirements, restoring the rearranged sequence of the computation requests arranged in the computation request queue to the current sequence.

9. The method of claim 8 , further comprising, responsive to the at least two of the computation requests satisfying the predefined set of utilization and timing requirements, storing the rearranged sequence of the computation requests arranged in the computation request queue in the resident memory device.

10. The method of claim 8 , further comprising determining, responsive to the hardware capacity of the first of the embedded controllers being sufficient to complete the common computational procedure, if the at least two of the computation requests satisfy a predefined set of utilization and timing requirements, wherein the combining the at least two of the computation requests and the updating the computation request queue are further in response to the at least two of the computation requests satisfying the predefined set of utilization and timing requirements.

11. The method of claim 10 , further comprising restoring, responsive to the at least two of the computation requests not satisfying the predefined set of utilization and timing requirements, the rearranged sequence of the computation requests arranged in the computation request queue to the current sequence.

12. The method of claim 7 , further comprising, responsive to the hardware capacity of the first of the embedded controllers being sufficient to complete the common computational procedure:
combining the at least two of the computation requests into a single group request; and
updating the computation request queue to replace the at least two of the computation requests with the single group request.

13. The method of claim 1 , further comprising transmitting a command signal to a steering control module (SCM), a brake system control module (BCM), and/or a powertrain control module of a motor vehicle to execute a control operation based on the second data input stream stored in the resident memory device.

14. A method of operating a networked set of embedded controllers operatively connected with a distributed array of sensors, the method comprising:
receiving a first data input stream from a set of the sensors via a first of the embedded controllers;
storing, via a shared data buffer in a resident memo

Assignees

• Gm Global Tech Operations Llc

Inventors

• Wang Shige
• Tong Wei
• Mckinnie Stephen N
• Zeng Shuqing

Classifications

• B60W30/146 Primary

  Speed limiting · CPC title

• B60W30/09

  Taking automatic action to avoid collision, e.g. braking and steering · CPC title

• B60W30/17

  with provision for special action when the preceding vehicle comes to a halt, e.g. stop and go · CPC title

• H04J3/0644

  External master-clock · CPC title

• H04J3/0664

  unidirectional timestamps · CPC title