scholarly journals Optimizing Mobility of Robotic Arms in Collision-free Motion Planning

2021 ◽  
Vol 102 (2) ◽  
Author(s):  
Sascha Kaden ◽  
Ulrike Thomas

AbstractA major task in motion planning is to find paths that have a high ability to react to external influences while ensuring a collision-free operation at any time. This flexibility is even more important in human-robot collaboration since unforeseen events can occur anytime. Such ability can be described as mobility, which is composed of two characteristics. First, the ability to manipulate, and second, the distance to joint limits. This mobility needs to be optimized while generating collision-free motions so that there is always the flexibility of the robot to evade dynamic obstacles in the future execution of generated paths. For this purpose, we present a Rapidly-exploring Random Tree (RRT), which applies additional costs and sampling methods to increase mobility. Additionally, we present two methods for the optimization of a generated path. Our first approach utilizes the built-in capabilities of the RRT*. The second method optimize the path with the stochastic trajectory optimization for motion planning (STOMP) approach with Gaussian Mixture Models. Moreover, we evaluate the algorithms in complex simulation and real environments and demonstrate an enhancement of mobility.

2020 ◽  
Vol 10 (21) ◽  
pp. 7626
Author(s):  
Clautilde Nguiadem ◽  
Maxime Raison ◽  
Sofiane Achiche

(1) Background: Motion planning is an important part of exoskeleton control that improves the wearer’s safety and comfort. However, its usage introduces the problem of trajectory planning. The objective of trajectory planning is to generate the reference input for the motion-control system. This review explores the methods of trajectory planning for exoskeleton control. In order to reduce the number of surveyed papers, this review focuses on the upper limbs, which require refined three-dimensional motion planning. (2) Methods: A systematic search covering the last 20 years was conducted in Ei Compendex, Inspect-IET, Web of Science, PubMed, ProQuest, and Science-Direct. The search strategy was to use and combine terms “trajectory planning”, “upper limb”, and ”exoskeleton” as high-level keywords. “Trajectory planning” and “motion planning” were also combined with the following keywords: “rehabilitation”, “humanlike motion“, “upper extremity“, “inverse kinematic“, and “learning machine “. (3) Results: A total of 67 relevant papers were discovered. Results were then classified into two main categories of methods to plan trajectory: (i) Approaches based on Cartesian motion planning, and inverse kinematics using polynomial-interpolation or optimization-based methods such as minimum-jerk, minimum-torque-change, and inertia-like models; and (ii) approaches based on “learning by demonstration” using machine-learning techniques such as supervised learning based on neural networks, and learning methods based on hidden Markov models, Gaussian mixture models, and dynamic motion primitives. (4) Conclusions: Various methods have been proposed to plan the trajectories for upper-limb exoskeleton robots, but most of them plan the trajectory offline. The review approach is general and could be extended to lower limbs. Trajectory planning has the advantage of extending the applicability of therapy robots to home usage (assistive exoskeletons); it also makes it possible to mitigate the shortages of medical caregivers and therapists, and therapy costs. In this paper, we also discuss challenges associated with trajectory planning: kinematic redundancy and incompatibility, and the trajectory-optimization problem. Commonly, methods based on the computation of swivel angles and other methods rely on the relationship (e.g., coordinated or synergistic) between the degrees of freedom used to resolve kinematic redundancy for exoskeletons. Moreover, two general solutions, namely, the self-tracing configuration of the joint axis and the alignment-free configuration of the joint axis, which add the appropriate number of extra degrees of freedom to the mechanism, were employed to improve the kinematic incompatibility between human and exoskeleton. Future work will focus on online trajectory planning and optimal control. This will be done because very few online methods were found in the scope of this study.


2021 ◽  
Vol 11 (24) ◽  
pp. 11712
Author(s):  
Michal Dobiš ◽  
Martin Dekan ◽  
Adam Sojka ◽  
Peter Beňo ◽  
František Duchoň

This paper presents novel extensions of the Stochastic Optimization Motion Planning (STOMP), which considers cartesian path constraints. It potentially has high usage in many autonomous applications with robotic arms, where preservation or minimization of tool-point rotation is required. The original STOMP algorithm is unable to use the cartesian path constraints in a trajectory generation because it works only in robot joint space. Therefore, the designed solution, described in this paper, extends the most important parts of the algorithm to take into account cartesian constraints. The new sampling noise generator generates trajectory samples in cartesian space, while the new cost function evaluates them and minimizes traversed distance and rotation change of the tool-point in the resulting trajectory. These improvements are verified with simple experiments and the solution is compared with the original STOMP. Results of the experiments show that the implementation satisfies the cartesian constraints requirements.


Mathematics ◽  
2021 ◽  
Vol 9 (9) ◽  
pp. 957
Author(s):  
Branislav Popović ◽  
Lenka Cepova ◽  
Robert Cep ◽  
Marko Janev ◽  
Lidija Krstanović

In this work, we deliver a novel measure of similarity between Gaussian mixture models (GMMs) by neighborhood preserving embedding (NPE) of the parameter space, that projects components of GMMs, which by our assumption lie close to lower dimensional manifold. By doing so, we obtain a transformation from the original high-dimensional parameter space, into a much lower-dimensional resulting parameter space. Therefore, resolving the distance between two GMMs is reduced to (taking the account of the corresponding weights) calculating the distance between sets of lower-dimensional Euclidean vectors. Much better trade-off between the recognition accuracy and the computational complexity is achieved in comparison to measures utilizing distances between Gaussian components evaluated in the original parameter space. The proposed measure is much more efficient in machine learning tasks that operate on large data sets, as in such tasks, the required number of overall Gaussian components is always large. Artificial, as well as real-world experiments are conducted, showing much better trade-off between recognition accuracy and computational complexity of the proposed measure, in comparison to all baseline measures of similarity between GMMs tested in this paper.


Entropy ◽  
2021 ◽  
Vol 23 (5) ◽  
pp. 518
Author(s):  
Osamu Komori ◽  
Shinto Eguchi

Clustering is a major unsupervised learning algorithm and is widely applied in data mining and statistical data analyses. Typical examples include k-means, fuzzy c-means, and Gaussian mixture models, which are categorized into hard, soft, and model-based clusterings, respectively. We propose a new clustering, called Pareto clustering, based on the Kolmogorov–Nagumo average, which is defined by a survival function of the Pareto distribution. The proposed algorithm incorporates all the aforementioned clusterings plus maximum-entropy clustering. We introduce a probabilistic framework for the proposed method, in which the underlying distribution to give consistency is discussed. We build the minorize-maximization algorithm to estimate the parameters in Pareto clustering. We compare the performance with existing methods in simulation studies and in benchmark dataset analyses to demonstrate its highly practical utilities.


2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Masahiro Inagawa ◽  
Toshinobu Takei ◽  
Etsujiro Imanishi

AbstractMany cooking robots have been developed in response to the increasing demand for such robots. However, most existing robots must be programmed according to specific recipes to enable cooking using robotic arms, which requires considerable time and expertise. Therefore, this paper proposes a method to allow a robot to cook by analyzing recipes available on the internet, without any recipe-specific programming. The proposed method can be used to plan robot motion based on the analysis of the cooking procedure for a recipe. We developed a cooking robot to execute the proposed method and evaluated the effectiveness of this approach by analyzing 50 recipes. More than 25 recipes could be cooked using the proposed approach.


2017 ◽  
Vol 34 (10) ◽  
pp. 1399-1414 ◽  
Author(s):  
Wanxia Deng ◽  
Huanxin Zou ◽  
Fang Guo ◽  
Lin Lei ◽  
Shilin Zhou ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document