基于UML可适应的教学考评系统分析与设计

该文给出了UML的概念与要点,应用UML对教学考评系统进行了建模。给出了系统的用例模型、整体结构模型、静态模型、动态模型,并分析了模型对教学考评变化的可适应性。     

虚拟人运动中受扰的平衡保持算法

为了更加真实且实时地模拟运动中虚拟人恢复平衡的反应动作,提出一种针对受到外界作用力扰动的虚拟人平衡保持算法.首先通过虚拟人质心位移和速度来判断平衡性;然后借助生物力学的研究成果设计了具有人体特性的虚拟人运动受扰后的平衡保持方法,并用动力学进行模拟,驱动虚拟人完成平衡恢复.实验结果表明:该算法计算效率高,符合人体的生物力学特性,并且具有良好的交互性与较好的视觉效果,适用于虚拟人动画合成.     

Supervisory control using variable lookahead policies

This paper deals with the efficient on-line calculation of supervisory controls for discrete event systems (DES's) in the framework of limited lookahead control policies (or LLPs) that we introduced in previous papers. In the LLP scheme, the control action after a given trace of events has been executed is calculated on-line on the basis of anN-step ahead projection of the behavior of the DES. To compute these controls, one must calculate after the execution of each event the supremal controllable sublanguage of a finite language with respect to another finite larger language. In our previous work, we showed how the required supremal controllable sublanguage calculation can be performed by using a backward dynamic programming algorithm over the nodes of the tree representation of these two languages. In this paper, we pursue the same approach for the calculation of LLP controls, but instead we adopt a forward calculation procedure over theN-level tree of interest. This forward procedure improves upon previous work by avoiding the explicit consideration of all the nodes of theN-level tree, while still permitting tree-to-tree recursiveness as enabled events are executed by the system. The forward search ends whenever a control decision can be made unambiguously or whenever the boundary of theN-level tree is reached, whichever comes first. This motivates the name Variable Lookahead Policy (or VLP) for this implementation of the LLP supervisory control scheme. This paper presents a general VLP algorithm and studies the properties of several special cases of it. The paper also discusses the implementation of the VLP algorithms and presents computational results regarding the application of these algorithms to a time-varying DES.     

考虑EV充放电意愿的园区综合能源系统双层优化调度

随着电动汽车的普及度越来越高,工业园区的电动汽车用户日益增多,其充放电行为对园区综合能源系统规划和运行带来极大挑战。本文提出了考虑电动汽车充放电意愿的园区综合能源系统双层优化调度。首先基于动态实时电价、电池荷电量、电池损耗补偿、额外参与激励等因素建立充放电意愿模型,在此基础上得到改进的电动汽车充放电模型;然后,以园区综合能源系统总成本最小和电动汽车充电费用最小为目标建立双层优化调度模型,通过KKT条件将内层模型转化为外层模型的约束条件,从而快速稳定的实现单层模型的求解;最后,进行仿真求解,设置3种不同场景,对比了所提模型与一般充放电意愿模型,验证了文中所提引入EV充放电意愿模型的园区综合能源系统双层优化调度的有效性和可行性,具有一定的经济效益。     

A mathematical model for vehicle routing problem under endogenous uncertainty

In this study, a multistage stochastic programming (SP) model is presented for a variant of single-vehicle routing problem with stochastic demands from a dynamic viewpoint. It is assumed that the actual demand of a customer becomes known only when the customer is visited. This problem falls into the category of SP with endogenous uncertainty and hence, the scenario tree is decision-dependent. Therefore, nonanticipativity of decisions is ensured by conditional constraints making up a large portion of total constraints. Thus, a novel approach is proposed that considerably reduces the problem size without any effect on the solution space. Computational results on some test problems are reported.     

Precise identification of moving vehicular parameters based on improved glowworm swarm optimization algorithm

This paper proposes an indirect method for the identification of moving vehicular parameters using the dynamic responses of the vehicle. The moving vehicle is modelled as 2-DOF system with 5 parameters and 4-DOF system with 12 parameters, respectively. Finite element method is used to establish the equation of the coupled bridge–vehicle system. The dynamic responses of the system are calculated by Newmark direct integration method. The parameter identification problem is transformed into an optimization problem by minimizing errors between the calculated dynamic responses of the moving vehicle and those of the simulated measured responses. Glowworm swarm optimization algorithm (GSO) is used to solve the objective function of the optimization problem. A local search method is introduced into the movement phase of GSO to enhance the accuracy and convergence rate of the algorithm. Several test cases are carried out to verify the efficiency of the proposed method and the results show that the vehicular parameters can be identified precisely with the present method and it is not sensitive to artificial measurement noise.     

Approximate dynamic programming solutions with a single network adaptive critic for a class of nonlinear systems

Approximate dynamic programming (ADP) formulation implemented with an adaptive critic (AC)-based neural network (NN) structure has evolved as a powerful technique for solving the Hamilton-Jacobi-Bellman (HJB) equations. As interest in ADP and the AC solutions are escalating with time, there is a dire need to consider possible enabling factors for their implementations. A typical AC structure consists of two interacting NNs, which is computationally expensive. In this paper, a new architecture, called the ‘cost-function-based single network adaptive critic (J-SNAC)’ is presented, which eliminates one of the networks in a typical AC structure. This approach is applicable to a wide class of nonlinear systems in engineering. In order to demonstrate the benefits and the control synthesis with the J-SNAC, two problems have been solved with the AC and the J-SNAC approaches. Results are presented, which show savings of about 50% of the computational costs by J-SNAC while having the same accuracy levels of the dual network structure in solving for optimal control. Furthermore, convergence of the J-SNAC iterations, which reduces to a least-squares problem, is discussed; for linear systems, the iterative process is shown to reduce to solving the familiar algebraic Ricatti equation.     

Stability radius of implicit dynamic equations with constant coefficients on time scales

This paper deals with the stability radii of implicit dynamic equations on time scales when the structured perturbations act on both the coefficient of derivative and the right-hand side. Formulas of the stability radii are derived as a unification and generalization of some previous results. A special case where the real stability radius and the complex stability radius are equal is studied. Examples are derived to illustrate results.     

输入为扇区非线性的不确定系统的鲁棒镇定

讨论一类输入为扇区非线性的不确定系统的渐近镇定问题。在假设系统不确定性满足匹配条件的情况下,基于无源性理论用逻辑切换得到了控制规律,并给出镇定这类系统的一种新的鲁棒控制方法。仿真算例表明该方法具有良好的控制效果。     

Guaranteed Dynamic-System State Estimation by the Method of Bidirectional Dynamic Programming

The problem of guaranteed estimation (smoothing, filtration, prediction) of a dynamic process observed on a finite discrete time interval is solved, based on generalization of the dynamic programming procedure for the case with sequential optmization in direct and inverse time.