Control Logic of Prognostic Type for Vehicles
Authors: Baulina E.E., Dementiev U.V., Krutashov A.V., Serebryakov V.V., Deev O.I., Filonov A.I. | Published: 09.06.2016 |
Published in issue: #6(675)/2016 | |
Category: Transportation and Power Engineering | |
Keywords: prognostic type of control logic, emergency control system, v2v scheme, Markov chain |
The rapid development of active safety systems for vehicles necessitates improvement in vehicle control logic that takes into account delay time of mechanical systems, signal processing time by the controller, various options for obtaining quantitative data on the output parameters within a wide range of values with the ability to predict characteristics of the implemented program cycle. Currently, the most popular optimization method of control logic is improving the accuracy of the intellectual assessment of the situation, i.e. increasing the number of sensors that can monitor the vehicle’s position with regards to the basic parameters. However, this method is associated with accumulation of errors and inaccuracies due to the imperfection of control elements and control actions of the driver. To ensure compliance of control logic with the actions of mechanical systems in real time, a prognostic model of control logic is proposed. This model allows synchronization of the quantitative indicators of the output data and the information returned to the control element in real time, thus reducing the discrepancy between the start time of information processing and the time of performing the required actions by the control element.
References
[1] Ragesh R. Vehicle Dynamics and Control. New York, Springer, 2006. 121 p.
[2] Pacejka H.B. Tire and Vehicle Dynamics. Elsevier, Society of Automotive Engineers Inc., 2002. 627 p.
[3] Bakker E., Nyborgi L., Pacejka H.B. Tyre modeling for use in vehicle dynamics studies. SAE Technical Paper, 1987, no. 870421.
[4] Gusein-Zade S.M. Zadacha o razborchivoi neveste [The problem of a picky bride]. Moscow, MTsNMO publ., 2003. 24 p.
[5] Goldberg D.E. Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA, Addison-Wesley, 1989. 432 p.
[6] Li Z. Measure-valued branching Markov processes. New York, Heidelberg, Springer, 2011. 362 p.
[7] Shiryaev A.N. A remark on the quickest detection problems. Statistics and Risk Modeling, 2004, vol. 22, pp. 79–82.
[8] Shiryaev A.N. On Optimum Methods in Quickest Detection Problems. Theory of Probability and its Applications, 1963, vol. 8, iss. 1, pp. 22–46.
[9] Badalbaev I.S., Zubkov A.M. Theorems for a Sequence of Branching Processes with Immigration. Theory of Probability and its Applications, 1984, vol. 28, iss. 2, pp. 404–409.
[10] Berezovskii B.A., Borzenko V.I., Kempner L.M. Binarnyi otnosheniia v mnogokriterial’noi optimizatsii [Binary relations in multiobjective optimization]. Moscow, Nauka publ., 1981. 150 p.
[11] Pugachev V.S. Teoriia veroiatnostei i matematicheskaia statistika [Probability theory and mathematical statistics]. Moscow, Fizmatlit publ., 2002. 496 p.
[12] Vatutin V.A., Topchii V.A. Limit Theorem for Critical Catalytic Branching Random Walks. Theory of Probability and its Applications, 2005, vol. 49, iss. 3, pp. 498–518.
[13] Volovik M.A. Mnogokriterial’nyi vybor tekhnologii upravleniia vosstanovleniem rabotosposobnosti kosmicheskikh apparatov sviazi i retransliatsii na statsionarnykh orbitakh. Diss. dokt. tekh. nauk [Multicriteria choice of management technology recovery of spacecraft communications and relay on stationary orbits. Dr. tech. sci. diss.]. Krasnoyarsk, NPO PM publ., 1989. 153 p.
[14] Goldberg D.E. Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA, Addison-Wesley, 1989. 432 p.