Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Novel Posture Positioning Method for Multi-Joint Manipulators
131
0
0.0
(
0
)
Added by
Qingna Li
Publication date
2020
fields
Electronic Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Safety and automatic control are extremely important when operating manipulators. For large engineering manipulators, the main challenge is to accurately recognize the posture of all arm segments. In classical sensing methods, the accuracy of an inclinometer is easily affected by the elastic deformation in the manipulators arms. This results in big error accumulations when sensing the angle of joints between arms one by one. In addition, the sensing method based on machine vision is not suitable for such kind of outdoor working situation yet. In this paper, we propose a novel posture positioning method for multi-joint manipulators based on wireless sensor network localization. The posture sensing problem is formulated as a Nearest-Euclidean-Distance-Matrix (NEDM) model. The resulting approach is referred to as EDM-based posture positioning approach (EPP) and it satisfies the following guiding principles: (i) The posture of each arm segment on a multi-joint manipulator must be estimated as accurately as possible; (ii) The approach must be computationally fast; (iii) The designed approach should not be susceptible to obstructions. To further improve accuracy, we explore the inherent structure of manipulators, i.e., fixed-arm length. This is naturally presented as linear constraints in the NEDM model. For concrete pumps, a typical multi-joint manipulator, the mechanical property that all arm segments always lie in a 2D plane is used for dimension-reduction operation. Simulation and experimental results show that the proposed method provides efficient solutions for posture sensing problem and can obtain preferable localization performance with faster speed than applying the existing localization methods.
rate research
Read More
In this paper, we give some new thoughts about the classical gradient method (GM) and recall the proposed fractional order gradient method (FOGM). It is proven that the proposed FOGM holds a super convergence capacity and a faster convergence rate around the extreme point than the conventional GM. The property of asymptotic convergence of conventional GM and FOGM is also discussed. To achieve both a super convergence capability and an even faster convergence rate, a novel switching FOGM is proposed. Moreover, we extend the obtained conclusion to a more general case by introducing the concept of p-order Lipschitz continuous gradient and p-order strong convex. Numerous simulation examples are provided to validate the effectiveness of proposed methods.
Multi-point detection of the full-scale environment is an important issue in autonomous driving. The state-of-the-art positioning technologies (such as RADAR and LIDAR) are incapable of real-time detection without line-of-sight. To address this issue, this paper presents a novel multi-point vehicular positioning technology via emph{millimeter-wave} (mmWave) transmission that exploits multi-path reflection from a emph{target vehicle} (TV) to a emph{sensing vehicle} (SV), which enables the SV to fast capture both the shape and location information of the TV in emph{non-line-of-sight} (NLoS) under the assistance of multi-path reflections. A emph{phase-difference-of-arrival} (PDoA) based hyperbolic positioning algorithm is designed to achieve the synchronization between the TV and SV. The emph{stepped-frequency-continuous-wave} (SFCW) is utilized as signals for multi-point detection of the TVs. Transceiver separation enables our approach to work in NLoS conditions and achieve much lower latency compared with conventional positioning techniques.
Accurate prediction of epileptic seizures allows patients to take preventive measures in advance to avoid possible injuries. In this work, a novel convolutional neural network (CNN) is proposed to analyze time, frequency, and channel information of electroencephalography (EEG) signals. The model uses three-dimensional (3D) kernels to facilitate the feature extraction over the three dimensions. The application of multiscale dilated convolution enables the 3D kernel to have more flexible receptive fields. The proposed CNN model is evaluated with the CHB-MIT EEG database, the experimental results indicate that our model outperforms the existing state-of-the-art, achieves 80.5% accuracy, 85.8% sensitivity and 75.1% specificity.
The fields of signal and image processing have been deeply influenced by the introduction of deep neural networks. These are successfully deployed in a wide range of real-world applications, obtaining state of the art results and surpassing well-known and well-established classical methods. Despite their impressive success, the architectures used in many of these neural networks come with no clear justification. As such, these are usually treated as black box machines that lack any kind of interpretability. A constructive remedy to this drawback is a systematic design of such networks by unfolding well-understood iterative algorithms. A popular representative of this approach is the Iterative Shrinkage-Thresholding Algorithm (ISTA) and its learned version -- LISTA, aiming for the sparse representations of the processed signals. In this paper we revisit this sparse coding task and propose an unfolded version of a greedy pursuit algorithm for the same goal. More specifically, we concentrate on the well-known Orthogonal-Matching-Pursuit (OMP) algorithm, and introduce its unfolded and learned version. Key features of our Learned Greedy Method (LGM) are the ability to accommodate a dynamic number of unfolded layers, and a stopping mechanism based on representation error, both adapted to the input. We develop several variants of the proposed LGM architecture and test some of them in various experiments, demonstrating their flexibility and efficiency.
We introduce a twice differentiable augmented Lagrangian for nonlinear optimization with general inequality constraints and show that a strict local minimizer of the original problem is an approximate strict local solution of the augmented Lagrangian. A novel augmented Lagrangian method of multipliers (ALM) is then presented. Our method is originated from a generalization of the Hetenes-Powell augmented Lagrangian, and is a combination of the augmented Lagrangian and the interior-point technique. It shares a similar algorithmic framework with existing ALMs for optimization with inequality constraints, but it can use the second derivatives and does not depend on projections on the set of inequality constraints. In each iteration, our method solves a twice continuously differentiable unconstrained optimization subproblem on primal variables. The dual iterates, penalty and smoothing parameters are updated adaptively. The global and local convergence are analyzed. Without assuming any constraint qualification, it is proved that the proposed method has strong global convergence. The method may converge to either a Kurash-Kuhn-Tucker (KKT) point or a singular stationary point when the converging point is a minimizer. It may also converge to an infeasible stationary point of nonlinear program when the problem is infeasible. Furthermore, our method is capable of rapidly detecting the possible infeasibility of the solved problem. Under suitable conditions, it is locally linearly convergent to the KKT point, which is consistent with ALMs for optimization with equality constraints. The preliminary numerical experiments on some small benchmark test problems demonstrate our theoretical results.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
