Prediction of jet engine parameters for control design using genetic programming

The simulation of a jet engine behavior is widely used in many different aspects of the engine development and maintenance. Achieving high quality jet engine control systems requires the iterative use of these simulations to virtually test the performance of the engine avoiding any possible damage on the real engine. Jet engine simulations involve the use of mathematical models which are complex and may not always be available. This paper introduces an approach based on Genetic Programming (GP) to model different parameters of a small engine for control design such as the Exhaust Gas Temperature (EGT). The GP approach has no knowledge of the characteristics of the engine. Instead, the model is found by the evolution of models based on past measurements of parameters such as the pump voltage. Once the model is obtained, it is used to predict the behaviour of the jet engine one step ahead. The proposed approach is successfully applied for the simulation of a Behotec j66 jet engine and the results are presented

Evolution engine technology in exhaust gas recirculation for heavy-duty diesel engine

In this present year, engineers have been researching and inventing to get the optimum of less emission in every vehicle for a better environmental friendly. Diesel engines are known reusing of the exhaust gas in order to reduce the exhaust emissions such as NOx that contribute high factors in the pollution. In this paper, we have conducted a study that EGR instalment in the vehicle can be good as it helps to prevent highly amount of toxic gas formation, which NOx level can be lowered. But applying the EGR it can lead to more cooling and more space which will affect in terms of the costing. Throughout the research, fuelling in the engine affects the EGR producing less emission. Other than that, it contributes to the less of performance efficiency when vehicle load is less

Improve Model Testing by Integrating Bounded Model Checking and Coverage Guided Fuzzing

The control logic models built by Simulink or Ptolemy have been widely used in industry scenes. It is an urgent need to ensure the safety and security of the control logic models. Test case generation technologies are widely used to ensure the safety and security. State-of-the-art model testing tools employ model checking techniques or search-based methods to generate test cases. Traditional search based techniques based on Simulink simulation are plagued by problems such as low speed and high overhead. Traditional model checking techniques such as symbolic execution have limited performance when dealing with nonlinear elements and complex loops. Recently, coverage guided fuzzing technologies are known to be effective for test case generation, due to their high efficiency and impressive effects over complex branches of loops. In this paper, we apply fuzzing methods to improve model testing and demonstrate the effectiveness. The fuzzing methods aim to cover more program branches by mutating valuable seeds. Inspired by this feature, we propose a novel integration technology SPsCGF, which leverages bounded model checking for symbolic execution to generate test cases as initial seeds and then conduct fuzzing based upon these worthy seeds. In this manner, our work combines the advantages of the model checking methods and fuzzing techniques in a novel way. Since the control logic models always receive signal inputs, we specifically design novel mutation operators for signals to improve the existing fuzzing method in model testing. Over the evaluated benchmarks which consist of industrial cases, SPsCGF could achieve 8% to 38% higher model coverage and 3x-10x time efficiency compared with the state-of-the-art works.Comment: 10 page

Sampling-Strategien zur Erzeugung von Szenarien für die simulationsbasierte Validierung von Fahrerassistenzsystemen

Scenario-based testing is a common approach to verify and validate Advanced Driving Assistance System / Autonomous Driving (ADAS/AD) of motor vehicles. The main challenge in scenario-based testing is the selection of a finite number of scenarios to represent an infinite amount of possible scenarios. Beyond that, there is no metric to evaluate scenarios thus the quality of the testing process. We introduce a generic process chain to ensure traceability and reproducibility of scenario selection, by generating scenarios automatically. A Feature Model (FM) builds the input data for our process chain. We identify three concepts to represent a scenario using a FM. We create a tool to transfer a configuration of the FM into a concrete scenario. A sample represents a set of scenarios, we define them as scenario suite. We evaluate the quality of a scenario suite by applying its scenarios to various mutants of driving functions in a simulation tool. The quality of the scenario suites is then determined by the number of discovered mutants. We evaluate the influence of various FMs in combination with common sampling algorithms such as ICPL, Chvatal, and IncLing, using an Autonomous Emergency Braking (AEB) as subject system. We discover a correlation between FM and mutation score as well as between mutation score and sampling algorithm. Within a scenario suite, we identify a strict separation between scenarios that are good to kill a mutant and those which are not. We discover, that sampling algorithms that aim for feature interaction coverage produce stronger scenario suites than feature-wise sampling algorithms. An evaluation of the relevance of single features on the mutation score provides features that are frequently involved in scenarios that are good to kill mutants. Beyond that, we discover a correlation between scenario suite and mutants that affects the mutant detection

Multiobjective gas turbine engine controller design using genetic algorithms

This paper describes the use of multiobjective genetic algorithms (MOGAs) in the design of a multivariable control system for a gas turbine engine. The mechanisms employed to facilitate multiobjective search with the genetic algorithm are described with the aid of an example. It is shown that the MOGA confers a number of advantages over conventional multiobjective optimization methods by evolving a family of Pareto-optimal solutions rather than a single solution estimate. This allows the engineer to examine the trade-offs between the different design objectives and configurations during the course of an optimization. In addition, the paper demonstrates how the genetic algorithm can be used to search in both controller structure and parameter space thereby offering a potentially more general approach to optimization in controller design than traditional numerical methods. While the example in the paper deals with control system design, the approach described can be expected to be applicable to more general problems in the fields of computer aided design (CAD) and computer aided engineering (CAE

Metamodelling of multivariable engine models for real-time flight simulation.

Sophisticated real-time distributed flight simulation environments may be constructed from a wide range of modelling and simulation tools. In this way accuracy, detail and model flexibility may be incorporated into the simulator. Distributed components may be constructed by a wide range of methods, from high level environments such as Matlab, through coded environments such as C or Fortran to hardware-in-the- loop. In this paper the Response Surface Methodology is combined with a hyper-heuristic (evolutionary algorithm) and applied to the representation of computationally intensive non-linear multivariable engine modelling. The paper investigates the potential for metamodelling (models of models) dynamic models which were previously too slow to be included in multi-component, high resolution real-time simulation environments. A multi-dimensional gas turbine model with five primary control inputs, six environmental inputs and eleven outputs is considered. An investigation has been conducted to ascertain to what extent these systems can be approximated by response surfaces with experiments which have been designed by hyper-heuristics as a first step towards automatic modelling methodology

Simulator Semantics for System Level Formal Verification

Many simulation based Bounded Model Checking approaches to System Level Formal Verification (SLFV) have been devised. Typically such approaches exploit the capability of simulators to save computation time by saving and restoring the state of the system under simulation. However, even though such approaches aim to (bounded) formal verification, as a matter of fact, the simulator behaviour is not formally modelled and the proof of correctness of the proposed approaches basically relies on the intuitive notion of simulator behaviour. This gap makes it hard to check if the optimisations introduced to speed up the simulation do not actually omit checking relevant behaviours of the system under verification. The aim of this paper is to fill the above gap by presenting a formal semantics for simulators.Comment: In Proceedings GandALF 2015, arXiv:1509.0685