In this paper, we present an improved analytic method to the optimal trajectory generation of an autonomous underwater vehicle (AUV) in a dynamic environment. The proposed approach explicitly incorporates both the AUV...
详细信息
One of the important requirements for operational planning of electrical utilities is the prediction of hourly load up to several days, known as short term load forecasting (STLF). Considering the effect of its accura...
详细信息
One of the important requirements for operational planning of electrical utilities is the prediction of hourly load up to several days, known as short term load forecasting (STLF). Considering the effect of its accuracy on system security and also economical aspects, there is an on-going attention toward putting new approaches to the task. Recently, neuro fuzzy modeling has played a successful role in various applications over nonlinear time series prediction. This paper presents a neuro-fuzzy model for the application of short-term load forecasting. This model is identified through locally liner model tree (LoLiMoT) learning algorithm. The model is compared to a multilayer perceptron and Kohonen classification and intervention analysis. The models are trained and assessed on load data extracted from EUNITE network competition.
Numerical P systems(for short, NP systems) are distributed and parallel computing models inspired from the structure of living cells and economics. Enzymatic numerical P systems(for short, ENP systems) are a variant o...
详细信息
Numerical P systems(for short, NP systems) are distributed and parallel computing models inspired from the structure of living cells and economics. Enzymatic numerical P systems(for short, ENP systems) are a variant of NP systems, which have been successfully applied in designing and implementing controllers for mobile robots. Since ENP systems were proved to be Turing universal, there has been much work to simplify the universal systems, where the complexity parameters considered are the number of membranes, the degrees of polynomial production functions or the number of variables used in the *** the number of enzymatic variables, which is essential for ENP systems to reach universality, has not been investigated. Here we consider the problem of searching for the smallest number of enzymatic variables needed for universal ENP systems. We prove that for ENP systems as number acceptors working in the all-parallel or one-parallel mode, one enzymatic variable is sufficient to reach universality; while for the one-parallel ENP systems as number generators, two enzymatic variables are sufficient to reach *** results improve the best known results that the numbers of enzymatic variables are 13 and 52 for the all-parallel and one-parallel systems, respectively.
A commonly used assumption in evolutionary game theory is that natural selection acts on individuals in the same time scale; e.g., players use the same frequency to update their strategies. Variation in learning rates...
详细信息
A commonly used assumption in evolutionary game theory is that natural selection acts on individuals in the same time scale; e.g., players use the same frequency to update their strategies. Variation in learning rates within populations suggests that evolutionary game theory may not necessarily be restricted to uniform time scales associated with the game interaction and strategy adaption evolution. In this study, we remove this restricting assumption by dividing the population into fast and slow groups according to the players' strategy updating frequencies and investigate how different strategy compositions of one group influence the evolutionary outcome of the other's fixation probabilities of strategies within its own group. Analytical analysis and numerical calculations are performed to study the evolutionary dynamics of strategies in typical classes of two-player games (prisoner's dilemma game, snowdrift game, and stag-hunt game). The introduction of the heterogeneity in strategy-update time scales leads to substantial changes in the evolution dynamics of strategies. We provide an approximation formula for the fixation probability of mutant types in finite populations and study the outcome of strategy evolution under the weak selection. We find that although heterogeneity in time scales makes the collective evolutionary dynamics more complicated, the possible long-run evolutionary outcome can be effectively predicted under technical assumptions when knowing the population composition and payoff parameters.
The hybrid minimum principle (HMP) gives necessary conditions to be satisfied for optimal solutions of a hybrid dynamical system. In particular, the HMP accounts for autonomous switching between discrete states that o...
详细信息
ISBN:
(纸本)9781424477456
The hybrid minimum principle (HMP) gives necessary conditions to be satisfied for optimal solutions of a hybrid dynamical system. In particular, the HMP accounts for autonomous switching between discrete states that occurs whenever the trajectory hits switching manifolds. In this paper, the existing HMP is extended for hybrid systems with partitioned state space to provide necessary conditions for optimal trajectories that pass through an intersection of switching manifolds. This extension is especially useful for the numerical solution of hybrid optimal control problems as it allows for algorithms with significant reduction of computational complexity. Algorithms based on previous versions of the HMP solve separate optimal control problems for each possible sequence of discrete states. The extension enables us to consider the optimal sequence as subject of optimal control that is varied and finally determined during a single optimization run. A first numerical result illustrates the effectiveness of an algorithm based on the extended HMP.
In this paper, we consider input-affine invertible MIMO nonlinear systems which can be transformed into a special normal form by means of the structure algorithm. The normal form highlights a partial state, a subset o...
详细信息
In this paper, we consider input-affine invertible MIMO nonlinear systems which can be transformed into a special normal form by means of the structure algorithm. The normal form highlights a partial state, a subset of state variables, which plays in this setting a role similar to that of the outputs and its derivatives in a SISO system. It is shown that, if a system in this class can be asymptotically stabilized by means of a static feedback from that partial state, then semiglobal stabilization can be achieved via dynamic feedback driven by the output of the system. The dynamic feedback in question is based a (non–trivial) extension to MIMO systems of the standard high–gain observer.
This paper investigates generation undulatory locomotion of Caenorhabditis elegans (C. elegans) in a crawling robot via biomimetic learning. Firstly, the anatomy and the morphology of C. elegans are explored. Then, th...
详细信息
ISBN:
(纸本)9781509017393
This paper investigates generation undulatory locomotion of Caenorhabditis elegans (C. elegans) in a crawling robot via biomimetic learning. Firstly, the anatomy and the morphology of C. elegans are explored. Then, the locomotion of C. elegans is analyzed from cellular level by using dynamic neuron networks (DNNs) and center pattern generations (CPGs). Based on these biological analyses, a biomimetic crawling robot is developed and a digital approximation method is adopted for the robot mimicking the locomotion of C. elegans. Finally, experimental results verify the effectiveness of the robotic system and the motion generation approach.
An algorithm for hybrid optimal control is proposed that varies the discrete state sequence based on gradient information during the search for an optimal trajectory. The algorithm is developed for hybrid systems with...
详细信息
ISBN:
(纸本)9781424477456
An algorithm for hybrid optimal control is proposed that varies the discrete state sequence based on gradient information during the search for an optimal trajectory. The algorithm is developed for hybrid systems with partitioned state space. It uses a version of the hybrid minimum principle that allows optimal trajectories to pass through intersections of switching manifolds, which enables the algorithm to vary the sequence. Consequently, the combinatorial complexity of former algorithms can be avoided, since not each possible sequence has to be investigated separately anymore. The convergence of the algorithm is proven and a numerical example demonstrates the efficiency of the algorithm.
Static task scheduling in distributed computing systems is a very complex problem and known to be NP-hard. This problem is even harder when the module execution times become probabilistic. In this paper we study the e...
详细信息
Static task scheduling in distributed computing systems is a very complex problem and known to be NP-hard. This problem is even harder when the module execution times become probabilistic. In this paper we study the effect of probabilistic module execution times on the performance of task-scheduling algorithms. We show that in static task scheduling, for probabilistic module execution times, and in the existence of some factors there is no need to use an expensive task-scheduling algorithm. Given any two static task-scheduling algorithms that use deterministic module execution times in assigning task modules to the distributed system, the performance of these two algorithms will not remain the same when these module execution times become probabilistic rather than deterministic. We also study the effects of some factors an our results.
暂无评论