Dynamic design,numerical solution and effective verification of acceleration-level obstacle-avoidance scheme for robot manipulators

For avoiding obstacles and joint physical constraints of robot manipulators, this paper proposes and investigates a novel obstacle avoidance scheme (termed the acceleration-level obstacle-avoidance scheme). The scheme is based on a new obstacle-avoidance criterion that is designed by using the gradient neural network approach for the first time. In addition, joint physical constraints such as joint-angle limits, joint-velocity limits and joint-acceleration limits are incorporated into such a scheme, which is further reformulated as a quadratic programming (QP). Two important ‘bridge’ theorems are established so that such a QP can be converted equivalently to a linear variational inequality and then equivalently to a piecewise-linear projection equation (PLPE). A numerical algorithm based on a PLPE is thus developed and applied for an online solution of the resultant QP. Four path-tracking tasks based on the PA10 robot in the presence of point and window-shaped obstacles demonstrate and verify the effectiveness and accuracy of the acceleration-level obstacle-avoidance scheme. Besides, the comparisons between the non-obstacle-avoidance and obstacle-avoidance results further validate the superiority of the proposed scheme.     

Bi-criteria Velocity Minimization of Robot Manipulators Using a Linear Variational Inequalities-Based Primal-Dual Neural Network and PUMA560 Example

In this paper, to diminish discontinuity points arising in the infinity-norm velocity minimization scheme, a bi-criteria velocity minimization scheme is presented based on a new neural network solver (i.e., a primal-dual neural network based on linear variational inequalities (LVI)). Such a kinematic control scheme of redundant manipulators can incorporate joint physical limits such as joint limits and joint velocity limits simultaneously. Moreover, the presented kinematic control scheme can be formulated as a quadratic programming (QP) problem. As a real-time QP solver, the LVI-based primal-dual neural network is established with a simple piecewise linear structure and higher computational efficiency. Computer simulations performed based on a PUMA560 manipulator are presented to illustrate the validity and advantages of such a bi-criteria neural control scheme for redundant robots.     

Different-level two-norm and infinity-norm minimization to remedy joint-torque instability/divergence for redundant robot manipulators

To remedy the joint-torque instability/divergence phenomenon arising in the conventional infinity-norm torque-minimization (INTM) scheme, and prevent the occurrence of high joint-velocity and joint-acceleration as well, a different-level bi-criteria minimization scheme is proposed and investigated in this paper for redundant robot manipulators with physical constraints (e.g., joint-angle limits, joint-velocity limits and joint-acceleration limits) considered. Such a scheme combines the minimum two-norm joint-velocity and infinity-norm joint-torque solutions via a weighting factor, which guarantees the final joint-velocity of the motion to be near zero (more acceptable for engineering application). In addition, the different-level scheme is reformulated as a general quadratic program (QP) and resolved at the joint-acceleration level. Computer-simulation results based on the PUMA560 robot manipulator further demonstrate the effectiveness and advantages of the proposed different-level bi-criteria minimization scheme for robotic redundancy resolution.     

Different-Level Simultaneous Minimization of Joint-Velocity and Joint-Torque for Redundant Robot Manipulators

In J Robot Syst 13(3):177–185 (1996), Ma proposed an efficient technique to stabilize local torque optimization solution of redundant manipulators, which prevents occurrence of high joint-velocity and guarantees the final joint-velocity to be near zero. To prevent the same problems, a different-level simultaneous minimization scheme is proposed in this paper for robotic redundancy resolution, which combines the minimum two-norm joint-velocity and joint-torque solutions via two weighting factors. Physical constraints such as joint-angle limits, joint-velocity limits and joint-acceleration limits are also taken into consideration in such a scheme-formulation. Moreover, the proposed different-level simultaneous minimization scheme is resolved at the joint-acceleration level and reformulated as a general quadratic program (QP). Computer-simulation results based on the PUMA560 robot manipulator performing different types of end-effector path-tracking tasks demonstrate the validity and advantage of the proposed different-level simultaneous minimization scheme. Furthermore, experimental verification conducted on a practical six-link planar robot manipulator substantiates the effectiveness and the physical realizability of the proposed scheme.     

Remedy scheme and theoretical analysis of joint-angle drift phenomenon for redundant robot manipulators

A quadratic programming (QP)-based method, as a remedy for joint angle drifts, is employed for redundant robot manipulators with physical constraints (e.g., joint-angle limits and joint-velocity limits) considered. By using the QP-based redundancy-resolution scheme, real-time repetitive motion planning (RMP) can be achieved in a drift-free manner. Theoretical analyses based on gradient-descent and neural-dynamic methods are also conducted. Based on analyses, the efficacy of the presented QP-based RMP scheme for redundant manipulators is successfully explained. To demonstrate the effectiveness of the RMP scheme, different kinds of redundant robot manipulators, such as PA10, PUMA560, and a six-link planar robot arm, are tested in order to perform circular and straight line end-effector trajectories by using computer simulations. Both theoretical analysis and computer simulation results have demonstrated the efficacy of the QP-based RMP scheme.     

