Search

The repetitive motion planning movements of the redundant manipulator will cause oscillations and unintended swings of joints, which increase the risk of collisions between the manipulator and its surroundings. Motivated by this phenomenon, this paper presents an inverse kinematics algorithm for the spherical-revolute-spherical manipulator to solve the paradox raised by joint-drift and control the pose with no swing of the elbow. This algorithm takes the joint Cartesian positions set as the intermediary and divides the inverse solution process into two mapping processes within joint limits. Simulations are executed to evaluate this algorithm, and the results show this algorithm is applicable to repetitive motion planning and is capable of producing superior configurations based on its real-time ability and stable solve rate. Experiments using the 7-degree-of-freedom spherical-revolute-spherical manipulator demonstrate the effectiveness of this algorithm to remedy the joint-drift and elbow swing compared to Kinematics and Dynamics Library and TRAC-IK. [ABSTRACT FROM AUTHOR]

SUMMARY: This paper addresses the application of a novel elimination algorithm with a newly developed homotopy continuation method (HCM) for forward kinematics of a specific hybrid modular manipulator known as n-(6UPS). First, the kinematic model of n-(6UPS) was extracted using a homogenous transformation matrix method. Then, a novel algebraic elimination algorithm was developed to transform the highly nonlinear proposed kinematic model into a system of polynomial equations for each module. Next, the HCM is considered to solve the system of equations. Comparison of the results from the proposed approach with experimental data and other methods demonstrates the efficiency of the proposed contribution. [ABSTRACT FROM AUTHOR]

This paper proposes a systematic algorithm based on the concept of interval analysis to obtain the maximal singularity-free circle or sphere within the workspace of parallel mechanisms. As case studies the 3-RPR planar and 6-UPS parallel mechanisms are considered to illustrate the relevance of the algorithm for 2D and 3D workspaces. To this end, the main algorithm is divided into four sub-algorithms, which eases the understanding of the main approach and leads to a more effective and robust algorithm to solve the problem. The first step is introduced to obtain the constant-orientation workspace and then the singularity locus. The main purpose is to obtain the maximal singularity-free workspace for an initial guess. Eventually, the general maximal singularity-free workspace is obtained. The main contribution of the paper is the proposition of a systematic algorithm to obtain the maximal singularity-free circle/sphere in the workspace of parallel mechanisms. The combination of a maximal singularity-free circle or sphere with the workspace analysis by taking into account the stroke of actuators, as additional constraint to the latter problem, is considered. Moreover, the center point of the circle/sphere is not restrained to a prescribed point. [ABSTRACT FROM PUBLISHER]

On-line full body imitation with a humanoid robot standing on its own two feet requires simultaneously maintaining the balance and imitating the motion of the demonstrator. In this paper we present a method that allows real-time motion imitation while maintaining stability, based on prioritized task control. We also describe a method of modified prioritized kinematic control that constrains the imitated motion to preserve stability only when the robot would tip over, but does not alter the motions otherwise. To cope with the passive compliance of the robot, we show how to model the estimation of the center of mass of the robot using support vector machines. In the paper we give detailed description of all steps of the algorithm, essentially providing a tutorial on the implementation of kinematic stability control. We present the results on a child-sized humanoid robot called Compliant Humanoid Platform or COMAN. Our implementation shows reactive and stable on-line motion imitation of the humanoid robot. [ABSTRACT FROM PUBLISHER]

This paper presents a novel configuration optimization method for multi degree-of-freedom modular reconfigurable robots (MRR) using a memetic algorithm (MA) that combines genetic algorithms (GAs) and a local search method. The proposed method generates multiple solutions to the inverse kinematics (IK) problem for any given spatial task and the MA chooses the most suitable configuration based on the search objectives. Since the dimension of each robotic link in this optimization is considered telescopic, the proposed method is able to find better solutions to the IK problem than GAs. The case study for a 3-DOF MRR shows that the MA finds solutions to the IK problem much faster than a GA with noticeably less reachability error. Additional case studies show that the proposed MA method can find multiple IK solutions in various scenarios and identify the fittest solution as a suboptimal configuration for the MRR. [ABSTRACT FROM AUTHOR]

