Method for integration of calculations having a variable running time into a time-controlled architecture

Patent metadata

Field	Value
Publication number	US-2016104265-A1
Application number	US-201414892610-A
Country	US
Kind code	A1
Filing date	May 20, 2014
Priority date	May 21, 2013
Publication date	Apr 14, 2016
Grant date	—

Abstract

The invention relates to a method for the integration of calculations having a variable running time into a distributed, time-controlled, real-time computer architecture, which real-time computer architecture consists of a plurality of computer nodes, wherein a global time having known precision is available to the computer nodes, wherein at least a portion of the computer nodes is equipped with sensor systems, in particular different sensor systems for observing the environment, and wherein the computer nodes exchange messages via a communication system, wherein at the start of each cyclical frame F i having the duration d, the computer nodes acquire raw input data by means of a sensor system, wherein the start times of frame F i are deduced from the progress of the global time, and wherein the pre-processing of the raw input data is carried out by means of algorithms, the running times of which depend upon the input data, and wherein the value of the ageing index AI=0 is assigned to a pre-processing result which is produced within the frame F i at the start of which the input data were acquired, and wherein the value of the ageing index AI=1 is assigned to a pre-processing result which is produced within the frame following the frame in which the input data were acquired, and wherein the value AI=n is assigned to a pre-processing result which is produced in the n-th frame after the data acquisition, and wherein the ageing indices of the pre-processing results are taken into consideration in the computer nodes which carry out the fusion of the pre-processing results of the sensor systems.

First claim

1 . A method for the integration of calculations having a variable running time into a distributed, time-controlled, real-time computer architecture, which real-time computer architecture consists of a plurality of computer nodes, wherein a global time having known precision is available to the computer nodes, wherein at least a portion of the computer nodes is equipped with sensor systems, in particular different sensor systems for observing the environment, and wherein the computer nodes exchange messages via a communication system, the method comprising:
collecting, by the computer nodes, at the start of each cyclical frame Fi having the duration d, raw input data by means of a sensor system, wherein the start times of frame Fi are deduced from the progress of the global time; and pre-processing the raw input data by means of algorithms, the running times of which depend upon the input data, and wherein the value of the ageing index AI=0 is assigned to a pre-processing result which is produced within the frame Fi at the start of which the input data were collected, and wherein the value of the ageing index AI=1 is assigned to a pre-processing result which is produced within the frame following the frame in which the input data were collected, and wherein the value AI=n is assigned to a pre-processing result which is produced in the n-th frame after the data acquisition, and wherein the ageing indices of the pre-processing results are taken into consideration in the computer nodes which carry out the fusion of the pre-processing results of the sensor systems.

2 . The method of claim 1 , wherein, in the fusion of the pre-processing results, the weighting of a pre-processing result is determined in such a way that a pre-processing result having AI=0 receives the highest weighting and the weighting of pre-processing results having AI>0 is that much smaller, the greater the value AI is.

3 . The method of claim 1 , wherein, in the fusion of a pre-processing result having AI>0, the position of a dynamic object contained in this pre-processing result, which object moves with a velocity vector v, is corrected by the value v.AI.d, wherein d indicates the duration of a frame.

4 . The method of claim 1 , wherein the fusion of the pre-processing results does not take place until after the end of the frame during which all pre-processing results of the data, which were detected at the same time, are available.

5 . The method of claim 1 , wherein a computer node, which has not yet concluded the pre-processing at the end of the l-th frame after the data acquisition, carries out a reset of the computer node.

6 . The method of claim 1 , wherein a pre-processing process, which has not yet concluded the pre-processing at the end of the l-th frame after the data acquisition, is restarted.

7 . The method of claim 1 , wherein a computer node, which has carried out a reset, sends a diagnostic message to a diagnostic computer immediately after the restart.

8 . The method of claim 1 , wherein a monitor process in a computer node ( 141 ) sends a frame control message to increase the frame duration to computer nodes ( 121 , 122 , 123 ) if an a priori determined percentage P of the pre-processing results has an ageing index AI>1.

9 . The method of claim 1 , wherein the TTEthernet protocol is used to transmit messages between the node computers.

Assignees

• Fts Computertechnik Gmbh

Inventors

• Poledna Stefan
• Glück Martin

Classifications

• G01S13/86 Primary

  Combinations of radar systems with non-radar systems, e.g. sonar, direction finder · CPC title

• G06F18/251

  of input or preprocessed data · CPC title

• G08G1/166

  for active traffic, e.g. moving vehicles, pedestrians, bikes · CPC title

• G08G1/165

  for passive traffic, e.g. including static obstacles, trees · CPC title

• G06T3/0056 Primary

  Physics · mapped topic