BP神经网络的收敛问题

研究了BP神经网络的收敛问题。基于随机理论 ,提出了解决网络收敛性问题的随机优选法。该方法不仅在任何条件下都能得到问题的具有一定精度的解答 ,而且收敛速度很快     

Optimal nonmyopic gambling strategy for the generalized Kelly criterion

We consider the optimal wagers to be made by a gambler who starts with a given initial wealth. The gambler faces a sequence of two-outcome games, i.e., “win” vs. “lose,” and wishes to maximize the expected value of his terminal utility. It has been shown by Kelly, Bellman, and others that if the terminal utility is of the form log x, where x is the terminal wealth, then the optimal policy is myopic, i.e., the optimal wager is always to bet a constant fraction of the wealth provided that the probability of winning exceeds the probability of losing. In this paper we provide a critique of the simple logarithmic assumption for the utility of terminal wealth and solve the problem with a more general utility function. We show that in the general case, the optimal policy is not myopic, and we provide analytic expressions for optimal wager decisions in terms of the problem parameters. We also provide conditions under which the optimal policy reduces to the simple myopic case. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 639–654, 1997     

基于遗传算法的MIL-STD-188-220c标准最佳转发树的构造

针对MIL-STD-188-220C标准的路由协议多目的地址最佳转发树问题,提出一种基于遗传算法的优化算法,仿真结果表明,该算法具有收敛快,寻路成功率高的优点。     

Revenue maximization in two-station tandem queueing systems

We study optimal pricing for tandem queueing systems with finite buffers. The service provider dynamically quotes prices to incoming price sensitive customers to maximize the long-run average revenue. We present a Markov decision process model for the optimization problem. For systems with two stations, general-sized buffers, and two or more prices, we describe the structure of the optimal dynamic pricing policy and develop tailored policy iteration algorithms to find an optimal pricing policy. For systems with two stations but no intermediate buffer, we characterize conditions under which quoting either a high or a low price to all customers is optimal and provide an easy-to-implement algorithm to solve the problem. Numerical experiments are conducted to compare the developed algorithms with the regular policy iteration algorithm. The work also discusses possible extensions of the obtained results to both three-station systems and two-station systems with price and congestion sensitive customers using numerical analysis.     

Planning gamma accelerated degradation tests with two accelerating variables

Gamma accelerated degradation tests (ADT) are widely used to assess timely lifetime information of highly reliable products with degradation paths that follow a gamma process. In the existing literature, there is interest in addressing the problem of deciding how to conduct an efficient, ADT that includes determinations of higher stress‐testing levels and their corresponding sample‐size allocations. The existing results mainly focused on the case of a single accelerating variable. However, this may not be practical when the quality characteristics of the product have slow degradation rates. To overcome this difficulty, we propose an analytical approach to address this decision‐making problem using the case of two accelerating variables. Specifically, based on the criterion of minimizing the asymptotic variance of the estimated q quantile of lifetime distribution of the product, we analytically show that the optimal stress levels and sample‐size allocations can be simultaneously obtained via a general equivalence theorem. In addition, we use a practical example to illustrate the proposed procedure.     

舰船腐蚀电场建模及补偿最优解验证

基于等效偶极子法,从补偿偶极子长度、角度、大小三方面给出了任意角度的补偿偶极子场解析式,再利用电荷矢量叠加原理,建立了"腐蚀偶极子+补偿偶极子"电场模型。仿真以单轴桨船为例,先验证"腐蚀偶极子+补偿偶极子"电场模型的正确性,再进行补偿偶极子对舰船电场的影响验证,从而得出补偿最优解。模拟实验结果表明,补偿阳极在工程允许条件下距离补偿系统接船端最远处,且补偿系统平行于水平面和船体时补偿效果最优;在补偿最优条件下,理论上是可以抵消原舰船腐蚀电场的。     

Dynamic routing of prioritized warranty repairs

Recent years have seen a strong trend toward outsourcing warranty repair services to outside vendors. In this article we consider the problem of dynamically routing warranty repairs to service vendors when warranties have priority levels. Each time an item under warranty fails, it is sent to one of the vendors for repair. Items covered by higher priority warranty receive higher priority in repair service. The manufacturer pays a fixed fee per repair and incurs a linear holding cost while an item is undergoing or waiting for repair. The objective is to minimize the manufacturer's long‐run average cost. Because of the complexity of the problem, it is very unlikely that there exist tractable ways to find the optimal routing strategies. Therefore, we propose five heuristic routing procedures that are applicable to real‐life problems. We evaluate the heuristics using simulation. The simulation results show that the index‐based “generalized join the shortest queue” policy, which applies a single policy improvement step to an initial state‐independent policy, performs the best among all five heuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

电驱动车辆反馈线性化自适应滑模滑移率控制

针对驱动和制动工况下电驱动汽车的滑移率控制这一强非线性和不确定性控制问题,提出了一种基于反馈线性化的自适应滑模控制(ASMC)方法。针对车辆驱动、制动工况下的车轮滑移率进行了动力学分析,建立了统一的状态方程。充分利用系统已知模型和参数,采用线性化反馈消除非线性变化的控制量增益系数的影响,通过对反馈项增益参数的自适应调整,适应附着路面不确定参数变化的控制要求,克服系统控制中存在的主要非线性和不确定性部分,对于系统难以建模描述部分,视为扰动,利用滑模控制抑制系统该部分的不确定性因素,同时保证系统响应的快速性,并对算法进行了Lyapunov稳定性分析。最后,以某型电动汽车为对象进行了仿真分析,结果表明采用ASMC控制系统动态响应快、精度高、抗扰能力强,对路面参数变化具有较强的鲁棒性,同时输出控制量抖振小。     

基于IMM-RUASFF的网络化目标跟踪算法

针对目前网络化目标跟踪算法存在实时性差、精度低等问题进行了研究。首先,基于网络信息共享需求,建立了网络探测节点的目标跟踪模型;其次,网络探测节点目标跟踪需求和实战要求发现目标经常是有多种运动状态并存,而单一模型的滤波器不能满足对机动目标跟踪性能的要求,采用了基于交互式多模型(Interacting Multiple Model,IMM)的有反馈实时更新的异步状态融合算法。最后,针对多个探测节点目标跟踪的状态融合估计问题,提出了一种有反馈实时更新的异步状态融合算法,通过仿真验证了算法的有效性。     

光电跟瞄平台稳定控制器设计

以考虑光电跟瞄平台三轴环架间的耦合所建立的数学模型为基础,对光电跟瞄平台的稳定回路分别设计了基于线性矩阵不等式(LMI)的状态反馈H∞控制器和多输入系统极点配置控制器;分别建立基于所设计两种控制器的跟瞄平台稳定控制系统,并对其控制效果进行对比研究,结果表明,二者皆能实现对光电跟瞄平台的稳定控制,都具有一定的鲁棒性能。其中H∞控制器的设计更简单,超调更小且达到稳定的时间短,更适合于光电跟瞄平台的稳定控制。