This paper deals with the motion prediction and control of the macro–micro parallel manipulator system for a 500-m-aperture spherical radio telescope (FAST). Firstly, based on principles of parallel mechanism, a decoupled tracking and prediction algorithm to predict the position and orientation of the movable macro parallel manipulator is presented in this paper. Then, taken as the upper layer supervisory controller in the joint space of the micro parallel manipulator, the adaptive interaction PID controller utilizing the adaptive interaction algorithm to adjust the parameters of a canonical PID controller is discussed. In addition, the digital servo filters with feedforward are employed in the linear actuators as the lower layer controllers. Experimental results of a one-tenth scale FAST field model validate the effectiveness of the supervisory controller and the motion prediction algorithm. [ABSTRACT FROM AUTHOR]

This paper addresses the problems of barrier coverage and sweep coverage in a corridor environment with a network of self-deployed mobile autonomous robotic sensors. Using the ideas of nearest neighbor rules and information consensus, we propose a decentralized control law for the robotic sensors to solve the coverage problems. Numerical simulations illustrate the effectiveness of the proposed algorithm. The results in this paper demonstrate that such simple motion coordination rules can play a significant role in addressing the issue of coverage in a mobile robotic sensor network. [ABSTRACT FROM AUTHOR]

It has been shown before that the Rapidly Exploring Random Tree (RRT) algorithm is probabilistically and resolution complete; and that the probability of finding a particular solution path can be related to the number of nodes. However, little analysis exists on the rate at which the tree covers the configuration space. In this paper, we present a stochastic difference equation which models how the tree covers the configuration space as a function of the number of nodes in the tree. Using two simplifying assumptions, appropriate for holonomic, kinematic systems in expansive configuration spaces, we derive closed-form solutions for the expected value and variance of configuration space coverage, which only depend on two easily computable parameters. Using a grid-based coverage measurement, we present experimental evidence supporting this model across a range of dimensions, obstacle densities, and parameter choices. Collecting data from 1000 RRTs, we provide evidence that configuration space coverage concentrates tightly around the expected coverage predicted by the model; and the results of the Chi-squared test suggest that the distribution of coverage across these runs is highly Gaussian. Together these results enable one to predict the expected coverage, along with a confidence interval, after a certain number of nodes have been added to the tree. We also applied the model to an example with extremely narrow passages and to a system with non-holonomic kinematics. The expected value prediction is still qualitatively accurate; but the rate constant is reduced and the variance is higher. Overall, in addition to its theoretical value, the model may find future application as an online measure of search-progress and problem difficulty, useful for adaptive variants of the basic RRT algorithm. [ABSTRACT FROM PUBLISHER]

The average inter-station distances in most established network Real Time Kinematic (RTK) systems are constrained to around 50 km. A sparse network RTK system with an average inter-station distance of up to 300 km would have many appealing advantages over a conventional one, including a significant reduction in the development and maintenance costs. The first part of this paper introduces the key approaches for sparse network RTK positioning technology. These include long-range reference baseline ambiguity resolution and real-time kinematic ambiguity resolution for the rover receivers. The proposed method for long-range kinematic ambiguity resolution can overcome the network weaknesses through three procedures: application of the interpolated corrections from the sparse network only to wide-lane combination; searching the ambiguities of wide-lane combination; and searching L1 ambiguities with wide-lane combination and ionosphere-free observables. To test these techniques, a network including ten reference stations was created from the Ordnance Survey's Network (OS NetTM) that covers the whole territory of the United Kingdom (UK). The average baseline length of this sparse network is about 300 km. To assess the positioning performance, nine rover stations situated inside and outside the network were also selected from the OS Net™. Finally, the accuracy of interpolated corrections, the positioning accuracy and the initialization time required for precise positioning were estimated and analysed. From the observed performance of each rover receiver, and the accuracy of interpolated network corrections, it can be concluded that it is feasible to use a sparse reference station network with an average inter-station distance up to 300 km for achieving similar performance to traditional network RTK positioning. The proposed approach can provide more cost-efficient use of network RTK (NRTK) positioning for engineering and environmental applications that are currently being delivered by traditional network RTK positioning technology. [ABSTRACT FROM AUTHOR]

