Application of Dynamic Programming Algorithm Based on Model Predictive Control in Hybrid Electric Vehicle Control Strategy

A good hybrid vehicle control strategy cannot only meet the power requirements of the vehicle,but also effectively save fuel and reduce emissions.In this paper,the construction of model predictive control in hybrid electric vehicle is proposed.The solving process and the use of reference trajectory are discussed for the application of MPC based on dynamic programming algorithm.The simulation of hybrid electric vehicle is carried out under a specific working condition.The simulation results show that the control strategy can effectively reduce fuel consumption when the torque of engine and motor is reasonably distributed,and the effectiveness of the control strategy is verified.

Comparison between dynamic programming and genetic algorithm for hydro unit economic load dispatch

The hydro unit economic load dispatch （ELD） is of great importance in energy conservation and emission reduction. Dynamic programming （DP） and genetic algorithm （GA） are two representative algorithms for solving ELD problems. The goal of this study was to examine the performance of DP and GA while they were applied to ELD. We established numerical experiments to conduct performance comparisons between DP and GA with two given schemes. The schemes included comparing the CPU time of the algorithms when they had the same solution quality, and comparing the solution quality when they had the same CPU time. The numerical experiments were applied to the Three Gorges Reservoir in China, which is equipped with 26 hydro generation units. We found the relation between the performance of algorithms and the number of units through experiments. Results show that GA is adept at searching for optimal solutions in low-dimensional cases. In some cases, such as with a number of units of less than 10, GA＇s performance is superior to that of a coarse-grid DP. However, GA loses its superiority in high-dimensional cases. DP is powerful in obtaining stable and high-quality solutions. Its performance can be maintained even while searching over a large solution space. Nevertheless, due to its exhaustive enumerating nature, it costs excess time in low-dimensional cases.

A Dynamic Programming Algorithm on Project- Gang Investment Decision Making

The investment decision making of Project Gang, the projects that are associated with one another on economy and technique, is studied. In order to find out the best Scheme that can make the maximum profit, a dynamic programming algorithm on the investment decision making of Project Gang is brought forward, and this algorithm can find out the best Scheme of distributing the m resources to the n Items in the time of O(m 2 n).

A Dynamic Programming Algorithm for the Ridersharing Problem Restricted with Unique Destination and Zero Detour on Trees

We deal with the problem of sharing vehicles by individuals with similar itineraries which is to find the minimum number of drivers, each of which has a vehicle capacity and a detour to realize all trips. Recently, Gu et al. showed that the problem is NP-hard even for star graphs restricted with unique destination, and gave a polynomial-time algorithm to solve the problem for paths restricted with unique destination and zero detour. In this paper we will give a dynamic programming algorithm to solve the problem in polynomial time for trees restricted with unique destination and zero detour. In our best knowledge it is a first polynomial-time algorithm for trees.

A NEW DETERMINISTIC FORMULATION FOR DYNAMIC STOCHASTIC PROGRAMMING PROBLEMS AND ITS NUMERICAL COMPARISON WITH OTHERS

A new deterministic formulation,called the conditional expectation formulation,is proposed for dynamic stochastic programming problems in order to overcome some disadvantages of existing deterministic formulations.We then check the impact of the new deterministic formulation and other two deterministic formulations on the corresponding problem size,nonzero elements and solution time by solving some typical dynamic stochastic programming problems with different interior point algorithms.Numerical results show the advantage and application of the new deterministic formulation.

Predictive Mathematical and Statistical Modeling of the Dynamic Poverty Problem in Burundi: Case of an Innovative Economic Optimization System

The mathematical and statistical modeling of the problem of poverty is a major challenge given Burundi’s economic development. Innovative economic optimization systems are widely needed to face the problem of the dynamic of the poverty in Burundi. The Burundian economy shows an inflation rate of -1.5% in 2018 for the Gross Domestic Product growth real rate of 2.8% in 2016. In this research, the aim is to find a model that contributes to solving the problem of poverty in Burundi. The results of this research fill the knowledge gap in the modeling and optimization of the Burundian economic system. The aim of this model is to solve an optimization problem combining the variables of production, consumption, budget, human resources and available raw materials. Scientific modeling and optimal solving of the poverty problem show the tools for measuring poverty rate and determining various countries’ poverty levels when considering advanced knowledge. In addition, investigating the aspects of poverty will properly orient development aid to developing countries and thus, achieve their objectives of growth and the fight against poverty. This paper provides a new and innovative framework for global scientific research regarding the multiple facets of this problem. An estimate of the poverty rate allows good progress with the theory and optimization methods in measuring the poverty rate and achieving sustainable development goals. By comparing the annual food production and the required annual consumption, there is an imbalance between different types of food. Proteins, minerals and vitamins produced in Burundi are sufficient when considering their consumption as required by the entire Burundian population. This positive contribution for the latter comes from the fact that some cows, goats, fishes, ···, slaughtered in Burundi come from neighboring countries. Real production remains in deficit. The lipids, acids, calcium, fibers and carbohydrates produced in Burundi are insufficient for consumption. This negative contribution proves a Burundian food deficit. It is a decision-making indicator for the design and updating of agricultural policy and implementation programs as well as projects. Investment and economic growth are only possible when food security is mastered. The capital allocated to food investment must be revised upwards. Demographic control is also a relevant indicator to push forward Burundi among the emerging countries in 2040. Meanwhile, better understanding of the determinants of poverty by taking cultural and organizational aspects into account guides managers for poverty reduction projects and programs.

