Effects of turning gait parameters on energy consumption and stability of a six-legged walking robot

Minimization of energy consumption plays a key role in the locomotion of a multi-legged robot used for various purposes. Turning gaits are the most general and important factors for omni-directional walking of a six-legged robot. This paper presents an analysis on energy consumption of a six-legged robot during its turning motion over a flat terrain. An energy consumption model is developed for statically stable wave gaits in order to minimize dissipating energy for optimal feet forces distributions. The effects of gait parameters, namely angular velocity, angular stroke and duty factors are studied on energy consumption, as the six-legged robot walks along a circular path of constant radius with wave gait. The variations of average power consumption and energy consumption per unit weight per unit traveled length with the angular velocity and angular stroke are compared for the turning gaits of a robot with four different duty factors. Computer simulations show that wave gait with a low duty factor is more energy-efficient compared to that with a high duty factor at the highest possible angular velocity. A stability analysis based on normalized energy stability margin is performed for turning motion of the robot with four duty factors for different angular strokes.     

A global localization approach based on Line-segment Relation Matching technique

This paper presents a novel global localization approach for mobile robots by exploring line-segment features in any structured environment. The main contribution of this paper is an effective data association approach, the Line-segment Relation Matching (LRM) technique, which is based on a generation and exploration of an Interpretation Tree (IT). A new representation of geometric patterns of line-segments is proposed for the first time, which is called as Relation Table. It contains relative geometric positions of every line-segment respect to the others (or itself) in a coordinate-frame independent sense. Based on that, a Relation-Table-constraint is applied to minimize the searching space of IT therefore greatly reducing the processing time of LRM. The Least Square algorithm is further applied to estimate the robot pose using matched line-segment pairs. Then a global localization system can be realized based on our LRM technique integrated with a hypothesis tracking framework which is able to handle pose ambiguity. Sufficient simulations were specially designed and carried out indicating both pluses and minuses of our system compared with former methods. We also presented the practical experiments illustrating that our approach has a high robustness against uncertainties from sensor occlusions and extraneous observation in a highly dynamic environment. Additionally our system was demonstrated to easily deal with initialization and have the ability of quick recovery from a localization failure.     

Iterative learning of grasp adaptation through human corrections

In the context of object interaction and manipulation, one characteristic of a robust grasp is its ability to comply with external perturbations applied to the grasped object while still maintaining the grasp. In this work, we introduce an approach for grasp adaptation which learns a statistical model to adapt hand posture solely based on the perceived contact between the object and fingers. Using a multi-step learning procedure, the model dataset is built by first demonstrating an initial hand posture, which is then physically corrected by a human teacher pressing on the fingertips, exploiting compliance in the robot hand. The learner then replays the resulting sequence of hand postures, to generate a dataset of posture-contact pairs that are not influenced by the touch of the teacher. A key feature of this work is that the learned model may be further refined by repeating the correction-replay steps. Alternatively, the model may be reused in the development of new models, characterized by the contact signatures of a different object. Our approach is empirically validated on the iCub robot. We demonstrate grasp adaptation in response to changes in contact, and show successful model reuse and improved adaptation with additional rounds of model refinement.     

Virtio network paravirtualization driver: Implementation and performance of a de-facto standard

One of the techniques used to improve I/O performance of virtual machines is paravirtualization. Paravirtualized devices are intended to reduce the performance overhead on full virtualization where all hardware devices are emulated. The interface of a paravirtualized device is not identical to that of the underlying hardware. The OS of the virtual guest machine must be ported in order to use a paravirtualized device. In this paper, the network virtualization done by the Kernel-based Virtual Machine (KVM) is described. The KVM model is different from other Virtual Machines Monitors (VMMs) because the KVM is a Linux kernel model and it depends on hardware support. In this work, the overhead of using such virtual networks is been measured. A paravirtualized model by using the virtio [38] network driver is described, and some performance results of web benchmark on the two models are presented.     

A framework for joint community detection across multiple related networks

