EP0612917B1 - Commande de moteur - Google Patents

Commande de moteur Download PDF

Info

Publication number
EP0612917B1
EP0612917B1 EP19930102978 EP93102978A EP0612917B1 EP 0612917 B1 EP0612917 B1 EP 0612917B1 EP 19930102978 EP19930102978 EP 19930102978 EP 93102978 A EP93102978 A EP 93102978A EP 0612917 B1 EP0612917 B1 EP 0612917B1
Authority
EP
European Patent Office
Prior art keywords
time
list
controlling
job
engine according
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
EP19930102978
Other languages
German (de)
English (en)
Other versions
EP0612917A1 (fr
Inventor
Heinz Dipl.-Ing. Neugebauer (Fh)
Herbert Dipl.-Ing. Ziegler (Fh)
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Siemens AG
Original Assignee
Siemens AG
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Siemens AG filed Critical Siemens AG
Priority to EP19930102978 priority Critical patent/EP0612917B1/fr
Priority to DE59303660T priority patent/DE59303660D1/de
Publication of EP0612917A1 publication Critical patent/EP0612917A1/fr
Application granted granted Critical
Publication of EP0612917B1 publication Critical patent/EP0612917B1/fr
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • FMECHANICAL ENGINEERING; LIGHTING; HEATING; WEAPONS; BLASTING
    • F02COMBUSTION ENGINES; HOT-GAS OR COMBUSTION-PRODUCT ENGINE PLANTS
    • F02DCONTROLLING COMBUSTION ENGINES
    • F02D41/00Electrical control of supply of combustible mixture or its constituents
    • F02D41/24Electrical control of supply of combustible mixture or its constituents characterised by the use of digital means
    • F02D41/26Electrical control of supply of combustible mixture or its constituents characterised by the use of digital means using computer, e.g. microprocessor
    • F02D41/266Electrical control of supply of combustible mixture or its constituents characterised by the use of digital means using computer, e.g. microprocessor the computer being backed-up or assisted by another circuit, e.g. analogue

Definitions

  • the invention relates to an engine control according to the preamble of claim 1.
  • Priority-high are programs that trigger an engine control process at a given crank angle, e.g. Fuel is injected or ignited. So-called background programs run with low priority. Time-dependent programs are divided into different groups, at least one so-called shortest-distance program group and longer-distance programs. At least one of the longer programs is appended to the shortest-distance programs, forming a network group.
  • This operating system is complex.
  • a method for motor control is known from EP 0 017 219 A2, in which control values of actuators are calculated from operating parameters.
  • a digital computer with a system time of 10 mms checks whether the first and second time monitors contain subroutines that are to be started. The first time monitor monitors important and the second time monitor monitors less important tasks. The tasks are managed using a table in which the tasks are arranged according to cyclical times and priorities. The cyclic times are monitored with a counter and controlled via an address list (cf. claim 1, part 1).
  • the invention has for its object to provide a motor controller, the operating system reduces the effort for time management.
  • Essential components of an engine control system 1 are a computing part 2 and a real-time part 3 (FIG. 1).
  • the computing part and the real-time part are connected to one another by a so-called two-port or three-port RAM 4, by a plurality of so-called handshake lines 5 and by an interrupt line 6.
  • Several input lines 10 and output lines 11 are also connected to the computing part 2.
  • Analogue temperature signals for example, reach the computing part via an input line 10 and are digitized in this in an internal AD converter.
  • Other input lines 10 are connected to a so-called HSI input and to port pins of the computing part 2.
  • About the output lines 11 are from a so-called HSO output of the computation part, pulse-width-modulated control signals LLFS to the engine idling fill actuator and signals TEV to the vehicle tank vent valve.
  • the vehicle and engine components not belonging to the engine control 1 are not shown, nor is the internal structure of the processors used, since they can be found in the manufacturer's manuals. Only a few of the input and output lines are shown as representative of all actually existing lines.
  • a line 14 forms a serial interface of the computing part 2 and via a bus 15 it is connected to two memory components, a RAM 16 and an EPROM 17.
  • the task of the computing part in FIG. 2 is to record and evaluate the measurement data received, either directly or via the real-time part 3, and to calculate control signals for the ignition, injection, etc. based on this and output them to the corresponding actuators via the real-time part 3.
  • an operating system is used for the motor control, which is designed as described below.
  • the occurrence of a time event is to be equated with the statement that the waiting time specified for the event has expired.
  • the present engine control system has two different time monitors.
  • the time grid is the same for both time monitors and is 10 ms. A finer grading is possible, but not necessary. It depends on the processor used.
  • a first time monitoring ZV_KURZ of the operating system generates short time intervals, i.e. Time intervals up to about 50 ms as described below. Every task, i.e. each order to be processed by the first engine control is assigned its own time entry, which is managed by the time management. After activating the task, this time entry is set to its initial value. When entering a time order, the event time to be entered is calculated from the current system time plus the time interval of the order.
  • a task time counter is now compared with the current system time AKZEIT with each program run.
  • the actions to be carried out to process the tasks are activated or initiated.
  • Very short actions are carried out immediately while the time management is running, otherwise a task is set to the "ready" state.
  • Each action is carried out by a program part - e.g. a subroutine - carried out. Accordingly, each action is assigned an address in a program memory.
  • the advantage of this first time monitoring is the low administrative effort when placing and deleting time orders.
  • the amount of processing time is for querying the time counters, since each counter must be queried for every basic time event. This time management is therefore primarily suitable for recurring events with different durations. For one-off events, however, the processing effort is relatively high.
  • the first time management is primarily used for diagnostic communication, i.e. used to carry out a data exchange between the engine control 1 and an external diagnostic device.
  • time job list 19 which is stored as a table in the RAM 16, can be seen from FIG.
  • a list position 0.1, ..., n is assigned to each time task.
  • Each time job consists of 4 bytes. Two of these are written into a first line 20 of a list position, for example list position 0. Of these, the high-order high byte represents the address and the low-order low byte the associated status information.
  • the time of the event is entered in a second line 21 of the list position, ie the time at which the respective event occurs when the waiting time expires and the associated action is started.
  • the time calculated for an event and entered in line 21 is compared in the system time grid, ie every 10 ms, with the current time, that of a time not produced here System clock is delivered. If both times match, the respective event is triggered, for example a program run is started, a request is set or a task is assigned to a priority level.
  • the time interval is the length of time from the current point in time to the point in time at which the event occurs.
  • the time interval can be a constant or a definable quantity.
  • the list position indicates at which point in the list the time event is entered and which actions are to be carried out when the event occurs.
  • the status contains the above-mentioned additional information about the time task.
  • Reg_1 to Reg_3 are working registers of the respective task level.
  • the above-described first time monitoring ZV_KURZ is shown in a structure diagram 22 in FIG. 3 in the overview.
  • a second time monitor ZV_LANG is implemented in such a way that the processing time that occurs for each basic time event is as short as possible and that even one-off events can be managed without much additional effort. It is used for time intervals from approximately 50 ms up to the maximum permissible time of around 655,350 ms in the motor control described here.
  • actions to be performed here are to activate a task or to forward time stamps to one or more tasks.
  • the second time monitoring is used, for example, to control a run-on time during which the motor control After switching off the ignition, carry out tasks (e.g. troubleshooting) and must therefore be supplied with power. It is also used to control intake air and coolant temperature measurement, ⁇ -probe heating, the generation of the actual throttle valve signal, the fuel pump and much more.
  • An essential part of the second time monitoring are two lists: a time job list 24, which contains freely definable time events, and an address list 24, which contains the start addresses of the actions to be carried out, which are assigned to the individual time jobs (FIG. 4). If a time order is placed, it is entered in the time order list 24. If the time order placed is not the only one in the list, the orders are sorted according to the event times. The time task whose event time is the next occurrence is then the first in the list. The job with the furthest future is at the bottom of the list.
  • the advantage of this second time monitoring is the short processing time. With every time management call occurring in the basic time grid, only the first entry must be queried for expiry. Has the event not yet occurred, i.e. the time until the event has not yet expired, the list 24 need not be queried any further.
  • each time order in the time order list 24 also has a link field 27 which establishes the connection between the individual time orders.
  • link field 27 which establishes the connection between the individual time orders.
  • the address list 25 contains in the individual list places the addresses 32 of the actions to be carried out, which are assigned to the respective time event.
  • a time job is created by a task with a macro call ZAERT [ list position ] , [ time interval ] issued. Its parameters are:
  • List position specifies at which position in the list the time event is entered and which actions are carried out when the event occurs.
  • Time interval is the length of time from the current point in time until the event occurs.
  • the time interval can be a constant or a predeterminable quantity.
  • a time order that has already been placed can be called up with a call ZADEL [list place] can be canceled; it is removed from the time task list.
  • the time job list is searched for expired time jobs. If an expired time job is found, i.e. An order whose waiting time has expired is removed from the list and the actions associated with it are carried out. The list is then searched again for another expired time job. The process is repeated until there is no longer an expired time job in the list.
  • a table ZA_LIST_LA is to be increased by the number of new time orders to be inserted. This is possible by reserving 4 bytes per time job.
  • a module ZEITVERW.A96 there is an EQU instruction or assignment instruction for the list position for each time task. Each new time task must be assigned its list position number using an EQU instruction.
  • the start address of the program section to be executed in the time event is entered in a table AKTIONS_TAB. The place where the start address is stored must match the list place number.
  • the actions to be performed are defined at the end of the module. The program sequence must be concluded with an unconditional jump to the SUABZA label.
  • the individual steps of these structograms 22 and 34 to 36 are laid down in plain text, so that the structograms themselves are explanatory.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • General Engineering & Computer Science (AREA)
  • Microelectronics & Electronic Packaging (AREA)
  • Chemical & Material Sciences (AREA)
  • Combustion & Propulsion (AREA)
  • Mechanical Engineering (AREA)
  • Combined Controls Of Internal Combustion Engines (AREA)

Claims (8)

  1. Procédé de commande de moteur, comportant une partie de calcul (2), au moyen de laquelle des valeurs de mesure représentant des grandeurs de fonctionnement du moteur sont saisies et interprétées et des signaux de commande pour des organes d'actionnement agissant sur le fonctionnement du moteur sont engendrés, ce procédé impliquant l'utilisation d'un système de fonctionnement qui commande la saisie, l'interprétation et la production de signaux de commande et sous lequel différents types de programmes sont activés en fonction du temps, le système de fonctionnement étant réalisé comme dispositif de gestion de temps mettant en oeuvre les contrôles de temps suivants:
    - un premier contrôle de temps pour des actions dont chaque temps d'activation doit être contrôlé dans des intervalles de temps courts, et
    - un deuxième contrôle de temps pour des actions dont chaque temps d'activation doit être contrôlé dans des intervalles de temps longs,
       étant entendu que le premier contrôle de temps inclut une liste chronologique des tâches (19),
       caractérisé en ce que, dans la liste chronologique des tâches (19), chaque ordre chronologique est mémorisé à une place (0, ...,n) d'une liste, et en ce que l'ordre chronologique à mémoriser comporte une adresse d'une action, une information d'état, et un instant auquel l'action doit être activée.
  2. Procédé de commande de moteur suivant la revendication 1, caractérisé en ce qu'au moyen du premier contrôle de temps, sont gérés des ordres, dont le traitement ou l'activation doit se faire à l'intérieur d'un petit nombre de coup d'horloge du système, et, au moyen du deuxième contrôle de temps, sont gérées des tâches dont le traitement ou l'activation dure pendant un plus grand nombre de coup d'horloge du système.
  3. Procédé de commande de moteur suivant la revendication 1, caractérisé en ce que l'horloge du système est divisé en une trame comportant une unité de temps de 10 ms.
  4. Procédé de commande de moteur suivant la revendication 1, caractérisé en ce que le premier contrôle de temps inclut une liste d'adresse pour les actions à accomplir et une table des temps cycliques.
  5. Procédé de commande de moteur suivant la revendication 1, caractérisé en ce que l'instant mémorisé lors de chaque déroulement de programme est comparé au contenu d'un compteur représentant le temps actuel du système et, en cas de concordance, les actions à associer à l'ordre chronologique sont déclenchées.
  6. Procédé de commande de moteur suivant la revendication 1, caractérisé en ce que le deuxième contrôle de temps comporte une liste des ordres chronologiques (24), dans laquelle sont consignés les ordres chronologiques, et une liste d'adresses (25), dans laquelle sont consignées les adresses de début des actions associées aux différents ordres chronologiques.
  7. Procédé de commande de moteur suivant la revendication 6, caractérisé en ce que les ordres chronologiques sont, dans la liste des ordres chronologique (24), disposés dans un ordre de classement par temps croissants, et en ce que cet ordre de classement est réalisé par des liaisons de programme, qui déterminent la liaison entre les différents ordres chronologiques.
  8. Procédé de commande de moteur suivant la revendication 6, caractérisé en ce que chaque fois, pour chaque appel se produisant à chaque coup d'horloge du système par la gestion de temps, seul le premier ordre de la liste des ordres chronologiques (24) est appelé pour être exécuté.
EP19930102978 1993-02-25 1993-02-25 Commande de moteur Expired - Lifetime EP0612917B1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP19930102978 EP0612917B1 (fr) 1993-02-25 1993-02-25 Commande de moteur
DE59303660T DE59303660D1 (de) 1993-02-25 1993-02-25 Motorsteuerung

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
EP19930102978 EP0612917B1 (fr) 1993-02-25 1993-02-25 Commande de moteur

Publications (2)

Publication Number Publication Date
EP0612917A1 EP0612917A1 (fr) 1994-08-31
EP0612917B1 true EP0612917B1 (fr) 1996-09-04

Family

ID=8212638

Family Applications (1)

Application Number Title Priority Date Filing Date
EP19930102978 Expired - Lifetime EP0612917B1 (fr) 1993-02-25 1993-02-25 Commande de moteur

Country Status (2)

Country Link
EP (1) EP0612917B1 (fr)
DE (1) DE59303660D1 (fr)

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0017219B1 (fr) * 1979-04-06 1987-10-14 Hitachi, Ltd. Procédé et dispositif de commande électronique pour moteur
DE3826526A1 (de) * 1988-08-04 1990-02-08 Bosch Gmbh Robert Verfahren und vorrichtung zum einstellen von betriebsgroessen einer brennkraftmaschine

Also Published As

Publication number Publication date
EP0612917A1 (fr) 1994-08-31
DE59303660D1 (de) 1996-10-10

Similar Documents

Publication Publication Date Title
EP1330685B1 (fr) Procede et dispositif de controle destines a la mise en service de systemes commandes au moyen d'une logique de programme
DE3416939C2 (fr)
DE4125389C1 (fr)
EP0759195B1 (fr) Systeme de commande destine a une installation technique
EP0525432A2 (fr) Méthode de changement des données de configuration de système dans un système de commutation de télécommunications
EP1034475B1 (fr) Procede pour tester les composantes d'un programme oriente objets
DE69114905T2 (de) Verfahren und System zum Optimieren des Abschaltens in Systemen aus programmierbaren Vorrichtungen.
DE3033526A1 (de) Elektronisches steuerverfahren fuer brennkraftmaschinen
DE3513937A1 (de) Verfahren zur ueberwachung eines drehzahlgeber-signals
DE10243856B4 (de) Regler und Verfahren zum Betreiben eines Reglers
WO2000004429A1 (fr) Systeme de commande avec ordinateur individuel
EP0799441B1 (fr) Procede de commande de processus techniques
DE10232875A1 (de) Verfahren zur Steuerung der Antriebseinheit eines Fahrzeugs
EP0413044A1 (fr) Système d'automatisation flexible pour procédés industriels variables
DE69406959T2 (de) Verfahren zur Verwaltung von Anwendungen mit Standardprotokollen
EP0525350B1 (fr) Procédé et dispositif pour tester des appareils de commande
EP0838054B1 (fr) Procede et dispositif de commande pour une commande graphique d'operations dans un systeme de gestion d'un reseau
EP0360135B1 (fr) Méthode de traitement de signaux d'interruption dans un ordinateur
EP1514180A2 (fr) Limitation du temps de reaction d'un processus logiciel
EP0612917B1 (fr) Commande de moteur
CH686378A5 (de) Maschinenverwaltungssystem.
EP0303869A1 (fr) Système de communication numérique à structure modulaire comprenant des moyens de communication d'opération technique
DE3318410A1 (de) Verfahren zur veraenderung und optimierung von daten und programmablaeufen fuer programmierte steuergeraete in kraftfahrzeugen
EP0499213B1 (fr) Système de communication RNIS à structure modulaire
EP0990964A1 (fr) Méthode d'opération d'un dispositif d'automatisation

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE CH DE DK ES FR GB GR IE IT LI LU MC NL PT SE

17P Request for examination filed

Effective date: 19940915

RBV Designated contracting states (corrected)

Designated state(s): DE FR GB IT

17Q First examination report despatched

Effective date: 19950516

GRAG Despatch of communication of intention to grant

Free format text: ORIGINAL CODE: EPIDOS AGRA

GRAH Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOS IGRA

GRAH Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOS IGRA

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FR GB IT

REF Corresponds to:

Ref document number: 59303660

Country of ref document: DE

Date of ref document: 19961010

ET Fr: translation filed
ITF It: translation for a ep patent filed
GBT Gb: translation of ep patent filed (gb section 77(6)(a)/1977)

Effective date: 19961107

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed
REG Reference to a national code

Ref country code: GB

Ref legal event code: IF02

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20040205

Year of fee payment: 12

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES;WARNING: LAPSES OF ITALIAN PATENTS WITH EFFECTIVE DATE BEFORE 2007 MAY HAVE OCCURRED AT ANY TIME BEFORE 2007. THE CORRECT EFFECTIVE DATE MAY BE DIFFERENT FROM THE ONE RECORDED.

Effective date: 20050225

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20050225

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20050225

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20090219

Year of fee payment: 17

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20090213

Year of fee payment: 17

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20101029

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20100301

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20100901