Bus frequency optimization in a large-scale multi-modal transportation system:integrating 3D-MFD and dynamic traffic assignment

A properly designed public transport system is expected to improve traffic efficiency.A high-frequency bus service would decrease the waiting time for passengers,but the interaction between buses and cars might result in more serious congestion.On the other hand,a low-frequency bus service would increase the waiting time for passengers and would not reduce the use of private cars.It is important to strike a balance between high and low frequencies in order to minimize the total delays for all road users.It is critical to formulate the impacts of bus frequency on congestion dynamics and mode choices.However,as far as the authors know,most proposed bus frequency optimization formulations are based on static demand and the Bureau of Public Roads function,and do not properly consider the congestion dynamics and their impacts on mode choices.To fill this gap,this paper proposes a bi-level optimization model.A three-dimensional Macroscopic Fundamental Diagram based modeling approach is developed to capture the bi-modal congestion dynamics.A variational inequality model for the user equilibrium in mode choices is presented and solved using a double projection algorithm.A surrogate model-based algorithm is used to solve the bi-level programming problem.

A hybrid dynamic programming-rule based algorithm for real-time energy optimization of plug-in hybrid electric bus

The optimization of the control strategy of a plug-in hybrid electric bus(PHEB) for the repeatedly driven bus route is a key technique to improve the fuel economy. The widely used rule-based(RB) control strategy is lacking in the global optimization property, while the global optimization algorithms have an unacceptable computation complexity for real-time application. Therefore, a novel hybrid dynamic programming-rule based(DPRB) algorithm is brought forward to solve the global energy optimization problem in a real-time controller of PHEB. Firstly, a control grid is built up for a given typical city bus route, according to the station locations and discrete levels of battery state of charge(SOC). Moreover, the decision variables for the energy optimization at each point of the control grid might be deduced from an off-line dynamic programming(DP) with the historical running information of the driving cycle. Meanwhile, the genetic algorithm(GA) is adopted to replace the quantization process of DP permissible control set to reduce the computation burden. Secondly, with the optimized decision variables as control parameters according to the position and battery SOC of a PHEB, a RB control is used as an implementable controller for the energy management. Simulation results demonstrate that the proposed DPRB might distribute electric energy more reasonably throughout the bus route, compared with the optimized RB. The proposed hybrid algorithm might give a practicable solution, which is a tradeoff between the applicability of RB and the global optimization property of DP.

一种抑制DPA评价函数扩散的方法

传统DPA算法在跟踪目标的过程中存在评价函数的扩散现象,即目标周围的评价函数会被"抬高",形成以目标所在位置为顶点的"目标锥"。若目标相距较近,各目标锥会相互融合,导致DPA算法难以有效地将全部目标检测出来。且经研究发现,目标的信噪比越高、或检测时间越长,扩散的程度就越大,故抑制各目标(特别是较高信噪比目标)的扩散很有必要。为此,提出了一种对评价函数扩散的抑制方法,目标信噪比越高,该方法对扩散的抑制效果越显著。仿真结果表明,采用新方法后目标周围评价函数的扩散程度相比传统DPA算法有了明显减弱,提高了DPA算法检测密集目标的能力。

Data⁃Based Feedback Relearning Algorithm for Robust Control of SGCMG Gimbal Servo System with Multi⁃source Disturbance

Single gimbal control moment gyroscope(SGCMG)with high precision and fast response is an important attitude control system for high precision docking,rapid maneuvering navigation and guidance system in the aerospace field.In this paper,considering the influence of multi-source disturbance,a data-based feedback relearning(FR)algorithm is designed for the robust control of SGCMG gimbal servo system.Based on adaptive dynamic programming and least-square principle,the FR algorithm is used to obtain the servo control strategy by collecting the online operation data of SGCMG system.This is a model-free learning strategy in which no prior knowledge of the SGCMG model is required.Then,combining the reinforcement learning mechanism,the servo control strategy is interacted with system dynamic of SGCMG.The adaptive evaluation and improvement of servo control strategy against the multi-source disturbance are realized.Meanwhile,a data redistribution method based on experience replay is designed to reduce data correlation to improve algorithm stability and data utilization efficiency.Finally,by comparing with other methods on the simulation model of SGCMG,the effectiveness of the proposed servo control strategy is verified.

