期刊文献+

基于发动机稳态工况的整车WLTC循环油耗研究 被引量:8

Research on Vehicle WLTC Fuel Consumption Based on Engine Steady Working Conditions
下载PDF
导出
摘要 根据欧6c/d WLTP(世界统一轻型车测试循环)定义,由车辆参数确定循环换挡策略,转鼓试验得到发动机工况点,聚类计算14个工况点及权重,模拟循环油耗。以Matlab为编程工具,建立了14点稳态工况代替WLTC循环模拟油耗的一套完整方法,包括WLTC换挡策略、整车转鼓试验和k-means聚类计算方法。14点模拟油耗结果百公里油耗8.90L,与转鼓试验百公里油耗9.19L相差3.16%,表明以发动机的稳态工况代替整车循环进行WLTC油耗分析是可行的,这将简化面向WLTC和欧6c/d指标的发动机燃烧开发和优化改进的标定策略,提高开发工作的效率。 In accordance with the regulation of Euro 6c/d world harmonized light vehicle test procedure (WLTP), gear shift strategy was calculated based on vehicle properties, engine working conditions was obtained through vehicle chassis dyno test and 14 steady-state points with related weight adopted to analogize WLTC test fuel consumption were calculated through clustering algorithm. A method integrating calculation and test was developed using Matlab as the programming platform, and it was composed of WLTC gear shift strategy, vehicle chassis dynamometer test and k-means clustering algorithm. The deviation of 3. 16% between 8.90 L per 100 km of the analogical fuel consumption from the consequent 14 points and 9.19 L per 100 km of the chassis dyno test result implies the feasibility of utilizing certain steady working conditions to simulate vehicle WLTC test in fuel consumption analysis and a promising efficiency promotion in the development and optimization of the engines facing WLTC and Euro 6c/d emissions limitation, which is attributed to simplification of the calibration strategy.
出处 《内燃机工程》 EI CAS CSCD 北大核心 2016年第6期235-240,共6页 Chinese Internal Combustion Engine Engineering
关键词 内燃机 欧6c/d 世界统一轻型车测试循环 换挡策略 转鼓试验 K-MEANS算法 发动机稳态工况 油耗 IC engine Euro 6c/d WLTC gear shift strategy chassis dyno test k-means algorithm engine steady working condition fuel consumption
  • 相关文献

参考文献3

二级参考文献25

  • 1张翔.汽车发动机匹配技术的研究[J].上海汽车,2006(1):24-26. 被引量:7
  • 2GB18352.5-2013,轻型汽车污染物排放限值及测量方法(中国第五阶段)[S].
  • 3Anil K J. Data clustering:50 years beyond K-Means[J].Pattern Recognition Letters,2010,(08):651-666.
  • 4Likas A,Vlassis M,Verbeek J. The global K-means clustering algorithm[J].Pattern Recognition,2003,(02):451-461.doi:10.1016/S0031-3203(02)00060-2.
  • 5Selim S Z,Al-Sultan K S. Analysis of global K-means,an incremental heuristic for minimum sum-of-squares clustering[J].Journal of Classification,2005,(22):287-310.
  • 6Bellman R,Dreyfus S. Applied dynamic programming[M].Princeton,New Jersey:Princeton University Press,1962.
  • 7Aloise D,Deshpande A,Hansen P. NP-hardness of euclidean sum-of-squares clustering[J].Machine Learning,2009,(02):245-248.
  • 8Mahajan M,Nimbor P,Varadarajan K. The planar K-means problem is NP-hard[J].Lecture Notes in Computer Science,2009,(5431):274-285.
  • 9Ball G,Hall D. ISODATA,a novel method of data analysis and pattern classification[Technical rept. NTIS AD 699616. ][M].California:Stanford Research Institute,1965.
  • 10WANG Cheng,LI Jiao-jiao,BAI Jun-qing. Max-Min K- means Clustering Algorithm and Application in Post-processing of Scientific Computing[A].Napoli,2011.7-9.

共引文献314

同被引文献47

引证文献8

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部