Abstract In this paper, a knowledge-based Artificial Fish-Swarm (AFA) optimization algorithm with crossover, CAFAC, is proposed to enhance the optimization efficiency and combat the blindness of the search of the AFA....
详细信息
Abstract In this paper, a knowledge-based Artificial Fish-Swarm (AFA) optimization algorithm with crossover, CAFAC, is proposed to enhance the optimization efficiency and combat the blindness of the search of the AFA. In our CAFAC, the crossover operator is first explored. The knowledge in the Culture Algorithm (CA) is next utilized to guide the evolution of the AFA. Both the normative knowledge and situational knowledge is used to direct the step size as well as direction of the evolution in the AFA. Ten high-dimensional and multi-peak functions are employed to investigate this new algorithm. Numerical simulation results demonstrate that it can indeed outperform the original AFA.
This paper is concerned with the issue of stability analysis and controller design for the discrete T-S fuzzy control system with time-delay under imperfect premise matching, in which the discrete T-S fuzzy time-delay...
详细信息
In this paper, we investigate ultimate boundedness of large-scale arrays consisting of piecewise affine (PWA) sub-systems linearly interconnected through channels with delays. Under an assumption on subsystem dynamics...
详细信息
ISBN:
(纸本)9781612848006;9781612848013
In this paper, we investigate ultimate boundedness of large-scale arrays consisting of piecewise affine (PWA) sub-systems linearly interconnected through channels with delays. Under an assumption on subsystem dynamics, it is shown that ultimate boundedness can be reduced to the stability of a linear delay differential system. This enables us to use linear multi-agent system theory. As a result, we obtain sufficient conditions for ultimate boundedness taking the robustness of the interconnection topology into account. The usefulness of the results is examined through its application to the FitzHugh-Nagumo model.
This paper proposes a novel independent joint control concept on a 3 DOF flexible link robot subject to deflections caused by gravity. The scheme dampens induced link oscillations in the presence of configuration depe...
详细信息
ISBN:
(纸本)9781457721366
This paper proposes a novel independent joint control concept on a 3 DOF flexible link robot subject to deflections caused by gravity. The scheme dampens induced link oscillations in the presence of configuration dependant plant frequency and damping variations by integrating link strain feedback and impulse based input shaping. The approach is robust and the control does not depend on a dynamic model at runtime. The damping efficiency is evaluated experimentally in terms of strain measurement as well as end-effector position across the entire workspace.
In this paper we propose a novel distributed algorithm to solve degenerate linear programs on asynchronous networks. Namely, we propose a distributed version of the well known simplex algorithm. We prove its convergen...
详细信息
In this paper we propose a novel distributed algorithm to solve degenerate linear programs on asynchronous networks. Namely, we propose a distributed version of the well known simplex algorithm. We prove its convergence to the global lexicographic minimum for possibly fully degenerate problems and provide simulations supporting the conjecture that the completion time scales linearly with the diameter of the graph. The algorithm can be interpreted as a dual version of the constraints consensus algorithm proposed in [1] to solve abstract programs when the last is applied to linear programs. Finally, we study a multi-agent task assignment problem and show that it can be solved by means of our distributed simplex algorithm.
Reducing weight and inertias of conventional robot arms with an elastic structure allows safer interactive cooperation between humans and robots. While the end effector pose of a rigid robot is determined by the forwa...
详细信息
ISBN:
(纸本)9781457721366
Reducing weight and inertias of conventional robot arms with an elastic structure allows safer interactive cooperation between humans and robots. While the end effector pose of a rigid robot is determined by the forward kinematic chain, the pose of elastic arms results from a superposition of the rigid kinematics and the pose dependent deflection caused by gravity. This property complicates the computation of forward and inverse kinematics in particular in case of dynamic loads. This paper presents a machine learning approach to extract various nonlinear regression models of the forward and inverse kinematics of a three degrees of freedom (DOF) flexible-link robot arm with dynamic loads from experimental data. The forward model predicts the target pose, given the joint angles and the strain signals while the inverse kinematic model predicts the joint angles required to assume a target pose. The transformation of the original features onto suitable nonlinear features substantially improves the generalisation ability of the both forward and inverse kinematic model. The closed loop inverse kinematic controller archieves a pose accuracy of 3 mm and the results show that the learned model can solve the inverse kinematics problem of flexible robot arms with sufficient accuracy even with unknown payloads.
In this paper we propose a distributed algorithm for solving linear programs with combinations of local and global constraints in a multi-agent setup. A fully distributed and asynchronous algorithm is proposed. The co...
详细信息
ISBN:
(纸本)9781612848006
In this paper we propose a distributed algorithm for solving linear programs with combinations of local and global constraints in a multi-agent setup. A fully distributed and asynchronous algorithm is proposed. The computation of the local decision makers involves the solution of two distinct (local) optimization problems, namely a local copy of a global linear program and a smaller problem used to generate "problem columns". We show that, when running the proposed algorithm, all decision makers agree on a common optimal solution, even if the original problem has several optimal solutions, or detect unboundedness and infeasibility if necessary.
Abstract In this note, we study the problem of multiple hard output constraints imposed on a continuous stirred tank reactor (CSTR) subject to external disturbances. Constraints on the concentration and on the tempera...
详细信息
Abstract In this note, we study the problem of multiple hard output constraints imposed on a continuous stirred tank reactor (CSTR) subject to external disturbances. Constraints on the concentration and on the temperature are considered. We show, analytically and with simulations, that there are critical combinations of constraints, where robust constraint satisfaction cannot be guaranteed. As a consequence violation of at least one constraint has to be allowed.
Future driver assistance systems need to be more robust and reliable because these systems will react to increasingly complex situations. This requires increased performance in environment perception sensors and algor...
详细信息
Future driver assistance systems need to be more robust and reliable because these systems will react to increasingly complex situations. This requires increased performance in environment perception sensors and algorithms for detecting other relevant traffic participants and obstacles. An object's existence probability has proven to be a useful measure for determining the quality of an object. This paper presents a novel method for the fusion of the existence probability based on Dempster-Shafer evidence theory in the framework of a highlevel sensor data fusion architecture. The proposed method is able to take into consideration sensor reliability in the fusion process. The existence probability fusion algorithm is evaluated for redundant and partially overlapping sensor configurations.
The BP network has the disadvantages such as low learning efficiency, low speed of convergence, easily falling into the local minimum state, poor ability to adapt, ect. For PSO algorithm, it is fast for convergence, e...
详细信息
The BP network has the disadvantages such as low learning efficiency, low speed of convergence, easily falling into the local minimum state, poor ability to adapt, ect. For PSO algorithm, it is fast for convergence, especially at the initial stage, simple for the computing, and is easy to implement. Compared with the genetic algorithms, it does have not the complex operations of hybrid codecs, mutation, so it is a good optimization algorithm. However, PSO algorithm also has some shortcomings it is more and more slow for convergence rate at the late evolution of the algorithm. In this paper, a new BP Neural Network based on improved Particle Swarm Optimization (PSO) is proposed. The convergence speed of this algorithm and the capacity of searching global extremum is increased through adjusting the adaptive capacity of learning factor. The simulation results illustrate that the improved PSO is superior to the standard BP algorithm and particle swarm optimization.
暂无评论