Optimal Tracking Control for a Class of Unknown Discrete-time Systems with Actuator Saturation via Data-based ADP Algorithm

为有致动器浸透和未知动力学的分离时间的系统的一个班的一个新奇最佳的追踪控制方法在这份报纸被建议。计划基于反复的适应动态编程(自动数据处理) 算法。以便实现控制计划，一个 data-based 标识符首先为未知系统动力学被构造。由介绍 M 网络，稳定的控制的明确的公式被完成。以便消除致动器浸透的效果， nonquadratic 表演功能被介绍，然后一个反复的自动数据处理算法被建立与集中分析完成最佳的追踪控制解决方案。为实现最佳的控制方法，神经网络被用来建立 data-based 标识符，计算性能索引功能，近似最佳的控制政策并且分别地解决稳定的控制。模拟例子被提供验证介绍最佳的追踪的控制计划的有效性。

Combined Algorithms of Optimal Resource Allocation

Under study is the problem of optimum allocation of a resource. The following is proposed: the algorithm of dynamic programming in which on each step we only use the set of Pareto-optimal points, from which unpromising points are in addition excluded. For this purpose, initial approximations and bilateral prognostic evaluations of optimum are used. These evaluations are obtained by the method of branch and bound. A new algorithm “descent-ascent” is proposed to find upper and lower limits of the optimum. It repeatedly allows to increase the efficiency of the algorithm in the comparison with the well known methods. The results of calculations are included.

Parallel Minimax Searching Algorithm for Extremum of Unimodal Unbounded Function

In this paper we consider a parallel algorithm that detects the maximizer of unimodal function f(x) computable at every point on unbounded interval (0, ∞). The algorithm consists of two modes: scanning and detecting. Search diagrams are introduced as a way to describe parallel searching algorithms on unbounded intervals. Dynamic programming equations, combined with a series of liner programming problems, describe relations between results for every pair of successive evaluations of function f in parallel. Properties of optimal search strategies are derived from these equations. The worst-case complexity analysis shows that, if the maximizer is located on a priori unknown interval (n-1], then it can be detected after cp(n)=「2log「p/2」+1(n+1)」-1 parallel evaluations of f(x), where p is the number of processors.

User preference-based intelligent road route recommendation using SARSA and dynamic programming

Traffic congestion is one of the main challenges in transportation engineering. It directly impactsthe economy by increasing travel time and affecting the environment by excessive fuel consumptionand emission. Road route recommendation to overcome the congestion by alternativeroute suggestions has gained high importance. The existing route recommendation systems areproposed using the reinforcement learning algorithm (Q-learning). The techniques suggestedin this paper are state-action-reward-state-action (SARSA) algorithm and dynamic programming(DP) to guide the commuters to reach the destination with an optimal solution. The algorithmconsiders travel time, cost, flexibility, and traffic intensity as the user preference attributes torecommend an optimal route. The recommended system is implemented by building a roadnetwork graph. We assign values to each user preference attribute along the edges, which cantake high(1) or low(0) values. By considering these values, the system recommends the route.The proposed system performance is evaluated based on computation time, cumulative reward,and accuracy. The results show that DP outperforms the SARSA algorithm.

不同驱动系统下纯电动汽车关键性能对比研究

为比较纯电动汽车不同驱动系统的关键性能,基于同一整车参数和某公司提供的可变绕组永磁同步电机试验数据,对纯电动汽车电机驱动系统开展了相关研究。基于精英保留遗传算法和动态规划理论,对单挡、两挡电控机械式自动变速器驱动系统的速比进行了设计优化。采用了精英保留遗传算法和动态规划理论对系统速比进行设计优化,并对可变绕组永磁同步电机绕组切换过程进行了动力性和经济性设计。仿真结果表明,在动力性上,两挡自动变速器驱动系统的加速性能最优;在经济性上,可变绕组永磁同步电机驱动系统的百公里能耗最小,单挡自动变速器驱动系统的动力性和经济性表现最不理想。

基于改进拍卖算法灾后救援多无人机任务分配

