Exponential Stability of Large-Scale Non-Linear Systems with Multiple The Delays

The problem of stabilizing a class of large-scale non-linear multiple delay systems is considered.The complicated system is decomposed into several subsystems; each function of them is expressed by a set of components of the overall state vector,with interconnections between them, and the subsystems are coupled by the delayed state. In this paper, a method is devised to be a suitable choice of state feedback controls of every subsystems, moreover, it is proved that the large-scale system is exponential stable.

Multi-objective planning model for simultaneous reconfiguration of power distribution network and allocation of renewable energy resources and capacitors with considering uncertainties

This research develops a comprehensive method to solve a combinatorial problem consisting of distribution system reconfiguration, capacitor allocation, and renewable energy resources sizing and siting simultaneously and to improve power system's accountability and system performance parameters. Due to finding solution which is closer to realistic characteristics, load forecasting, market price errors and the uncertainties related to the variable output power of wind based DG units are put in consideration. This work employs NSGA-II accompanied by the fuzzy set theory to solve the aforementioned multi-objective problem. The proposed scheme finally leads to a solution with a minimum voltage deviation, a maximum voltage stability, lower amount of pollutant and lower cost. The cost includes the installation costs of new equipment, reconfiguration costs, power loss cost, reliability cost, cost of energy purchased from power market, upgrade costs of lines and operation and maintenance costs of DGs. Therefore, the proposed methodology improves power quality, reliability and security in lower costs besides its preserve, with the operational indices of power distribution networks in acceptable level. To validate the proposed methodology's usefulness, it was applied on the IEEE 33-bus distribution system then the outcomes were compared with initial configuration.

A new hybrid algorithm for global optimization and slope stability evaluation

A new hybrid optimization algorithm was presented by integrating the gravitational search algorithm （GSA） with the sequential quadratic programming （SQP）, namely GSA-SQP, for solving global optimization problems and minimization of factor of safety in slope stability analysis. The new algorithm combines the global exploration ability of the GSA to converge rapidly to a near optimum solution. In addition, it uses the accurate local exploitation ability of the SQP to accelerate the search process and find an accurate solution. A set of five well-known benchmark optimization problems was used to validate the performance of the GSA-SQP as a global optimization algorithm and facilitate comparison with the classical GSA. In addition, the effectiveness of the proposed method for slope stability analysis was investigated using three ease studies of slope stability problems from the literature. The factor of safety of earth slopes was evaluated using the Morgenstern-Price method. The numerical experiments demonstrate that the hybrid algorithm converges faster to a significantly more accurate final solution for a variety of benchmark test functions and slope stability problems.

Coordinated dynamic mission planning scheme for intelligent multi-agent systems

Mission planning was thoroughly studied in the areas of multiple intelligent agent systems,such as multiple unmanned air vehicles,and multiple processor systems.However,it still faces challenges due to the system complexity,the execution order constraints,and the dynamic environment uncertainty.To address it,a coordinated dynamic mission planning scheme is proposed utilizing the method of the weighted AND/OR tree and the AOE-Network.In the scheme,the mission is decomposed into a time-constraint weighted AND/OR tree,which is converted into an AOE-Network for mission planning.Then,a dynamic planning algorithm is designed which uses task subcontracting and dynamic re-decomposition to coordinate conflicts.The scheme can reduce the task complexity and its execution time by implementing real-time dynamic re-planning.The simulation proves the effectiveness of this approach.

『とはずがたり』の敬语研究——谦让语を中心に

本稿では敬语研究がまだ十分とは言えない、中世鎌仓期の资料の“とはずがたり”に用いられている谦让语にっいて考察した。分析にあたって、各谦让语动词の意味的な区分によって、1）言语行动2）往来3）存在4）授受5）奉仕関係にわけて、使用の状况、ぉよびその待遇性にっいて调べた。その结果、各谦让语が从来の用法を继承しながらも、次のよな中世の新たな用法が生じたことが认められた。1）“言ウ”の谦让语であゐ。また、地の文にぉいて作者が不特定多数の読者に対すゐ文章の美的效果を表すための“文体的用法”として用いゐ“申す”が頻出すゐ。きらに、“辞退申す”のような中古には见られない新たな中世的形式も现われた。2）“参ゐ”が“サシアゲル”という意味と“饮食スル”の尊敬语として使われていて、その用法が多样であゐ。3）地の文において“侍り”は、“申す”と同样に、中世敬语の特質とも言えゐ文体的用法として多用されていゐ用例があゐ。5）“スル”の谦让语で“致す”が1回出ていゐが、敬语としてのその机能をまだ完全には确立していない。

A New Method of Transmission Network Flexible Planning Using the Connection Number

Because connection number can express and process synthetic uncertainties caused by various uncertainties in the transmission network planning, a connection number model (CNM) was presented to compare the values of connection number logically. This paper proposed a novel model for transmission network flexible planning with uncertainty. In the proposed planning model both certainty and uncertainty information were included, and the cost-benefit analysis method was used to evaluate the candidate schemes in the objective function. Its good adaptability and flexibility were illustrated through two examples.

Numerical Solution to Optimal Feedback Control by Dynamic Programming Approach:A Local Approximation Algorithm

This paper considers optimal feedback control for a general continuous time finite-dimensional deterministic system with finite horizon cost functional. A practically feasible algorithm to calculate the numerical solution of the optimal feedback control by dynamic programming approach is developed. The highlights of this algorithm are: a) It is based on a convergent constructive algorithm for optimal feedback control law which was proposed by the authors before through an approximation for the viscosity solution of the time-space discretization scheme developed by dynamic programming method; b) The computation complexity is significantly reduced since only values of viscosity solution on some local cones around the optimal trajectory are calculated. Two numerical experiments are presented to illustrate the effectiveness and fastness of the algorithm.