Application of the general elimination method in robot kinematics

A general method for solving the robot inverse kinematics problem is presented. The method is based upon the general elimination method to obtain the equivalent system of equations which are triangularized and the solutions of the inverse kinematics problem can be solved by backsubstitutions.     

CATIA V5环境下基于产品数模的三坐标测量机测点自动采样

为了实现CAD与CAIP(计算机辅助测量规划)的集成,提出了一种基于产品三维模型的CMM(三坐标测量机)测量点采样方法。该方法从产品的IGES文件中有效识别型面形状与边界定义,采用均匀采样与依曲率变化二次采样相结合的策略,针对各个型面类型制定专门的信息处理机制,实现测量点的自动采样,并通过转换在参数平面中判断采样点与裁剪区域的隶属关系,以有效剔除无效采样点;通过典型飞机部件外形曲面的采样点生成结果表明,该方法能有效应用于飞机的测量规划中。     

Frenet坐标框架下的自适应避障算法

目的 解决包装车间无人运输车辆在沿全局路径行驶过程中,难以同时保证跟随轨迹平滑及规避障碍物的问题。方法 构建Frenet坐标框架,描述车辆位姿与全局路径的相对关系,利用五次多项式生成多条待选局部路径;采用障碍物势场法模糊处理包装车间障碍的外形轮廓,并设置膨胀区间;结合待选路径采样点经过障碍物膨胀区间得到的碰撞值,以及采样点与全局规划路径的偏差值,综合评估路径的避障能力,筛选出最优的避障路径。结果 该算法能根据障碍物的大小,动态解算出与全局路径偏移量小且运动连贯的局部避障路径。结论 所提算法使得车辆完成运输任务时的效果更好,且效率更高。     

Generalized linear complementarity in a problem ofn-person games

In this paper, we introduce a generalization of the polymatrix game (a nonzero sum noncooperativen-person game) considered by Howson and relate the problem of computing an equilibrium set of strategies for such a game to the generalized linear complementarity problem of Cottle and Dantzig. For an even more general version of the game we prove the existence of an-equilibrium set of strategies. We also present a result on the stability of the equilibria based on degree theory.     

Some improved results on communication between information systems

To study the communication between information systems, Wang et al. [C. Wang, C. Wu, D. Chen, Q. Hu, C. Wu, Communicating between information systems, Information Sciences 178 (2008) 3228-3239] proposed two concepts of type-1 and type-2 consistent functions. Some properties of such functions and induced relation mappings have been investigated there. In this paper, we provide an improvement of the aforementioned work by disclosing the symmetric relationship between type-1 and type-2 consistent functions. We present more properties of consistent functions and induced relation mappings and improve upon several deficient assertions in the original work. In particular, we unify and extend type-1 and type-2 consistent functions into the so-called neighborhood-consistent functions. This provides a convenient means for studying the communication between information systems based on various neighborhoods.     

A class of aggregation functions encompassing two-dimensional OWA operators

In this paper we prove that, under suitable conditions, Atanassov’s K_α operators, which act on intervals, provide the same numerical results as OWA operators of dimension two. On one hand, this allows us to recover OWA operators from K_α operators. On the other hand, by analyzing the properties of Atanassov’s operators, we can generalize them. In this way, we introduce a class of aggregation functions - the generalized Atanassov operators - that, in particular, include two-dimensional OWA operators. We investigate under which conditions these generalized Atanassov operators satisfy some properties usually required for aggregation functions, such as bisymmetry, strictness, monotonicity, etc. We also show that if we apply these aggregation functions to interval-valued fuzzy sets, we obtain an ordered family of fuzzy sets.     

A constrained optimization approach for an adaptive generalized subspace tracking algorithm

In this paper, we present an orthonormal version of the generalized signal subspace tracking. It is based on an interpretation of the generalized signal subspace as the solution of a constrained minimization task. This algorithm, referred to as the CGST algorithm, guarantees the C_x-orthonormality of the estimated generalized signal subspace basis at each iteration which C_x denotes the correlation matrix of the sequence x(t). An efficient implementation of the proposed algorithm enhances applicability of it in real time applications.     

Unified computational methods for regression analysis of zero-inflated and bound-inflated data

Bounded data with excess observations at the boundary are common in many areas of application. Various individual cases of inflated mixture models have been studied in the literature for bound-inflated data, yet the computational methods have been developed separately for each type of model. In this article we use a common framework for computing these models, and expand the range of models for both discrete and semi-continuous data with point inflation at the lower boundary. The quasi-Newton and EM algorithms are adapted and compared for estimation of model parameters. The numerical Hessian and generalized Louis method are investigated as means for computing standard errors after optimization. Correlated data are included in this framework via generalized estimating equations. The estimation of parameters and effectiveness of standard errors are demonstrated through simulation and in the analysis of data from an ultrasound bioeffect study. The unified approach enables reliable computation for a wide class of inflated mixture models and comparison of competing models.     

Inference for Weibull distribution under generalized order statistics

Based on generalized order statistics from Weibull distribution the approach of Bayesian and non-Bayesian estimation are discussed. We present a simple and efficient simulational algorithm for generating a generalized order statistics sample from any continuous distribution. Specializations to Bayesian and non-Bayesian estimators, some lifetime parameters and confidence intervals of progressive II censoring and record values are obtained and compared with the existing results. Two examples are given to illustrate the proposed estimators and the simulation algorithm.     

Optimization of optical lens-controlled scanning electron microscopic resolution using generalized regression neural network and genetic algorithm

A scanning electron microscope (SEM) is a sophisticated equipment employed for fine imaging of a variety of surfaces. In this study, prediction models of SEM were constructed by using a generalized regression neural network (GRNN) and genetic algorithm (GA). The SEM components examined include condenser lens 1 and 2 and objective lens (coarse and fine) referred to as CL1, CL2, OL-Coarse, and OL-Fine. For a systematic modeling of SEM resolution (R), a face-centered Box–Wilson experiment was conducted. Two sets of data were collected with or without the adjustment of magnification. Root-mean-squared prediction error of optimized GRNN models are GA 0.481 and 1.96×10^-12 for non-adjusted and adjusted data, respectively. The optimized models demonstrated a much improved prediction over statistical regression models. The optimized models were used to optimize parameters particularly under best tuned SEM environment. For the variations in CL2 and OL-Coarse, the highest R could be achieved at all conditions except a larger CL2 either at smaller or larger OL-Coarse. For the variations in CL1 and CL2, the highest R was obtained at all conditions but larger CL2 and smaller CL1.