Repetitive motion of redundant robots planned by three kinds of recurrent neural networks and illustrated with a four-link planar manipulator’s straight-line example

In this paper, a dual neural network, LVI (linear variational inequalities)-based primal-dual neural network and simplified LVI-based primal-dual neural network are presented for online repetitive motion planning (RMP) of redundant robot manipulators (with a four-link planar manipulator as an example). To do this, a drift-free criterion is exploited in the form of a quadratic performance index. In addition, the repetitive-motion-planning scheme could incorporate the joint physical limits such as joint limits and joint velocity limits simultaneously. Such a scheme is finally reformulated as a quadratic program (QP). As QP real-time solvers, the aforementioned three kinds of neural networks all have piecewise-linear dynamics and could globally exponentially converge to the optimal solution of strictly-convex quadratic-programs. Furthermore, the neural-network based RMP scheme is simulated based on a four-link planar robot manipulator. Computer-simulation results substantiate the theoretical analysis and also show the effective remedy of the joint angle drift problem of robot manipulators.     

A unified quadratic-programming-based dynamical system approach to joint torque optimization of physically constrained redundant manipulators

In this paper, for joint torque optimization of redundant manipulators subject to physical constraints, we show that velocity-level and acceleration-level redundancy-resolution schemes both can be formulated as a quadratic programming (QP) problem subject to equality and inequality/bound constraints. To solve this QP problem online, a primal-dual dynamical system solver is further presented based on linear variational inequalities. Compared to previous researches, the presented QP-solver has simple piecewise-linear dynamics, does not entail real-time matrix inversion, and could also provide joint-acceleration information for manipulator torque control in the velocity-level redundancy-resolution schemes. The proposed QP-based dynamical system approach is simulated based on the PUMA560 robot arm with efficiency and effectiveness demonstrated.     

Fault-tolerant motion planning and control of redundant manipulator

One important issue in the motion planning of a kinematic redundant manipulator is fault tolerance. In general, if the motion planner is fault tolerant, the manipulator can achieve the required path of the end-effector even when its joint fails. In this situation, the contribution of the faulty joint to the end-effector is required to be compensated by the healthy joints to maintain the prescribed end-effector trajectory. To achieve this, this paper proposes a fault-tolerant motion planning scheme by adding a simple fault-tolerant equality constraint for the faulty joint. Such a scheme is then unified into a quadratic program (QP), which incorporates joint-physical constraints such as joint limits and joint-velocity limits. In addition, a numerical computing solver based on linear variational inequalities (LVI) is presented for the real-time QP solving. Simulative studies and experimental results based on a six degrees-of-freedom (DOF) redundant robot manipulator with variable joint-velocity limits substantiate the effectiveness of the proposed fault-tolerant scheme and its solution.     

Two/Infinity Norm Criteria Resolution of Manipulator Redundancy at Joint‐Acceleration Level Using Primal‐Dual Neural Network

A two/infinity norm criteria (termed bi‐criteria) weighting scheme is proposed in this paper for resolving manipulator redundancy at the joint‐acceleration level. This bi‐criteria scheme is aimed at remedying discontinuity‐points and torque‐instability problems which arise in pure infinity‐norm acceleration‐minimization schemes. By incorporating joint physical limits, the proposed bi‐criteria redundancy‐resolution scheme can finally be formulated as a quadratic program (QP) subject to equality constraint, inequality constraint and bound constraint simultaneously. As a real‐time QP solver with simple piecewise‐linear dynamics and higher computational efficiency, the primal‐dual neural network based on linear variational inequalities (LVI) is presented in this paper to solve online such a bi‐criteria weighting scheme. Computer‐simulation results based on a PMUA560 robot arm illustrate the advantages and efficacy of such a neural weighting scheme.     

Analysis and Verification of Repetitive Motion Planning and Feedback Control for Omnidirectional Mobile Manipulator Robotic Systems

Mobile manipulator robotic systems (MMRSs) composed of a manipulator and a mobile platform are investigated in this paper. In order for the mobile manipulator robotic system (MMRS) to return to its initial state when the manipulator’s end-effector is requested to execute cyclical tasks, a quadratic program (QP) based repetitive motion planning and feedback control (RMPFC) scheme is proposed and analyzed. Such an RMPFC scheme can not only mix motion planning and reactive control, but also consider the physical limits of the robotic system. Mathematically, the efficacy of the RMPFC scheme is verified via gradient dynamics analysis. To further demonstrate the effectiveness of the RMPFC scheme, a kinematically redundant MMRS composed of a three degrees-of-freedom (DOF) planar manipulator and an omnidirectional mobile platform is designed, modeled and analyzed. Then, repetitive motion planning and feedback control for the designed omnidirectional MMRS is studied. Besides, a numerical algorithm is developed and presented to solve the QP and resolve the redundancy of the robotic system. Moreover, computer simulations are comparatively performed on such an omnidirectional MMRS, and simulation results substantiate the effectiveness, accuracy and superiority of the proposed RMPFC scheme.     

