3D path planning with novel multiple 2D layered approach for complex human-robot interaction

Navigating cluttered indoor environments is a difficult problem in indoor service robotics. The Acroboter concept, a novel approach to indoor locomotion, represents unique opportunity to avoid obstacles in indoor environments by navigating the ceiling plane. This mode of locomotion requires the ability to accurately detect obstacles, and plan 3D trajectories through the environment. This paper presents the development of a resilient object tracking system, as well as a novel approach to generating 3D paths suitable for such robot configurations. Distributed human-machine interfacing allowing simulation previewing of actions is also considered in the developed system architecture.

An oblivious shortest-path routing algorithm for fully connected cubic networks

Fully connected cubic networks (FCCNs) are a class of newly proposed hierarchical interconnection networks for multicomputer systems, which enjoy the strengths of constant node degree and good expandability. The shortest path routing in FCCNs is an open problem. In this paper, we present an oblivious routing algorithm for n-level FCCN with N = 8(n) nodes, and prove that this algorithm creates a shortest path from the source to the destination. At the costs of both an O(N)-parallel-step off-line preprocessing phase and a list of size N stored at each node, the proposed algorithm is carried out at each related node in O(n) time. In some cases the proposed algorithm is superior to the one proposed by Chang and Wang in terms of the length of the routing path. This justifies the utility of our routing strategy. (C) 2006 Elsevier Inc. All rights reserved.

Full interference cancellation for two-path relay cooperative networks

This paper proposes the full interference cancellation (FIC) algorithm to cancel the inter-relay interference (IRI) in the two-path cooperative system. Arising from simultaneous data transmission from the source and relay nodes, IRI may significantly decrease the performance if it is not carefully handled. Compared to the existing partial interference cancellation (PIC) scheme, the FIC approach is more robust yet with less complexity. Numerical results are also given to verify the proposed scheme.

Multistep electrochemical reduction path of clusters [Os3(CO)10(α-diimine)]: comparison of electrochemical and photochemical Os-Os(α-diimine) bond cleavage

Electrochemical reduction of the triangular clusters [Os-3(CO)(10)(alpha-dimine)] (alpha-dimine = 2,2'-bipyridine (bpy), 2,2'-bipyrimidine (bpym)) and [Os-3(CO)(10)(mu-bpym) ReBr(CO)(3)] produces primarily the corresponding radical anions. Their stability is strongly determined by the pi acceptor ability of the reducible alpha-dimine ligand, which decreases in the order mu-bpym > bpym >> bpy. Along this series, increasing delocalisation of the odd electron density in the radical anion over the Os(alpha-dimine) chelate ring causes weakening of the axial (CO)(4)Os-Os(CO)(2)(alpha-dimine) bond and its facile cleavage for alpha-diimine = bpy. In contrast, the cluster radical anion is inherently stable for the bridging bpym ligand, the strongest pi-acceptor in the studied series. In the absence of the partial delocalisation of the unpaired electron over the Re( bpym) chelate bond, the Os-3-core of the radical anion remains intact only at low temperatures. Subsequent one-electron reduction of [Os-3(CO)(10)(bpym)](center dot-) at T = 223 K gives the open-triosmium core (= Os-3*) dianion, [Os-3*(CO)(10)(bpym)](2-). Its oxidation leads to the recovery of parent [Os-3(CO)(10)( bpym)]. At room temperature, [Os-3*( CO)(10)(bpym)](2-) is formed along a two-electron (ECE) reduction path. The chemical step (C) results in the formation of an open- core radical anion that is directly reducible at the cathodic potential of the parent cluster in the second electrochemical (E) step. In weakly coordinating tetrahydrofuran, [Os-3*(CO)(10)( bpym)](2-) rapidly attacks yet non- reduced parent cluster molecules, producing the relatively stable open- core dimer [Os-3*(CO)(10)(bpym)](2)(2-) featuring two open- triangle cluster moieties connected with an ( bpym) Os - Os( bpym) bond. In butyronitrile, [Os-3*( CO)(10)(bpym)](2-) is stabilised by the solvent and the dimer [Os-3*(CO)(10)(bpym)](2)(2-) is then mainly formed by reoxidation of the dianion on reverse potential scan. The more reactive cluster [Os-3(CO)(10)(bpy)] follows the same reduction path, as supported by spectroelectrochemical results and additional valuable evidence obtained from cyclic voltammetric scans. The ultimate process in the reduction mechanism is fragmentation of the cluster core triggered by the reduction of the dimer [Os-3*(CO)(10)(alpha- diimine)](2)(2-). The products formed are [Os-2(CO)(8)](2-) and {Os(CO)(2)(alpha- diimine)}(2). The latter dinuclear fragments constitute a linear polymeric chain [Os( CO)(2)(alpha-dimine)] n that is further reducible at the alpha-dimine ligands. For alpha-dimine = bpy, the charged polymer is capable of reducing carbon dioxide. The electrochemical opening of the triosmium core in the [Os-3( CO)(10)(alpha-dimine)] clusters exhibits several common features with their photochemistry. The same Os-alpha-dimine bond dissociates in both cases but the intimate mechanisms are different.

