Inverse kinematics (IK) is the problem of finding robot joint configurations that satisfy constraints on position or pose one more end-effectors. For robots with redundant degrees freedom, there often an infinite, nonconvex set solutions. The IK further complicated when collision avoidance are imposed by obstacles in workspace. In general, closed-form expressions yielding feasible do not exist,...

A strongly connected digraph is called a cactoid-type if each of its blocks consisting finitely many oriented cycles sharing common directed path. In this article, we find...

Abstract We study the concept of continuous mean distance a weighted graph. For connected unweighted graphs, can be defined as arithmetic distances between all pairs vertices. This parameter provides natural measure compactness graph, and has been intensively studied, together with several variants, including its version for graphs. The analog (discrete) is points on edges Despite being very ge...

Compared with the complex fuzzy set (CFS) and intuitionistic (IFS), (CIFS) can handle two-dimensional uncertain information simultaneously, thus strengthen capability of capturing useful information. In this paper, we consider situation environment, where importance certain is also taken into consideration. To deal these situations, develop ordered weighted distance (CIFOWD) measure investigate...