Scanning Path Planning in Laser Bending of Tube Based on Curvature

2011 ◽  
Vol 264-265 ◽  
pp. 6-11
Author(s):  
Xu Yue Wang ◽  
Jun Wang ◽  
L.J. Wang ◽  
W.J. Xu ◽  
D.M. Guo
Keyword(s):  
Path Planning ◽  
Extreme Point ◽  
Dimensional Space ◽  
Three Dimensional ◽  
Two Dimensions ◽  
Two Dimensional ◽  
Laser Bending ◽  
Scanning Path ◽  
Scanning Path Planning ◽  
Three Dimensional Space

A method is presented based on geometric-curvature characteristics in which a scanning path planning for laser bending of a straight tube into a curve tube in a two- and three-dimensional space. In a two-dimensional (plane) bending, the steel tube is divided into several segments according to the extreme point and inflection point of the desired shape of the tube, taking the extreme point as the initial place of the path planning, using different scanning space for every segment in order to identify the scanning paths. For a tube bending in a three-dimensional space, a projection decomposition method is used, where the three-dimensional is decomposed into two two-dimensions, and respective scanning path planning and process parameters are thus acquired. By combining the data in the two-dimensional planes, the three-dimensional scanning path plan was obtained. Finally, an experimental verification is carried out to bend straight tubes into a two-dimensional sinusoidal and a three-dimensional helical coil-shaped tube. The results show that the proposed method of scanning path planning is effective and feasible.

3D Navigational Path Planning

Robotica ◽  
1990 ◽  
Vol 8 (3) ◽  
pp. 195-205 ◽  
Author(s):  
T.M. Rao ◽  
Ronald C. Arkin
Keyword(s):  
Path Planning ◽  
Mobile Robot ◽  
Recent Literature ◽  
Dimensional Space ◽  
Three Dimensional ◽  
Two Dimensions ◽  
Polyhedral Objects ◽  
3D Surfaces ◽  
Three Dimensional Space

SUMMARYThe problem of path planning for a mobile robot has been studied extensively in recent literature. Much of the work in this area is devoted to the study of path planning for an earth-bound robot in two dimensions. In this paper, we explore the problem for a robot that can fly in three dimensional space or crawl on 3D surfaces or use a combination of both. We assume that the obstacles can be modeled as polyhedral objects.

scholarly journals A path planning method for a surface inspection system based on two-dimensional laser profile scanner

2019 ◽  
Vol 16 (4) ◽  
pp. 172988141986246 ◽  
Author(s):  
Lina Li ◽  
De Xu ◽  
Linkai Niu ◽  
Yuan Lan ◽  
Xiaoyan Xiong
Keyword(s):  
Path Planning ◽  
Three Dimensional ◽  
Neighborhood Search ◽  
Inspection System ◽  
Two Dimensional ◽  
Surface Data ◽  
Scanning Path ◽  
Scanning Path Planning ◽  
Robot Position ◽  
Orientation Determination

In this article, a method for two-dimensional scanning path planning based on robot is proposed. In this method, a section division algorithm based on neighborhood search method for scanning orientation determination is firstly produced. The scanning paths which meet constraints of the system are then generated. Finally, the experiment is carried out on robot-based scanning platform. The two-dimensional data from scanner and the robot position are combined to form three-dimensional surface data of measured workpiece. The experiment results verify the effectiveness of proposed method.

scholarly journals Improved Bat Algorithm for UAV Path Planning in Three-Dimensional Space

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 20100-20116
Author(s):  
Xianjin Zhou ◽  
Fei Gao ◽  
Xi Fang ◽  
Zehong Lan
Keyword(s):  
Path Planning ◽  
Dimensional Space ◽  
Three Dimensional ◽  
Bat Algorithm ◽  
Three Dimensional Space

scholarly journals FOUR-DIMENSIONAL BALL IN A GRAPHIC REPRESENTATION

2021 ◽  
pp. 37-46
Author(s):  
Helena Bidnichenko
Keyword(s):  
Dimensional Space ◽  
Three Dimensional ◽  
Geometric Modelling ◽  
Vector Model ◽  
Original Position ◽  
Two Dimensional ◽  
Axis Of Rotation ◽  
Dimensional Ball ◽  
Three Dimensional Space ◽  
Horizontal Vector

