首页> 外文会议>IEEE International Conference on Vehicular Electronics and Safety >Reuse historic costs in dynamic programming to reduce computational complexity in the context of model predictive optimization
【24h】

Reuse historic costs in dynamic programming to reduce computational complexity in the context of model predictive optimization

机译:在模型预测优化的背景下,在动态编程中重用历史成本以降低计算复杂性

获取原文

摘要

Energy efficiency has become a major issue in trade, transportation and environment protection. While the next generation of zero emission propulsion systems still have difficulties in reaching similar travel distances as combustion engine propulsion systems, it is already possible to increase fuel efficiency in regular vehicles by applying a more fuel efficient driving behaviour. An adapted Dynamic Programming approach is used to calculate optimal behaviour profiles for the road ahead within a finite optimization horizon. The main purpose of this publication is the development of a strategy to reuse historic minimal costs in order to reduce the computational complexity of future optimization steps. The percent reduction is deterministic and increases with the discretization degree of the optimization horizon.
机译:能源效率已经成为贸易,运输和环境保护中的主要问题。尽管下一代零排放推进系统在达到与内燃机推进系统相似的行驶距离方面仍然有困难,但已经可以通过采用更省油的驾驶行为来提高常规车辆的燃油效率。自适应动态规划方法用于在有限的优化范围内计算前方道路的最佳行为曲线。该出版物的主要目的是开发一种策略,以重用历史上的最小成本,以减少未来优化步骤的计算复杂性。减少的百分比是确定性的,并且随着优化范围的离散化程度而增加。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号