Reach & grasp therapy: Design and control of a 9-DOF robotic neuro-rehabilitation system

This paper presents the Gentle/G integrated system for reach & grasp therapy retraining following brain injury. The design, control and integration of an experimental grasp assistance unit is described for use in robot assisted stroke rehabilitation. The grasp assist unit is intended to work with the hardware and software of the Gentle/S robot although the hardware could be adapted to other rehabilitation applications. When used with the Gentle/S robot a total of 6 active and 3 passive degrees of freedom are available to provide active, active assist or passive grasp retraining in combination with reaching movements in a reach-grasp-transfer-release sequence.

Perceptual cues for orientation in a two finger haptic grasp task

Single point interaction haptic devices do not provide the natural grasp and manipulations found in the real world, as afforded by multi-fingered haptics. The present study investigates a two-fingered grasp manipulation involving rotation with and without force feedback. There were three visual cue conditions: monocular, binocular and projective lighting. Performance metrics of time and positional accuracy were assessed. The results indicate that adding haptics to an object manipulation task increases the positional accuracy but slightly increases the overall time taken.

Reach and grasp therapy: effects of the Gentle/G System assessing sub-acute stroke whole-arm rehabilitation

This paper reports preliminary results of a reach and grasp study of robot mediated neurorehabilitation. These results are presented on a case-by-case basis and give a good indication of a positive effect of robot mediated therapy. The study investigated both reach and grasp assistance and although it is not possible to attribute the response to the benefits of providing assistance of both modalities the study is a good indicator that this strategy should be pursued. The paper also reports on the benefits of motivational queues such as exercise scores and on subject attitudes to the robot mediated therapy.

Goal-refinement appraisal of soft projects (GRASP)

Industrial projects are often complex and burdened with time pressures and a lack of information. The term 'soft-project' used here stands for projects where the ‘what’ and/or the ‘how’ is uncertain, which is often the experience in projects involving software intensive systems developments. This thesis intertwines the disciplines of project management and requirements engineering in a goal-oriented application of the maxim ‘keep all objectives satisfied’. It thus proposes a method for appraising projects. In this method, a goal-oriented analysis establishes a framework with which expert judgements are collected so as to construct a confidence profile in regard to the feasibility and adequacy of the project's planned outputs. It is hoped that this appraisal method will contribute to the activities of project ‘shaping’ and aligning stakeholders’ expectations whilst helping project managers appreciate what parts of their project can be progressed and what parts should be held pending further analysis. This thesis offers the following original contribution: an appreciation of appraisal in the project context; a goal-oriented confidence profiling technique; and: a technique to produce goal-refinement diagrams – referred to as Goal Sketching. Collectively these amount to a method for the ‘Goal Refinement Appraisal of Soft-Projects’ (GRASP). The validity of the GRASP method is shown for two projects. In the first it is used for shaping a business investigation project. This is done in real-time in the project. The second case is a retrospective study of an enterprise IT project. This case tests the effectiveness of forecasting project difficulty from an initial confidence profile.

Prosthesis grasp reflex via peripheral nerve control: an in vitro study

Here we present an economical and versatile platform for developing motor control and sensory feedback of a prosthetic hand via in vitro mammalian peripheral nerve activity. In this study, closed-loop control of the grasp function of the prosthetic hand was achieved by stimulation of a peripheral nerve preparation in response to slip sensor data from a robotic hand, forming a rudimentary reflex action. The single degree of freedom grasp was triggered by single unit activity from motor and sensory fibers as a result of stimulation. The work presented here provides a novel, reproducible, economic, and robust platform for experimenting with neural control of prosthetic devices before attempting in vivo implementation.

To eat or not to eat? Kinematics and muscle activity of reach-to-grasp movements are influenced by the action goal, but observers do not detect these differences

