Generalization of the Impedance Matrix Method for Extraordinarily Large-Scale Pile Groups

Author(s):  
Ana Carolina Azevedo Vasconcelos ◽  
Josue Labaki
Author(s):  
Rajkumar Gothandaraman ◽  
Sreekumar Muthuswamy

Purpose This paper aims to propose a system to acquire images automatically for digital reconstruction of heritage artifacts using a six-degree of freedom industrial manipulator. Design/methodology/approach A virtual environment is created using Robot Studio® software to integrate the trajectory and differential motion of the robot manipulator and the motion of camera while acquiring images. A new area similarity matrix method is proposed to reduce the number of images required for digital reconstruction using Autodesk Recap® software. Real-time experiments have been performed using objects such as minion, ultimaker robot and cube. Evaluation of the digital reconstruction is conducted using the contour area matching method. Findings The number of images required for reconstruction based on area similarity matrix method is reduced to 63 per cent when compared with the random selection method. Quality parameters such as surface area, volume, number of defect holes, vertices and faces are enhanced for the proposed method. Research limitations/implications Digital reconstruction of large-sized heritage artifacts cannot be performed in this setup. But this can be overcome by fixing the manipulator on a mobile platform or overhead crane. This paper does not discuss the reconstruction of partially damaged heritage artifacts, which could be accomplished based on deep learning techniques. Practical implications Using this approach, off-the-shelf heritage artifacts and large-scale objects can be reconstructed digitally with a minimum number of images and without compromising the quality of original models. Originality/value To the best of the authors’ knowledge, area similarity-based approach in 3D digital reconstruction by coupling the kinematics of an industrial manipulator and camera is proposed for the first time. A fully automated digital reconstruction technology to preserve valuable heritage artifacts has been developed. It also highlights the space constraints of the industrial manipulator in digital reconstruction.


Author(s):  
M. Destrade ◽  
R. W. Ogden ◽  
I. Sgura ◽  
L. Vergori

One of the least studied universal deformations of incompressible nonlinear elasticity, namely the straightening of a sector of a circular cylinder into a rectangular block, is revisited here and, in particular, issues of existence and stability are addressed. Particular attention is paid to the system of forces required to sustain the large static deformation, including by the application of end couples. The influence of geometric parameters and constitutive models on the appearance of wrinkles on the compressed face of the block is also studied. Different numerical methods for solving the incremental stability problem are compared and it is found that the impedance matrix method, based on the resolution of a matrix Riccati differential equation, is the more precise.


2010 ◽  
Author(s):  
Changmin Fu ◽  
Qingyun Di ◽  
Miaoyue Wang
Keyword(s):  

2020 ◽  
Vol 35 (8) ◽  
pp. 864-871
Author(s):  
Mingxuan Zheng ◽  
Huiling Zhao ◽  
Zhonghui Zhao

A fast algorithm based on AIM is proposed to analyze the scattering problem of the large-scale finite array. In this method, by filling zeros into the local transformation matrix, the near and far fields are isolated thoroughly to eliminate the near correction process. In the far part, a 5-level block-toeplitz matrix is employed to avoid saving the idle grids without adding artificial interfaces. In the near part, only one local cube is required to compute the local translation matrix and near impedance matrix, which can be shared by all elements. Furthermore, the block Jacobi preconditioning technique is applied to improve the convergence, and the principle of pattern multiplication is used to accelerate the calculation of the scattering pattern. Numerical results show that the proposed method can reduce not only the CPU time in filling and solving matrix but also the whole memory requirement dramatically for the large-scale finite array with large spacings.


1965 ◽  
Vol 84 (12) ◽  
pp. 1204-1214 ◽  
Author(s):  
H. E. Brown ◽  
H. H. Happ ◽  
C. E. Person ◽  
C. C. Young

Sign in / Sign up

Export Citation Format

Share Document