For the rapid calibration of multi-line structured light system,a method based on Plücker line was proposed.Most of the conventional line-structured light calibration methods extract the feature points and transf...For the rapid calibration of multi-line structured light system,a method based on Plücker line was proposed.Most of the conventional line-structured light calibration methods extract the feature points and transform the coordinates of points to obtain the plane equation.However,a large number of points lead to complicated operation which is not suitable for the application scenarios of multi-line structured light.To solve this issue,a new calibration method was proposed that applied the form of Plücker matrix throughout the whole calibration process,instead of using the point characteristics directly.The advantage of this method is that the light plane equation can be obtained quickly and accurately in the camera coordinate frame.Correspondingly a planar target particularly for calibrating multi-line structured light was also designed.The regular lines were transformed into Plücker lines by extending the two-dimensional image plane and defining a new image space.To transform the coordinate frame of Plücker lines,the perspective projection mathematical model was re-expressed based on the Plücker matrix.According to the properties of the line and plane in the Plücker space,a linear matrix equation was efficiently constructed by combining the Plücker matrices of several coplanar lines so that the line-structured light plane equation could be furtherly solved.The experiments performed validate the proposed method and demonstrate the significant improvement in the calibration accuracy,when the test distance is 1.8 m,the root mean square(RMS)error of the three-dimensional point is within 0.08 mm.展开更多
After an introductiou of the Plucker coordinate geometry, a discussion is made of the expression of screws in Plucker coordiuates and the addition of screws’ As a result, the geometry or geuerating gears is re-studie...After an introductiou of the Plucker coordinate geometry, a discussion is made of the expression of screws in Plucker coordiuates and the addition of screws’ As a result, the geometry or geuerating gears is re-studied and a formula is derived for calculating the axode leugth or hypoid gears’展开更多
经典的基于点状特征匹配的地面激光雷达（light detection and ranging,LiDAR）点云配准算法实现过程中,点状特征的提取精度对算法运行结果的影响通常较大;基于迭代运算的LiDAR点云配准算法计算量大,对未知参数的初值依赖程度较高,在求...经典的基于点状特征匹配的地面激光雷达（light detection and ranging,LiDAR）点云配准算法实现过程中,点状特征的提取精度对算法运行结果的影响通常较大;基于迭代运算的LiDAR点云配准算法计算量大,对未知参数的初值依赖程度较高,在求解大转角刚体变换参数时算法不稳定。对此,提出了一种线状特征约束下基于Plücker直线坐标描述的LiDAR点云配准算法。立足于经典的向量代数与对偶四元数的相关理论与方法,分析并确定了Plücker直线坐标与对偶四元数之间的相互转换关系以及模型描述方法;以LiDAR点云配准前后同名线状特征的Plücker直线坐标相等为约束条件,构建了线状特征约束下基于Plücker直线坐标描述的刚体变换模型;立足于最小二乘基本准则,通过目标函数的极值化分析实现了线状特征约束下地面LiDAR点云配准参数的直接求解。实验结果表明,所构建的基于Plücker直线坐标描述的地面LiDAR点云配准模型,无需事先确定变换参数的初值,避免了多元函数的线性化过程,解除了参数结果对于迭代初值的依赖,理论上克服了迭代法在求解大转角相似变换参数时的算法不稳定问题。此外,较之单纯基于点状特征匹配的LiDAR点云配准算法,该算法可以有效地增强LiDAR点云配准过程的约束,达到提高配准质量的目的。展开更多
By mapping the homogeneous coordinates of two points in space to the Plücker coordinates of the line they determine, any transformation of type SL(4) upon points in space is mapped to a transformation of type SO0...By mapping the homogeneous coordinates of two points in space to the Plücker coordinates of the line they determine, any transformation of type SL(4) upon points in space is mapped to a transformation of type SO0(3, 3), the latter being the connected component containing the identity of the special orthogonal transformation group of the linear space spanned by Plücker coordinates. This is the classical Plücker correspondence, two-to-one and onto. It has important applications in line geometry and projective transformations.While the explicit form of Plücker correspondence is trivial to present, its inverse in explicit form, which is also important in application, is not found in the literature. In this paper, we present a simple and unified formula for the inverse of the Plücker correspondence.展开更多
In solving many-objective optimization problems(MaO Ps),existing nondominated sorting-based multi-objective evolutionary algorithms suffer from the fast loss of selection pressure.Most candidate solutions become nondo...In solving many-objective optimization problems(MaO Ps),existing nondominated sorting-based multi-objective evolutionary algorithms suffer from the fast loss of selection pressure.Most candidate solutions become nondominated during the evolutionary process,thus leading to the failure of producing offspring toward Pareto-optimal front with diversity.Can we find a more effective way to select nondominated solutions and resolve this issue?To answer this critical question,this work proposes to evolve solutions through line complex rather than solution points in Euclidean space.First,Plücker coordinates are used to project solution points to line complex composed of position vectors and momentum ones.Besides position vectors of the solution points,momentum vectors are used to extend the comparability of nondominated solutions and enhance selection pressure.Then,a new distance function designed for high-dimensional space is proposed to replace Euclidean distance as a more effective distancebased estimator.Based on them,a novel many-objective evolutionary algorithm(MaOEA)is proposed by integrating a line complex-based environmental selection strategy into the NSGAⅢframework.The proposed algorithm is compared with the state of the art on widely used benchmark problems with up to 15 objectives.Experimental results demonstrate its superior competitiveness in solving MaOPs.展开更多
According to the theory that rotation transformation from the basecoordinate to an arbitrary one can be described by a single equivalent rotation about agiven rotational axis,it is proposed that the orientation of rob...According to the theory that rotation transformation from the basecoordinate to an arbitrary one can be described by a single equivalent rotation about agiven rotational axis,it is proposed that the orientation of robot can be described by usingthe vector of equivalent angular displacement.And the concept of pose motor and itsPlücker linear coordinate are established and used to describe the position and orientationof robot.Based on the fact that there is a one-to-one correspondence between the ori-ented straight lines in three-dimensional dual space,the interpolation plannings corre-sponding to the pose motors are developed in dual space.A new algorithm of robot CPmotion trajectory planning is presented.The correctness of the theory and derivation isconformed by an example.展开更多
We propose a number of new mathematical tools for the study of the DNA structure. In particular, we establish a connection between the DNA molecule and the Grassmann-Plücker coordinates, which, in both in mathema...We propose a number of new mathematical tools for the study of the DNA structure. In particular, we establish a connection between the DNA molecule and the Grassmann-Plücker coordinates, which, in both in mathematics and physics, are of great importance.展开更多
The (2 + 1)-dimensional Korteweg de Vries (KdV) equation, which was first derived by Boiti et al., has been studied by various distinct methods. It is known that this (2 + 1)-dimensional KdV equation has rich solution...The (2 + 1)-dimensional Korteweg de Vries (KdV) equation, which was first derived by Boiti et al., has been studied by various distinct methods. It is known that this (2 + 1)-dimensional KdV equation has rich solutions, such as multi-soliton solutions and dromion solutions. In the present article, a unified representation of its N-soliton solution is given by means of pfaffian. We’ll show that this (2 + 1)-dimensional KdV equation is nothing but the Plücker identity when its τ-function is given by pfaffian.展开更多
基金National Natural Science Foundation of China(No.51575388)。
文摘For the rapid calibration of multi-line structured light system,a method based on Plücker line was proposed.Most of the conventional line-structured light calibration methods extract the feature points and transform the coordinates of points to obtain the plane equation.However,a large number of points lead to complicated operation which is not suitable for the application scenarios of multi-line structured light.To solve this issue,a new calibration method was proposed that applied the form of Plücker matrix throughout the whole calibration process,instead of using the point characteristics directly.The advantage of this method is that the light plane equation can be obtained quickly and accurately in the camera coordinate frame.Correspondingly a planar target particularly for calibrating multi-line structured light was also designed.The regular lines were transformed into Plücker lines by extending the two-dimensional image plane and defining a new image space.To transform the coordinate frame of Plücker lines,the perspective projection mathematical model was re-expressed based on the Plücker matrix.According to the properties of the line and plane in the Plücker space,a linear matrix equation was efficiently constructed by combining the Plücker matrices of several coplanar lines so that the line-structured light plane equation could be furtherly solved.The experiments performed validate the proposed method and demonstrate the significant improvement in the calibration accuracy,when the test distance is 1.8 m,the root mean square(RMS)error of the three-dimensional point is within 0.08 mm.
文摘After an introductiou of the Plucker coordinate geometry, a discussion is made of the expression of screws in Plucker coordiuates and the addition of screws’ As a result, the geometry or geuerating gears is re-studied and a formula is derived for calculating the axode leugth or hypoid gears’
文摘经典的基于点状特征匹配的地面激光雷达（light detection and ranging,LiDAR）点云配准算法实现过程中,点状特征的提取精度对算法运行结果的影响通常较大;基于迭代运算的LiDAR点云配准算法计算量大,对未知参数的初值依赖程度较高,在求解大转角刚体变换参数时算法不稳定。对此,提出了一种线状特征约束下基于Plücker直线坐标描述的LiDAR点云配准算法。立足于经典的向量代数与对偶四元数的相关理论与方法,分析并确定了Plücker直线坐标与对偶四元数之间的相互转换关系以及模型描述方法;以LiDAR点云配准前后同名线状特征的Plücker直线坐标相等为约束条件,构建了线状特征约束下基于Plücker直线坐标描述的刚体变换模型;立足于最小二乘基本准则,通过目标函数的极值化分析实现了线状特征约束下地面LiDAR点云配准参数的直接求解。实验结果表明,所构建的基于Plücker直线坐标描述的地面LiDAR点云配准模型,无需事先确定变换参数的初值,避免了多元函数的线性化过程,解除了参数结果对于迭代初值的依赖,理论上克服了迭代法在求解大转角相似变换参数时的算法不稳定问题。此外,较之单纯基于点状特征匹配的LiDAR点云配准算法,该算法可以有效地增强LiDAR点云配准过程的约束,达到提高配准质量的目的。
基金supported by National Natural Science Foundation of China(Grant No.11671388)the CAS Frontier Key Project(Grant No.QYZDJ-SSW-SYS022)
文摘By mapping the homogeneous coordinates of two points in space to the Plücker coordinates of the line they determine, any transformation of type SL(4) upon points in space is mapped to a transformation of type SO0(3, 3), the latter being the connected component containing the identity of the special orthogonal transformation group of the linear space spanned by Plücker coordinates. This is the classical Plücker correspondence, two-to-one and onto. It has important applications in line geometry and projective transformations.While the explicit form of Plücker correspondence is trivial to present, its inverse in explicit form, which is also important in application, is not found in the literature. In this paper, we present a simple and unified formula for the inverse of the Plücker correspondence.
基金supported in part by the National Natural Science Foundation of China(51775385)the Natural Science Foundation of Shanghai(23ZR1466000)+3 种基金the Shanghai Industrial Collaborative Science and Technology Innovation Project(2021-cyxt2-kj10)the Innovation Program of Shanghai Municipal Education Commission(202101070007E00098)the Innovation Project of Engineering Research Center of Integration and Application of Digital Learning Technology of MOE(1221046)the Program to Cultivate Middle-Aged and Young Cadre Teacher of Jiangsu Province。
文摘In solving many-objective optimization problems(MaO Ps),existing nondominated sorting-based multi-objective evolutionary algorithms suffer from the fast loss of selection pressure.Most candidate solutions become nondominated during the evolutionary process,thus leading to the failure of producing offspring toward Pareto-optimal front with diversity.Can we find a more effective way to select nondominated solutions and resolve this issue?To answer this critical question,this work proposes to evolve solutions through line complex rather than solution points in Euclidean space.First,Plücker coordinates are used to project solution points to line complex composed of position vectors and momentum ones.Besides position vectors of the solution points,momentum vectors are used to extend the comparability of nondominated solutions and enhance selection pressure.Then,a new distance function designed for high-dimensional space is proposed to replace Euclidean distance as a more effective distancebased estimator.Based on them,a novel many-objective evolutionary algorithm(MaOEA)is proposed by integrating a line complex-based environmental selection strategy into the NSGAⅢframework.The proposed algorithm is compared with the state of the art on widely used benchmark problems with up to 15 objectives.Experimental results demonstrate its superior competitiveness in solving MaOPs.
文摘According to the theory that rotation transformation from the basecoordinate to an arbitrary one can be described by a single equivalent rotation about agiven rotational axis,it is proposed that the orientation of robot can be described by usingthe vector of equivalent angular displacement.And the concept of pose motor and itsPlücker linear coordinate are established and used to describe the position and orientationof robot.Based on the fact that there is a one-to-one correspondence between the ori-ented straight lines in three-dimensional dual space,the interpolation plannings corre-sponding to the pose motors are developed in dual space.A new algorithm of robot CPmotion trajectory planning is presented.The correctness of the theory and derivation isconformed by an example.
文摘We propose a number of new mathematical tools for the study of the DNA structure. In particular, we establish a connection between the DNA molecule and the Grassmann-Plücker coordinates, which, in both in mathematics and physics, are of great importance.
文摘The (2 + 1)-dimensional Korteweg de Vries (KdV) equation, which was first derived by Boiti et al., has been studied by various distinct methods. It is known that this (2 + 1)-dimensional KdV equation has rich solutions, such as multi-soliton solutions and dromion solutions. In the present article, a unified representation of its N-soliton solution is given by means of pfaffian. We’ll show that this (2 + 1)-dimensional KdV equation is nothing but the Plücker identity when its τ-function is given by pfaffian.