An improved trajectory planner for redundant manipulators in constrained workspace

This article studies the trajectory planning of redundant robots performing tasks within an enclosed workspace. Configuration control of kinematically redundant manipulators using the pseudo‐inverse with null‐space projection method is a well‐known scheme. One advantage of this method is that the gradient of an objective function can be included in the homogeneous term to optimize the objective function without affecting the position of the end‐effector. Using different objective functions, this method can achieve redundancy resolution such as obstacle or joint limits avoidance. Along this line of redundancy resolution, a switching objective function is proposed. We modify Liegeois' joint angle availability objective function so that the midpoints of each joint are switched at a series of prespecified key path points for the end‐effector to achieve. These key path points are planned beforehand according to the geometry of the constrained workspace. The trajectory planning problem can then be viewed as a series of proper postures (i.e., midpoints) determination problems at the key path points. The proper postures are determined using a combination of the potential field method and the elastic model method that takes into account joint operating ranges and the motion tendency of the end‐effector. A variable weighting technique to achieve the proper postures effectively is also presented. Simulations of a planar eight‐link robot in a constrained workspace illustrate the effectiveness of the switching objective function with the variable weighting approach in trajectory planning problems. ©1999 John Wiley & Sons, Inc.     

FUNCTIONAL REPRESENTATION AND REASONING FOR REFLECTIVE SYSTEMS

Functional models have been extensively investigated in the context of several problemsolving tasks such as device diagnosis and design. In this paper, we view problem solvers themselves as devices, and use structure-behavior-function models to represent how they work. The model representing the functioning of a problem solver explicitly specifies how the knowledge and reasoning of the problem solver result in the achievement of its goals. Then, we employ these models for performance-driven reflective learning. We view performance-driven learning as the task of redesigning the knowledge and reasoning of the problem solver to improve its performance. We use the model of the problem solver to monitor its reasoning. Assign blame when it fails, and appropriately redesign its knowledge and reasoning. This paper focuses on the model-based redesign of a path planner's task structure. It illustrates the modelbased reflection using examples from an operational system called the Autognostic system.     

Optimal matching by the transiently chaotic neural network

Dynamic programming matching (DPM) is a technique that finds an optimal match between two sequences of feature vectors allowing for stretched and compressed sections of the sequence. The purpose of this study is to formulate the matching problem as an optimization task and carry out this optimization problem by means of a chaotic neural network. The proposed method uses TCNN, a Hopfield neural network with decaying self-feedback, to find the best-matching (i.e., the lowest global distance) path between an input and a template. Experimental results show a very good performance for the proposed algorithm in pattern recognition tasks.     

A self-adaptive multi-engine solver for quantified Boolean formulas

In this paper we study the problem of engineering a robust solver for quantified Boolean formulas (QBFs), i.e., a tool that can efficiently solve formulas across different problem domains without the need for domain-specific tuning. The paper presents two main empirical results along this line of research. Our first result is the development of a multi-engine solver, i.e., a tool that selects among its reasoning engines the one which is more likely to yield optimal results. In particular, we show that syntactic QBF features can be correlated to the performances of existing QBF engines across a variety of domains. We also show how a multi-engine solver can be obtained by carefully picking state-of-the-art QBF solvers as basic engines, and by harnessing inductive reasoning techniques to learn engine-selection policies. Our second result is the improvement of our multi-engine solver with the capability of updating the learned policies when they fail to give good predictions. In this way the solver becomes also self-adaptive, i.e., able to adjust its internal models when the usage scenario changes substantially. The rewarding results obtained in our experiments show that our solver AQME—Adaptive QBF Multi-Engine—can be more robust and efficient than state-of-the-art single-engine solvers, even when it is confronted with previously uncharted formulas and competitors.     

Study and resolution of singularities for a 6-DOF PUMA manipulator