The determination of the correct integer number of carrier cycles (integer ambiguity) is the key to high accuracy positioning with carrier phase measurements from Global Navigation Satellite Systems (GNSS). There are a number of current methods for resolving ambiguities including the Least-squares AMBiguity Decorrelation Adjustment (LAMBDA) method, which is a combination of least-squares and a transformation to reduce the search space. The current techniques to determine the level of confidence (integrity) of the resolved ambiguities (i.e. ambiguity validation), usually involve the construction of test statistics, characterisation of their distribution and definition of thresholds. Example tests applied include ratio, F-distribution, t-distribution and Chi-square distribution. However, the assumptions that underpin these tests have weaknesses. These include the application of a fixed threshold for all scenarios, and therefore, not always able to provide an acceptable integrity level in the computed ambiguities. A relatively recent technique referred to as Integer Aperture (IA) based on the ratio test with a large number of simulated samples of float ambiguities requires significant computational resources. This precludes the application of IA in real time.This paper proposes and demonstrates the power of an integrity monitoring technique that is applied at the ambiguity resolution and positioning stages. The technique has the important benefit of facilitating early detection of any potential threat to the position solution, originating in the ambiguity space, while at the same time giving overall protection in the position domain based on the required navigation performance. The proposed method uses the conventional test statistic for ratio testing together with a doubly non-central F distribution to compute the level of confidence (integrity) of the ambiguities. Specifically, this is determined as a function of geometry and the ambiguity residuals from least squares based ambiguity resolution algorithms including LAMBDA. A numerical method is implemented to compute the level of confidence in real time.The results for Precise Point Positioning (PPP) with simulated and real data demonstrate the power and efficiency of the proposed method in monitoring both the integrity of the ambiguity computation and position solution processes. Furthermore, due to the fact that the method only requires information from least squares based ambiguity resolution algorithms, it is easily transferable to conventional Real Time Kinematic (RTK) positioning. [ABSTRACT FROM AUTHOR]

A scrutiny of the existing time differencing carrier phase (TDCP) velocity estimation algorithms has revealed several shortcomings that could be further improved. One of these is that the velocity estimation at epoch t would require the receiver positions at epoch t+Δt or more are available. Another is the usage of satellite velocities in the calculations which would increase the receiver computational load and degrade the accuracy. In this paper, an improved TDCP velocity estimation approach has been proposed and tested. The new approach depends only on receiver position at epoch t and satellite positions at epoch t and t+Δt. Satellite velocities are not required in this calculation. This proposed algorithm has been validated using static and kinematic field test data, showing that equivalent velocity accuracy achievable by using differential GPS techniques can be made possible with the proposed standalone GPS method. [ABSTRACT FROM AUTHOR]

SUMMARYThis paper proposes a method for task based design of modular serial robotic arms using evolutionary algorithms (EA). We introduce a 3D kinematics and a global optimization for both topology and configuration from task specifications. The search features revolute as well as prismatic joints and any number of DOF to build up a solution without using any design knowledge. A study of the evolution dynamics gives some keys to set evolution parameters that enable artificial evolution. An adapted algorithm dealing with the topology/configuration search tradeoff is proposed, descibed, and discussed. Illustrations of the algorithms results are given and conclusions are drawn from their analysis. Perspectives of this work are given, extending its reach to control and complex system design. [ABSTRACT FROM AUTHOR]

SUMMARYThis paper presents analysis and experimental verifications of a new robot manipulator with five degrees of freedom developed for the buffing operation of shoes. First, the forward and inverse kinematics are analyzed. Next, an analytic closed-form solution is rigorously derived for the joint angles corresponding to the position and orientation of the end-effector in Cartesian coordinates. A control system, including input/output interfaces and the related electronic system, is designed for the control of the mechanical structure of the buffing robot. Then, peripheral systems integrated with the conveyer, transfer device, and fixture device are designed for the sequential buffing process of shoes. Also, a graphic user interface (GUI) program including the forward/inverse kinematics, control algorithm, and communication program to interact the robot with the peripheral systems is developed by using visual C++ language. A new flexible toolholder (FTH) is proposed to compensate for the excessive applied force between deburring tools and shoes. Finally, the test results are provided to demonstrate the effectiveness of the proposed scheme. [ABSTRACT FROM AUTHOR]