为提高灾后无人机(UAV)救援的效率,本文研究多无人机灾后侦察任务分配问题。考虑无人机续航时间、灾区地形以及是否遇到飞行障碍等因素,以无人机执行任务总时间最小为优化目标建立多无人机侦察任务分配模型,设计了混合动态规划的改进拍卖算法(hybrid dynamic programming auction, HDPA)求解模型。首先将无人机执行任务所需时间价值化,以单无人机执行任务所获收益最大为优化目标,设计动态规划算法获得单无人机执行任务最优序列作为初始投标方案,以防止拍卖算法陷入局部最优、提高算法的收敛速度;其次设计价格更新机制,解决投标任务之间的冲突,最终获得多无人机侦察任务分配最佳方案。实验结果表明,各无人机执行任务较为均衡,完成任务的总时间与传统的拍卖算法、遗传算法、海洋捕食者算法(marine predators algorithm, MPA)相比平均缩短了3.5%、5.6%、4.75%。

功率分流式混合动力汽车能量管理策略研究

混合动力汽车同时采用内燃机和电机作为驱动源,可以同时克服传统内燃机工作效率低和纯电汽车行驶里程短的问题。如何对两种驱动源进行合理分配成为了混合动力汽车能量管理的关键问题。这里针对一款复合功率分流式动力系统搭建了AMESim和MATLAB/Simulink的联合仿真平台,并在NEDC和WLTC工况下仿真分析了基于规则的CS能量管理策略和基于动态规划算法的能量管理策略。得出基于动态规划算法的能量在NEDC和WTLC下工况的最优燃油消耗量分别为5.77L/100km,6.57L/100km;相较于规则控制策略分别降低了4.15%、6.3%。

带有动态到达工件的分布式柔性作业车间调度问题研究

分布式柔性作业车间调度是生产调度的1个重要分支,工件的动态到达作为实际生产中的1种常见扰动情况,进一步增加了作业车间调度问题的复杂性和不确定性。针对带有工件动态到达的分布式柔性作业车间调度问题(DA-DFJSP),提出1种分批调度策略,将原本的动态调度问题转化成一系列连续调度区间上的静态调度问题,构建以最大完工时间为优化目标的混合整数规划模型;在此基础上,结合问题特征采用批次、工厂、工序、机器的4层染色体编码及快速贪婪搜索插入的解码方式改进遗传算法,同时引入多种交叉、变异算子来增强染色体的多样性;最后,基于FJSP标准算例构建DA-DFJSP测试算例进行仿真对比实验,验证所提策略和改进算法的求解优势。结果表明:相较于传统的重调度策略和改进前的遗传算法,采用分批调度策略和改进的遗传算法(IGA)所求调度方案具有更短的完工周期、更均匀的工厂加工负荷及更高的设备工作效率,IGA与分批调度策略之间有高度的契合性,能够有效提升生产效率。

泵站单机组优化调度组合改进粒子群算法

开展泵站节能降耗优化模型算法研究、实现泵站经济运行具有重要的现实意义。动态规划法在泵站优化调度模型求解中较为常用,针对动态规划法决策变量离散处理对精度的影响,引入决策变量在可行域内随机生成并不断更新的粒子群算法,并提出“Sobol序列优化初始种群+实时调整惯性权重+正余弦替代学习因子”多策略融合的改进方法,通过4种基准函数性能测试,验证了改进粒子群算法在搜索能力和计算精度上有显著提升。在此基础上,将改进粒子群算法应用于某大型调水泵站以耗电费用最小为目标的单机组变速优化模型求解中,得到不同时段的最优决策方案及相应的目标最优值,并与动态规划法计算结果进行对比,2种方法最优决策过程基本一致,最优目标值精度相当。结果表明:粒子群算法组合改进策略是可行的,计算结果是可靠的,可以作为泵站优化调度模型求解的一种有效方法。

汽车门板内饰多机器人焊接的动态协同规划

为了减小多机器人协同焊接的路径长度并提高机器人之间的负载均衡度,提出了基于动态规划-个体差异进化遗传算法的协同焊接规划方法。以多机器人协同焊接路径长度、负载均衡度为优化目标建立了优化模型,并分析了协同焊接约束条件。针对单机器人焊接路径规划问题,在遗传算法中针对染色体进化能力的差异性,提出了个体差异进化策略,给出了基于个体差异进化遗传算法的路径规划方法。针对多机器人协同焊接问题,使用动态规划将其划分为3个子问题,实现了多机器人协同焊接任务分配和路径规划。经某型汽车前门焊点路径规划验证,个体差异进化遗传算法规划的路径最佳长度、平均长度均优于传统遗传算法;经后门焊点的4机器人协同焊接验证,在满足无干涉约束下,这里方法的路径长度、负载均衡度优于文献[11]离散粒子群算法。实验验证了这里方法在多机器人协同焊接分配和规划问题中的优越性。