The paper presents a method for geometric modelling of a four-dimensional ball. For this, the regularities of the change in the shape of the projections of simple geometric images of two-dimensional and three-dimensional spaces during rotation are considered. Rotations of a segment and a circle around an axis are considered; it is shown that during rotation the shape of their projections changes from the maximum value to the degenerate projection. It was found that the set of points of the degenerate projection belongs to the axis of rotation, and each n-dimensional geometric image during rotation forms a body of a higher dimension, that is, one that belongs to (n + 1) -dimensional space. Identified regularities are extended to the four-dimensional space in which the ball is placed. It is shown that the axis of rotation of the ball will be a degenerate projection in the form of a circle, and the ball, when rotating, changes its size from a volumetric object to a flat circle, then increases again, but in the other direction (that is, it turns out), and then in reverse order to its original position. This rotation is more like a deformation, and such a ball of four-dimensional space is a hypersphere. For geometric modelling of the hypersphere and the possibility of its projection image, the article uses the vector model proposed by P.V. Filippov. The coordinate system 0xyzt is defined. The algebraic equation of the hypersphere is given by analogy with the three-dimensional space along certain coordinates of the center a, b, c, d. A variant of hypersection at t = 0 is considered, which confirms by equations obtaining a two-dimensional ball of three-dimensional space, a point (a ball of zero radius), which coincides with the center of the ball, or an imaginary ball. For the variant t = d, the equation of a two-dimensional ball is obtained, in which the radius is equal to R and the coordinates of all points along the 0t axis are equal to d. The variant of hypersection t = k turned out to be interesting, in which the equation of a two-dimensional sphere was obtained, in which the coordinates of all points along the 0t axis are equal to k, and the radius is . Horizontal vector projections of hypersection are constructed for different values of k. It is concluded that the set of horizontal vector projections of hypersections at t = k defines an ellipse.  

Scanning Path Planning for Laser Bending of Metal Tubes

2008 ◽  
Vol 35 (11) ◽  
pp. 1813-1820 ◽  
Author(s):  
王续跃 Wang Xuyue ◽  
陶春华 Tao Chunhua ◽  
许卫星 Xu Weixing ◽  
徐云飞 Xu Yunfei ◽  
吴东江 Wu Dongjiang
Keyword(s):  
Path Planning ◽  
Laser Bending ◽  
Scanning Path ◽  
Scanning Path Planning

Spatial phenomenology requires potential illumination

2003 ◽  
Vol 26 (4) ◽  
pp. 425-426
Author(s):  
James A. Schirillo
Keyword(s):  
Visual System ◽  
Spatial Model ◽  
Dimensional Space ◽  
Color Constancy ◽  
Three Dimensional ◽  
Two Dimensions ◽  
Three Dimensional Space

Collapsing three-dimensional space into two violates Lehar's “volumetric mapping” constraint and can cause the visual system to construct illusory transparent regions to replace voxels that would have contained illumination. This may underlie why color constancy is worse in two dimensions, and argues for Lehar to revise his phenomenal spatial model by putting “potential illumination” in empty space.

scholarly journals Capacity of Inhomogeneous Hybrid Wireless Networks in Three-Dimensional Space

2015 ◽  
Vol 11 (9) ◽  
pp. 47
Author(s):  
Feng Wu ◽  
Jiang Zhu ◽  
Yilong Tian ◽  
Zhipeng Xi
Keyword(s):  
Sensor Node ◽  
Dimensional Space ◽  
Three Dimensional ◽  
Network Capacity ◽  
Throughput Capacity ◽  
Two Dimensional ◽  
Hybrid Wireless Networks ◽  
Node Distribution ◽  
Analytical Expressions ◽  
Three Dimensional Space

Network capacity has been widely studied in recent years. However, most of the literatures focus on the networks where nodes are distributed in a two-dimensional space. In this paper, we propose a 3D hybrid sensor network model. By setting different sensor node distribution probabilities for cells, we divide all the cells in the network into dense cells and sparse cells. Analytical expressions of the aggregate throughput capacity are obtained. We also find that suitable inhomogeneity can increase the network throughput capacity.

Map fragmentation in two- and three-dimensional environments

2013 ◽  
Vol 36 (5) ◽  
pp. 569-570 ◽  
Author(s):  
Homare Yamahachi ◽  
May-Britt Moser ◽  
Edvard I. Moser
Keyword(s):  
Small Area ◽  
Dimensional Space ◽  
Three Dimensional ◽  
Two Dimensional ◽  
Brain Circuits ◽  
Three Dimensional Space

AbstractThe suggestion that three-dimensional space is represented by a mosaic of neural map fragments, each covering a small area of space in the plane of locomotion, receives support from studies in complex two-dimensional environments. How map fragments are linked, which brain circuits are involved, and whether metric is preserved across fragments are questions that remain to be determined.

Sign in / Sign up

Export Citation Format

Share Document