Method and device for creating a time schedule for transmitting messages on a bus system

Abstract

A method for creating a time schedule for transmitting messages on a bus system (bus schedule), the time schedule being created by using a genetic algorithm.

Description

FIELD OF THE INVENTION[0001]The present invention relates to a method and a device as well as a computer program and a computer program product for creating a time schedule for transmitting messages on a bus system.BACKGROUND INFORMATION[0002]The networking of control units, sensors and actuator systems with the aid of a communications system or bus system has drastically increased in recent years in the construction of modern motor vehicles and in machine construction, especially in the field of machine tools and in automation. In this context, synergistic effects may be achieved by the distribution of functions to a plurality of control units. These are called distributed systems. The communication between various stations is taking place more and more via a bus or a bus system. The communications traffic on the bus, access and reception mechanisms, as well as error handling are governed via a protocol.[0003]In the automotive field, the established protocol is the CAN (controller ...

AI Technical Summary

Benefits of technology

The present invention is a method and device for creating a time schedule for transmitting messages on a bus system using genetic algorithms. The messages are divided into periodic and spontaneous messages, and an identifier is assigned to each message for easier evaluation. The genetic algorithm finds an optimal bus schedule by comparing the latency times of different time schedules and selecting the one with the highest efficiency. The method can be implemented as a computer program and can quickly find an optimal solution in a non-transparent solution space. The genetic algorithm ensures that one moves quickly to an optimal solution and can find new solutions through crossbreeding and mutation. The solution approach can be further pursued or rejected based on the evaluation function.

Problems solved by technology

The protocol is comparatively inflexible, and adding new nodes is only possible when the respective time domains were already left open beforehand.

Thus, great demands are placed on the planning tools.

However, as described above, when planning a TTCAN network or TTCAN bus system, the time-controlled messages will predetermine the framework for the creation of the bus schedule.

Currently available commercial tools, particularly CAN-based tools, still do not support these requirements, such as, for example, TTCAN-specific planning, at all.

First solution approaches for strictly time-controlled communications protocols such as TTP / C show that the algorithms to be used quickly end up as an NP-complete problem.

While randomized, genetic algorithms are no simple random walk.

In contrast to genetic algorithms, many functions F supply a wide divergence and discontinuous results, and are therefore unsuitable for many traditional approaches of the search for solutions F(x).

However, this solution approach would possibly only have been found after an unacceptably long time using conventional search algorithms.

Images