Recent evidence suggests that the mirror neuron system responds to the goals of actions, even when the end of the movement is hidden from view. To investigate whether this predictive ability might be based on the detection of early differences between actions with different outcomes, we used electromyography (EMG) and motion tracking to assess whether two actions with different goals (grasp to eat and grasp to place) differed from each other in their initial reaching phases. In a second experiment, we then tested whether observers could detect early differences and predict the outcome of these movements, based on seeing only part of the actions. Experiment 1 revealed early kinematic differences between the two movements, with grasp-to-eat movements characterised by an earlier peak acceleration, and different grasp position, compared to grasp-to-place movements. There were also significant differences in forearm muscle activity in the reaching phase of the two actions. The behavioural data arising from Experiments 2a and 2b indicated that observers are not able to predict whether an object is going to be brought to the mouth or placed until after the grasp has been completed. This suggests that the early kinematic differences are either not visible to observers, or that they are not used to predict the end-goals of actions. These data are discussed in the context of the mirror neuron system

Evaluation of reach and grasp robot-assisted therapy suggests similar functional recovery patterns on proximal and distal arm segments in sub-acute hemiplegia

This paper provides some additional evidence in support of the hypothesis that robot therapies are clinically beneficial in neurorehabilitation. Although only 4 subjects were included in the study, the design of the intervention and the measures were done so as to minimise bias. The results are presented as single case studies, and can only be interpreted as such due to the study size. The intensity of intervention was 16 hours and the therapy philosophy (based on Carr and Shepherd) was that coordinated movements are preferable to joint based therapies, and that coordinating distal movements (in this case grasps) helps not only to recover function in these areas, but has greater value since the results are immediately transferable to daily skills such as reach and grasp movements.

Investigation of a new GRASP-based clustering algorithm applied to biological data

A large amount of biological data has been produced in the last years. Important knowledge can be extracted from these data by the use of data analysis techniques. Clustering plays an important role in data analysis, by organizing similar objects from a dataset into meaningful groups. Several clustering algorithms have been proposed in the literature. However, each algorithm has its bias, being more adequate for particular datasets. This paper presents a mathematical formulation to support the creation of consistent clusters for biological data. Moreover. it shows a clustering algorithm to solve this formulation that uses GRASP (Greedy Randomized Adaptive Search Procedure). We compared the proposed algorithm with three known other algorithms. The proposed algorithm presented the best clustering results confirmed statistically. (C) 2009 Elsevier Ltd. All rights reserved.

GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem

This paper addresses the independent multi-plant, multi-period, and multi-item capacitated lot sizing problem where transfers between the plants are allowed. This is an NP-hard combinatorial optimization problem and few solution methods have been proposed to solve it. We develop a GRASP (Greedy Randomized Adaptive Search Procedure) heuristic as well as a path-relinking intensification procedure to find cost-effective solutions for this problem. In addition, the proposed heuristics is used to solve some instances of the capacitated lot sizing problem with parallel machines. The results of the computational tests show that the proposed heuristics outperform other heuristics previously described in the literature. The results are confirmed by statistical tests. (C) 2009 Elsevier B.V. All rights reserved.

Continuous GRASP with a local active-set method for bound-constrained global optimization

Global optimization seeks a minimum or maximum of a multimodal function over a discrete or continuous domain. In this paper, we propose a hybrid heuristic-based on the CGRASP and GENCAN methods-for finding approximate solutions for continuous global optimization problems subject to box constraints. Experimental results illustrate the relative effectiveness of CGRASP-GENCAN on a set of benchmark multimodal test functions.

Algoritmo Q-learning como estratégia de exploração e/ou explotação para metaheurísticas GRASP e algoritmo genético