Community detection in networks is an active area of research with many practical applications. However, most of the early work in this area has focused on partitioning a single network or a bipartite graph into clusters/communities. With the rapid proliferation of online social media, it has become increasingly common for web users to have noticeable presence across multiple web sites. This raises the question whether it is possible to combine information from several networks to improve community detection. In this paper, we present a framework that identifies communities simultaneously across different networks and learns the correspondences between them. The framework is applicable to networks generated from multiple web sites as well as to those derived from heterogeneous nodes of the same web site. It also allows the incorporation of prior information about the potential relationships between the communities in different networks. Extensive experiments have been performed on both synthetic and real-life data sets to evaluate the effectiveness of our framework. Our results show superior performance of simultaneous community detection over three alternative methods, including normalized cut and matrix factorization on a single network or a bipartite graph.     

Topic model validation

In this paper the problem of performing external validation of the semantic coherence of topic models is considered. The Fowlkes-Mallows index, a known clustering validation metric, is generalized for the case of overlapping partitions and multi-labeled collections, thus making it suitable for validating topic modeling algorithms. In addition, we propose new probabilistic metrics inspired by the concepts of recall and precision. The proposed metrics also have clear probabilistic interpretations and can be applied to validate and compare other soft and overlapping clustering algorithms. The approach is exemplified by using the Reuters-21578 multi-labeled collection to validate LDA models, then using Monte Carlo simulations to show the convergence to the correct results. Additional statistical evidence is provided to better understand the relation of the metrics presented.     

Self-emergence of a common lexicon by evolution in teams of autonomous agents

In multi-agent systems, the study of language and communication is an active field of research. In this paper we present the application of evolutionary strategies to the self-emergence of a common lexicon in a population of agents. By modeling the vocabulary or lexicon of each agent as an association matrix or look-up table that maps the meanings (i.e. the objects encountered by the agents or the states of the environment itself) into symbols or signals we check whether it is possible for the population to converge in an autonomous, decentralized way to a common lexicon, so that the communication efficiency of the entire population is optimal. We have conducted several experiments aimed at testing whether it is possible to converge with evolutionary strategies to an optimal Saussurean communication system. We have organized our experiments alongside two main lines: first, we have investigated the effect of the population size on the convergence results. Second, and foremost, we have also investigated the effect of the lexicon size on the convergence results. To analyze the convergence of the population of agents we have defined the population's consensus when all the agents (i.e. 100% of the population) share the same association matrix or lexicon. As a general conclusion we have shown that evolutionary strategies are powerful enough optimizers to guarantee the convergence to lexicon consensus in a population of autonomous agents.     

Finite-horizon neuro-optimal tracking control for a class of discrete-time nonlinear systems using adaptive dynamic programming approach

In this paper, a finite-horizon neuro-optimal tracking control strategy for a class of discrete-time nonlinear systems is proposed. Through system transformation, the optimal tracking problem is converted into designing a finite-horizon optimal regulator for the tracking error dynamics. Then, with convergence analysis in terms of cost function and control law, the iterative adaptive dynamic programming (ADP) algorithm via heuristic dynamic programming (HDP) technique is introduced to obtain the finite-horizon optimal tracking controller which makes the cost function close to its optimal value within an ?-error bound. Three neural networks are used as parametric structures to implement the algorithm, which aims at approximating the cost function, the control law, and the error dynamics, respectively. Two simulation examples are included to complement the theoretical discussions.     

Adaptive fuzzy backstepping output feedback control for strict feedback nonlinear systems with unknown sign of high-frequency gain

In this paper, an adaptive fuzzy robust output feedback control approach is proposed for a class of SISO nonlinear strict-feedback systems with unknown sign of high-frequency gain and the unmeasured states. The nonlinear systems addressed in this paper are assumed to possess the unmodeled dynamics, dynamical disturbances and unknown nonlinear functions, where the unknown nonlinear functions are not linearly parameterized, and no prior knowledge of their bounds is available. In the recursive designing, fuzzy logic systems are used to approximate the unknown nonlinear functions, K-filters are designed to estimate the unmeasured states, and a dynamical signal and Nussbaum gain functions are introduced to handle the unmodeled dynamics and the unknown sign of the high-frequency gain, respectively. Based on Lyapunov function method, a stable adaptive fuzzy output feedback control scheme is developed. It is mathematically proved that the proposed adaptive fuzzy control approach can guarantee that all the signals of the closed-loop system are uniformly ultimately bounded, the output converges to a small neighborhood of the origin. The effectiveness of the proposed approach is illustrated by the simulation examples.