Interference cancellation in two-path successive relay system with network coding

This paper proposes a novel interference cancellation algorithm for the two-path successive relay system using network coding. The two-path successive relay scheme was proposed recently to achieve full date rate transmission with half-duplex relays. Due to the simultaneous data transmission at the relay and source nodes, the two-path relay suffers from the so-called inter-relay interference (IRI) which may significantly degrade the system performance. In this paper, we propose to use the network coding to remove the IRI such that the interference is first encoded with the network coding at the relay nodes and later removed at the destination. The network coding has low complexity and can well suppress the IRI. Numerical simulations show that the proposed algorithm has better performance than existing approaches.

L1 transfer in the acquisition of manner and path in Spanish by native speakers of English

In this article the authors argue that L1 transfer from English is not only important in the early stages of L2 acquisition of Spanish, but remains influential in later stages if there is not enough positive evidence for the learners to progress in their development (Lefebvre, White, & Jourdan, 2006). The findings are based on analyses of path and manner of movement in stories told by British students of Spanish (N = 68) of three different proficiency levels. Verbs that conflate motion and path, on the one hand, are mastered early, possibly because the existence of Latinate path verbs, such as enter and ascend in English, facilitate their early acquisition by British learners of Spanish. Contrary to the findings of Cadierno (2004) and Cadierno and Ruiz (2006), the encoding of manner, in particular in boundary crossing contexts, seems to pose enormous difficulties, even among students who had been abroad on a placement in a Spanish-speaking country prior to the data collection. An analysis of the frequency of manner verbs in Spanish corpora shows that one of the key reasons why students struggle with manner is that manner verbs are so infrequent in Spanish. The authors claim that scarce positive evidence in the language exposed to and little or no negative evidence are responsible for the long-lasting effect of transfer on the expression of manner.

Path planning of robots in noisy workspaces using learning automata

The problem of a manipulator operating in a noisy workspace and required to move from an initial fixed position P0 to a final position Pf is considered. However, Pf is corrupted by noise, giving rise to Pˆf, which may be obtained by sensors. The use of learning automata is proposed to tackle this problem. An automaton is placed at each joint of the manipulator which moves according to the action chosen by the automaton (forward, backward, stationary) at each instant. The simultaneous reward or penalty of the automata enables avoiding any inverse kinematics computations that would be necessary if the distance of each joint from the final position had to be calculated. Three variable-structure learning algorithms are used, i.e., the discretized linear reward-penalty (DLR-P, the linear reward-penalty (LR-P ) and a nonlinear scheme. Each algorithm is separately tested with two (forward, backward) and three forward, backward, stationary) actions.

The investment development path in a globalised world: implications for Eastern Europe

This article summarises recent revisions to the investment development path (IDP) as postulated by Narula and Dunning (2010). The IDP provides a framework to understand the dynamic interaction between foreign direct investment (FDI) and economic development. The revisions take into account some recent changes in the global economic environment. This paper argues that studies based on the IDP should adopt a broader perspective, encompassing the idiosyncratic economic structure of countries as well as the heterogeneous nature of FDI. It is critical to understand the complex forces and interactions that determine the turning points in a country’s IDP, and to more explicitly acknowledge the role of historical, social and political circumstances in hindering or promoting FDI. We discuss some of the implications for Eastern European countries and provide some guidelines for future research.