Techniques of optimization known as metaheuristics have achieved success in the resolution of many problems classified as NP-Hard. These methods use non deterministic approaches that reach very good solutions which, however, don t guarantee the determination of the global optimum. Beyond the inherent difficulties related to the complexity that characterizes the optimization problems, the metaheuristics still face the dilemma of xploration/exploitation, which consists of choosing between a greedy search and a wider exploration of the solution space. A way to guide such algorithms during the searching of better solutions is supplying them with more knowledge of the problem through the use of a intelligent agent, able to recognize promising regions and also identify when they should diversify the direction of the search. This way, this work proposes the use of Reinforcement Learning technique - Q-learning Algorithm - as exploration/exploitation strategy for the metaheuristics GRASP (Greedy Randomized Adaptive Search Procedure) and Genetic Algorithm. The GRASP metaheuristic uses Q-learning instead of the traditional greedy-random algorithm in the construction phase. This replacement has the purpose of improving the quality of the initial solutions that are used in the local search phase of the GRASP, and also provides for the metaheuristic an adaptive memory mechanism that allows the reuse of good previous decisions and also avoids the repetition of bad decisions. In the Genetic Algorithm, the Q-learning algorithm was used to generate an initial population of high fitness, and after a determined number of generations, where the rate of diversity of the population is less than a certain limit L, it also was applied to supply one of the parents to be used in the genetic crossover operator. Another significant change in the hybrid genetic algorithm is the proposal of a mutually interactive cooperation process between the genetic operators and the Q-learning algorithm. In this interactive/cooperative process, the Q-learning algorithm receives an additional update in the matrix of Q-values based on the current best solution of the Genetic Algorithm. The computational experiments presented in this thesis compares the results obtained with the implementation of traditional versions of GRASP metaheuristic and Genetic Algorithm, with those obtained using the proposed hybrid methods. Both algorithms had been applied successfully to the symmetrical Traveling Salesman Problem, which was modeled as a Markov decision process

Uma implementação paralela híbrida para o problema do caixeiro viajante usando algoritmos genéticos, GRASP e aprendizagem por reforço

The metaheuristics techiniques are known to solve optimization problems classified as NP-complete and are successful in obtaining good quality solutions. They use non-deterministic approaches to generate solutions that are close to the optimal, without the guarantee of finding the global optimum. Motivated by the difficulties in the resolution of these problems, this work proposes the development of parallel hybrid methods using the reinforcement learning, the metaheuristics GRASP and Genetic Algorithms. With the use of these techniques, we aim to contribute to improved efficiency in obtaining efficient solutions. In this case, instead of using the Q-learning algorithm by reinforcement learning, just as a technique for generating the initial solutions of metaheuristics, we use it in a cooperative and competitive approach with the Genetic Algorithm and GRASP, in an parallel implementation. In this context, was possible to verify that the implementations in this study showed satisfactory results, in both strategies, that is, in cooperation and competition between them and the cooperation and competition between groups. In some instances were found the global optimum, in others theses implementations reach close to it. In this sense was an analyze of the performance for this proposed approach was done and it shows a good performance on the requeriments that prove the efficiency and speedup (gain in speed with the parallel processing) of the implementations performed

GRASP with evolutionary path-relinking for the capacitated arc routing problem

The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours servicing a subset of required edges under vehicle capacity constraints. There are numerous applications for the CARP, such as street sweeping, garbage collection, mail delivery, school bus routing, and meter reading. A Greedy Randomized Adaptive Search Procedure (GRASP) with Path-Relinking (PR) is proposed and compared with other successful CARP metaheuristics. Some features of this GRASP with PR are (i) reactive parameter tuning, where the parameter value is stochastically selected biased in favor of those values which historically produced the best solutions in average; (ii) a statistical filter, which discard initial solutions if they are unlikely to improve the incumbent best solution; (iii) infeasible local search, where high-quality solutions, though infeasible, are used to explore the feasible/infeasible boundaries of the solution space; (iv) evolutionary PR, a recent trend where the pool of elite solutions is progressively improved by successive relinking of pairs of elite solutions. Computational tests were conducted using a set of 81 instances, and results reveal that the GRASP is very competitive, achieving the best overall deviation from lower bounds and the highest number of best solutions found. © 2011 Elsevier Ltd. All rights reserved.

Domain reduction using GRASP construction phase for transmission expansion planning problem

This paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed to reduce the domain of the integer variables of the transportation model of the transmission expansion planning (TM-TEP) problem. This problem is a MILP and very difficult to solve specially for large scale systems. The branch and bound (BB) algorithm is used to solve the problem in both full and the reduced search space. The proposed method might be useful to reduce the search space of those kinds of MILP problems that a fast heuristic algorithm is available for finding local optimal solutions. The obtained results using some real test systems show the efficiency of the proposed method. © 2012 Springer-Verlag.