Dynamic Engine Segment Positioning for Combustion Setpoint Timing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Internal combustion engines face challenges in determining optimal combustion setpoint values, especially at increased engine speeds where time between segments decreases, leading to suboptimal combustion and complexity in managing segment transitions.
Innovation Solution
A method that adjusts the position of segment tasks to ensure setpoint values are available within a predefined range by advancing or delaying the segment based on the difference between the availability and application times, thereby optimizing the determination and application of setpoint values.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If the segment position is fixed at a predetermined angular position, then the control logic is simple, but at high engine speeds the setpoint values are not available early enough, leading to suboptimal combustion
Solution Approach 1:
The segment position is made dynamic rather than fixed. The control unit determines the segment position adaptively based on engine speed and the time required to calculate setpoint values. This allows the system to optimize combustion efficiency at different operating conditions without requiring complex predetermined scheduling logic
Solution Approach 2:
The system uses feedback from the calculation time of setpoint values to adjust the segment position. The control unit monitors how long calculations take and positions the segment accordingly, ensuring setpoint values are ready in time for optimal combustion while adapting to varying computational loads
2Reliability
If the segment task is executed at a fixed time interval, then the timing prediction is simple, but the setpoint values may not be calculated early enough at high speeds, requiring complex fallback logic
Solution Approach 1:
The task scheduling is made dynamic by adjusting the segment position based on actual calculation performance and engine speed. This eliminates the need for complex fallback logic between fixed intervals and adaptive scheduling, as the system continuously adapts to ensure reliable setpoint availability
Solution Approach 2:
The control unit self-adjusts the segment position based on its own calculation performance. By monitoring how long setpoint calculations take, the system automatically positions segments to ensure timely completion, reducing the need for external scheduling complexity
3Reliability
If the segment position is advanced to ensure early availability of setpoint values, then combustion efficiency is maintained, but the difference between availability and application times may become too large, wasting time
Solution Approach 1:
The system uses feedback to optimize the segment position, advancing it only as much as necessary to ensure setpoint values are available in time. By monitoring the actual time required for calculations and the engine speed, the control unit determines the minimum advance needed, avoiding excessive time gaps while maintaining reliable combustion optimization
Data Source
AI summary
A method for managing an engine for which segment tasks are initiated at a moment referred to as “segment”, in order to determine setpoint values which must be available before a predetermined angular time, having the following steps: a) executing a segment task; b) determining the difference between the angular starting time for application of the setpoints and the position corresponding to the availability of the setpoint values; c) comparing the difference determined in step b) with a lower difference value and a greater difference value; and d) modifying the segment if the difference determined in step b) is not between the lower and greater difference values, the position of the segment being advanced if the difference determined in b) is less than the lower difference value and the position of the segment being delayed if the difference determined in b) is greater than the greater difference value.