Upon solving the inverse kinematics problem of robot manipulators, the inherent singularity problem should always be considered. When a manipulator is approaching a singular configuration, a certain degree of freedom will be lost such that there are no feasible solutions of the manipulator to move into this singular direction. In this paper, the singularities of a 6-DOF PUMA manipulator are analyzed in detail and all the corresponding singular directions in task space are clearly identified. In order to resolve this singularity problem, an approach denoted Singularity Isolation Plus Compact QP (SICQP) method is proposed. The SICQP method decomposes the work space into achievable and unachievable (i.e., singular) directions. Then, the exactness in the singular directions are released such that extra redundancy is provided to the achievable directions. Finally, the Compact QP method is applied to maintain the exactness in the achievable directions, and to minimize the tracking errors in the singular directions under the condition that feasible joint solutions must be obtained. In the end, some simulation results for PUMA manipulator are given to demonstrate the effectiveness of the SICQP method.     

Time-optimal tool motion planning with tool-tip kinematic constraints for robotic machining of sculptured surfaces

A time-optimal motion planning method for robotic machining of sculptured surfaces is reported in this paper. Compared with the general time-optimal robot motion planning, a surface machining process provides extra constraints such as tool-tip kinematic limits and complexity of the curved tool path that also need to be taken into account. In the proposed method, joint space and tool-tip kinematic constraints are considered. As there are high requirements for tool path following accuracy, an efficient numerical integration method based on the Pontryagin maximum principle is adopted as the solver for the time-optimal tool motion planning problem in robotic machining. Nonetheless, coupled and multi-dimensional constraints make it difficult to solve the problem by numerical integration directly. Therefore, a new method is provided to simplify the constraints in this work. The algorithm is implemented on the ROS (robot operating system) platform. The geometry tool path is generated by the CAM software firstly. And then the whole machine moving process, i.e. the feedrate of machining process, is scheduled by the proposed method. As a case study, a sculptured surface is machined by the developed method with a 6-DOF robot driven by the ROS controller. The experimental results validate the developed algorithm and reveal its advantages over other conventional motion planning algorithms for robotic machining.     

Extending the mathematics in qualitative process theory

Reasoning about physical systems requires the integration of a range of knowledge and reasoning techniques. P. Hayes has named the enterprise of identifying and formalizing the common-sense knowledge people use for this task “naive physics.” Qualitative Process theory by K. Forbus proposes a structure and some of the content of naive theories about dynamics, (i.e., the way things change in a physical situation). Any physical theory, however, rests on an underlying mathematics. QP theory assumes a qualitative mathematics which captures only simple topological relationships between values of continuous parameters. While the results are impressive, this mathematics is unable to support the full range of deduction needed for a complete naive physics reasoner. A more complete naive mathematics must be capable of representing measure information about parameter values as well as shape and strength characterizations of the partial derivatives relating these values. This article proposes a naive mathematics meeting these requirements, and shows that it considerably expands the scope and power of deductions which QP theory can perform.     

Multi-level qualitative reasoning applied to CMOS digital circuits

This paper develops a general framework for efficient problem solving at multiple levels of abstraction in complex systems. The goal is to address two important control issues in the behavior generation process: (i) the selection problem, which deals with the right level of detail to solve a problem; and (ii) the efficiency problem, which deals with information transfer from higher levels of abstraction to focus problem solving at more detailed levels. A problem solver has been developed for CMOS circuit analysis. This problem solver produces solution traces that integrates information from various levels, and uses information derived at more abstract levels to guide problem solving at more detailed levels. The next step is to apply this problem solver to a wide variety of tasks such as integrated circuit design and diagnosis.     

On the computation of linear model predictive control laws

Finite-time optimal control problems with quadratic performance index for linear systems with linear constraints can be transformed into Quadratic Programs (QPs). Model Predictive Control requires the on-line solution of such QPs. This can be obtained by using a QP solver or evaluating the associated explicit solution. The objective of this note is twofold. First, we shed some light on the computational complexity and storage demand of the two approaches when an active set QP solver is used. Second, we show the existence of alternative algorithms with a different tradeoff between memory and computational time. In particular, we present an algorithm which, for a certain class of systems, outperforms standard explicit solvers both in terms of memory and worst case computational time.     

A Survey on Task and Participant Matching in Mobile Crowd Sensing

Mobile crowd sensing is an innovative paradigm which leverages the crowd, i.e., a large group of people with their mobile devices, to sense various information in the physical world. With the help of sensed information, many tasks can be fulfilled in an efficient manner, such as environment monitoring, traffic prediction, and indoor localization. Task and participant matching is an important issue in mobile crowd sensing, because it determines the quality and efficiency of a mobile crowd sensing task. Hence, numerous matching strategies have been proposed in recent research work. This survey aims to provide an up-to-date view on this topic. We propose a research framework for the matching problem in this paper, including participant model, task model, and solution design. The participant model is made up of three kinds of participant characters, i.e., attributes, requirements, and supplements. The task models are separated according to application backgrounds and objective functions. Offline and online solutions in recent literatures are both discussed. Some open issues are introduced, including matching strategy for heterogeneous tasks, context-aware matching, online strategy, and leveraging historical data to finish new tasks.