Search Results

A GT-Power Fast Run Model simplified from detail model for HIL is verified with a bench test using the dSPACE Simulator. Firstly, the conversion process from a detailed model to FRM model is briefly described. Then, the spark timing, fuel pulse with control for FAR, and torque level control are developed for proof of concept. Moreover a series of FRM/Simulink co-simulation and HIL tests are conducted. In the summary, the test results are presented and compared with GT detailed model simulations. The test results show that the FRM/dSPACE HIL stays consistent in most variables of interest under 0.7-0.9 real-time factor condition between 1000 - 5000 RPM. The same steady-state can be reached by RCP controllers or with GT-Power internal controllers. The transient states are close using different control algorithm. The main purpose of HIL application is achieved, despite inconsistencies in performance data like fuel consumption.

In a math-based control algorithm design, model-based simulation and testing are very important as an integral part of design process. There are many advantages of using modeling and simulation in the algorithm design. In this paper, Algorithm-in-the-Loop and Hardware-in-the-Loop approaches are adopted for a transmission control algorithm development. A practical approach is introduced on how to test the control algorithms with a reliable plant (virtual engine, transmission, and vehicle) model in the closed-loop simulation. In using combination of open-loop and closed-loop simulations, various key behavior test cases are developed and documented for the success of control algorithms development. Secondly, the same test cases are reused and verified against the production codes, which are automatically generated from the math-based control algorithm models.

Response Surface Models are often used as a surrogate for expensive black-box functions during optimization to reduce computational cost. Often, the CAE analysis models are highly nonlinear and multi-modal. A response surface approximation of such analysis as a result is highly multi-modal; i.e. it contains multiple local optima. A gradient-based optimizer working with such a response surface will often converge to the nearest local optimum. There does not exist any method to guarantee a global optima for non-convex multi-modal functions. For such problems, we propose an efficient algorithm to find as many distinct local optima as possible. The proposed method is specifically designed to work in large dimensions (about 100 ∼ 1000 design variables and similar number of constraints) and can identify most of the locally optimal solutions in a reasonable amount of time.

In this paper, we propose algorithms for cost minimization of physical wires that are used to connect electronic devices in the vehicle. The wiring cost is one of the most important drivers of electrical architecture selection. Our algorithms perform wire routing from a source device to a destination device through harnesses, by selecting the optimized wire size. In addition, we provide optimized splice allocation with limited constraints. Based on the algorithms, we develop a tool which is integrated into an off-the-shelf optimization and workflow system-level design tool. The algorithms and the tool provide an efficient, flexible, scalable, and maintainable approach for cost analysis and architecture selection.

Several application developers are currently faced with the problem of moving a complex system from a single-core to a multicore platform. The problem encompasses several issues that go from modeling issues (the need to represent the system features of interest with sufficient accuracy) to analysis and optimization techniques, to the selection of the right formulations for constraints that relate to time. We report on the initial findings in a case study in which the application of interest is a fuel injection system. We provide an analysis on the limitations of AUTOSAR and the existing modeling tools with respect to the representation of the parameters of interest for timing analysis, and we discuss applicable optimization methods and analysis algorithms.