In the paper an adapted version of the differential evolution algorithm has been created to solve a multi-objective optimization problem. Multi-objective Differential Evolution Algorithm using vector differences for p...
详细信息
ISBN:
(纸本)9781424476527
In the paper an adapted version of the differential evolution algorithm has been created to solve a multi-objective optimization problem. Multi-objective Differential Evolution Algorithm using vector differences for perturbing the vector population with self adaptation is introduced. Through the combination of mutation strategies and self adaptation of crossover and differentiation constants the proposed MO algorithm performs better than the one with the simple DE scheme in terms of computation speed and quality of the generated multi-objective non-dominated solutions.
We address the motion planning problem in non-holonomic robotic systems with constraints imposed on configuration and control variables. The imbalanced Jacobian motion planning algorithm is compared with the optimal c...
详细信息
We address the motion planning problem in non-holonomic robotic systems with constraints imposed on configuration and control variables. The imbalanced Jacobian motion planning algorithm is compared with the optimal control approach. computer simulations of the unicycle-type mobile robot underlie the comparison.
Summary form only given. Approaches used to solve optimization tasks generated in problems of control, planning, designing and management have completely changed during recent years. Cases with unimodal, convex, diffe...
详细信息
Summary form only given. Approaches used to solve optimization tasks generated in problems of control, planning, designing and management have completely changed during recent years. Cases with unimodal, convex, differentiable scalar goal functions have disappeared from research labs, because a lot of satisfactory efficient methods were developed. On the battle square there have remained hard cases: multimodal, multi-criteria, non-differentiable, NP-hard, discrete, with huge dimensionality. These practical tasks, generated by industry and market, have caused serious troubles in seeking global optimum. Main reasons of these troubles are recognized as: huge cardinality of local extremes frequently with the exponential number of extremes; curse of dimensionality; NP-hardness; lack of differentiability. Unfortunately, known “classical” exact solution methods have considered as rather weak in so hard conditions of the work. From the beginning of eighties have been observed fast development of approximate methods, resistant to local extremes. In fact, practice of these methods antecede development of the suitable theory, which has been formed usually 10-15 years later than the time moment of creating the approach. That's why we observe now more than 20 different approaches inspired by Nature and more than 30 if we include parallel computing environments. The paper presents critical survey of methods, approaches and trends observed in modern optimization, focusing on nature-inspired techniques recommended for particularly hard problems. Applicability of the methods, depending the class of stated optimization task and classes of goal function, have been discussed. Numerical as well theoretical properties of these algorithms are shown. Newest our own very efficient proposals are also provided.
In this paper a method to speed up a convergence of the Newton algorithm of motion planning for manipulators was presented. The method couples one dimensional optimization (with respect to a coefficient influencing th...
详细信息
In this paper a method to speed up a convergence of the Newton algorithm of motion planning for manipulators was presented. The method couples one dimensional optimization (with respect to a coefficient influencing the convergence property of the algorithm) with a virtual goal replacing a real goal of the planning. The first modification of the basic Newton algorithm can be used for any taskspace while the second one works only for low dimensional (not greater than 3) taskspaces. An algorithm based on the method was provided and its efficiency was illustrated on a planar double pendulum manipulator.
The aim of signal decomposition in wavelet bases is to represent a signal as a sequence of wavelet coefficients sets. There is proposed a multistage classification rule using on every stage only one set of the signal ...
详细信息
The aim of signal decomposition in wavelet bases is to represent a signal as a sequence of wavelet coefficients sets. There is proposed a multistage classification rule using on every stage only one set of the signal coefficients. The hierarchical construction of wavelet multiresolution analysis was an inspiration for the multistage classification rule. The algorithm makes an optimal decision for every set of coefficients and its main advantage is a smaller dimension of classification problem on every stage.
This paper addresses a constrained motion planning problem for mobile manipulators. The constraints are included into the system model by means of a sort of penalty function, and then processed in accordance with the ...
详细信息
This paper addresses a constrained motion planning problem for mobile manipulators. The constraints are included into the system model by means of a sort of penalty function, and then processed in accordance with the endogenous configuration space approach. Main novelty of this paper lies in deriving a constrained Jacobian motion planning algorithm with the following features: inequality constraints are included into an extended kinematics model using a smooth approximation of the plus function, the model is then regularized against singularities, and the resulting imbalance in error equations is handled as a perturbation of an exponentially stable linear dynamic system. The operation of the constrained motion planning algorithm is illustrated by a motion planning problem of a mobile manipulator with bounds imposed on a platform variable. Performance of the algorithm is tested by computer simulations.
Background: This paper describes an analysisthat was conducted on newly collected repository with 92 versions of 38 proprietary, open-source and academic projects. A preliminary study perfomed before showed the need f...
详细信息
ISBN:
(纸本)9781450304047
Background: This paper describes an analysisthat was conducted on newly collected repository with 92 versions of 38 proprietary, open-source and academic projects. A preliminary study perfomed before showed the need for a further in-depth analysis in order to identify project clusters. Aims: The goal of this research is to perform clustering on software projects in order to identify groups of software projects with similar characteristic from the defect prediction point of view. One defect prediction model should work well for all projects that belong to such group. The existence of those groups was investigated with statistical tests and by comparing the mean value of prediction efficiency. Method: Hierarchical and k-means clustering, as well as Kohonen's neural network was used to find groups of similar projects. The obtained clusters were investigated with the discriminant analysis. For each of the identified group a statistical analysis has been conducted in order to distinguish whether this group really exists. Two defect prediction models were created for each of the identified groups. The first one was based on the projects that belong to a given group, and the second one - on all the projects. Then, both models were applied to all versions of projects from the investigated group. If the predictions from the model based on projects that belong to the identified group are significantly better than the all-projects model (the mean values were compared and statistical tests were used), we conclude that the group really exists. Results: Six different clusters were identified and the existence of two of them was statistically proven: 1) cluster proprietary B - T=19, p=0.035, r=0.40;2) cluster proprietary/open - t(17)=3.18, p=0.05, r=0.59. The obtained effect sizes (r) represent large effects according to Cohen's benchmark, which is a substantial finding. Conclusions: The two identified clusters were described and compared with results obtained by other researchers
In developing nano-devices and nano-structures, traditional methodologies on MEMS meet the difficulty from the scale restriction. With the strategy of objects assembly, using AFM to handle nano-rods and other nano-obj...
详细信息
The paper presents adaptive neural network based controller of dishwasher. It shows how to prepare input data for training networks and presents the simulation of network performance.
The paper presents adaptive neural network based controller of dishwasher. It shows how to prepare input data for training networks and presents the simulation of network performance.
The paper addresses the problem of non-parametric estimation of the static characteristic in Wiener-Hammerstein (sandwich) system excited and disturbed by random processes. A new, kernel-like method is presented. The ...
详细信息
The paper addresses the problem of non-parametric estimation of the static characteristic in Wiener-Hammerstein (sandwich) system excited and disturbed by random processes. A new, kernel-like method is presented. The proposed estimate is consistent under small amount of a priori information. An IIR dynamics, non-invertible static non-linearity, and non-Gaussian excitations are admitted. The convergence of the estimate is proved for each continuity point of the static characteristic and the asymptotic rate of convergence is analysed. The results of computer simulation example are included to illustrate the behaviour of the estimate for moderate number of observations.
暂无评论