This paper presents a novel analytic method to uniquely solve inverse kinematics of 7 degrees-of-freedom manipulators while avoiding joint limits and singularities. Two auxiliary parameters are introduced to deal with the self-motion manifolds: the global configuration (GC), which specifies the branch of inverse kinematics solutions; and the arm angle (ψ) that parametrizes the elbow redundancy within the specified branch. The relations between the joint angles and the arm angle are derived, in order to map the joint limits and singularities to arm angle values. Then, intervals of feasible arm angles for the specified target pose and global configuration are determined, taking joint limits and singularities into account. A simple metric is proposed to compute the elbow position according to the feasible intervals. When the arm angle is determined, the joint angles can be uniquely calculated from the position-based inverse kinematics algorithm. The presented method does not exhibit the disadvantages inherent to the use of the Jacobian matrix and can be implemented in real-time control systems. This novel algorithm is the first position-based inverse kinematics algorithm to solve both global and local manifolds, using a redundancy resolution strategy to avoid singularities and joint limits.This work was partially supported by the NETT Project [FP7-PEOPLE-2011-ITN-289146]; and Foundation for Science and Technology, Portugal [grant number SFRH/BD/86499/2012].info:eu-repo/semantics/publishedVersio
"Available online 3 March 2016"We study the conditions for the formation of multiple regions of high activity or “bumps” in a one-dimensional, homogeneous neural field with localized inputs. Stable multi-bump solutions of the integro-differential equation have been proposed as a model of a neural population representation of remembered external stimuli. We apply a class of oscillatory coupling functions and first derive criteria to the input width and distance, which relate to the synaptic couplings that guarantee the existence and stability of one and two regions of high activity. These input-induced patterns are attracted by the corresponding stable one-bump and two-bump solutions when the input is removed. We then extend our analytical and numerical investigation to NN-bump solutions showing that the constraints on the input shape derived for the two-bump case can be exploited to generate a memory of N>2N>2 localized inputs. We discuss the pattern formation process when either the conditions on the input shape are violated or when the spatial ranges of the excitatory and inhibitory connections are changed. An important aspect for applications is that the theoretical findings allow us to determine for a given coupling function the maximum number of localized inputs that can be stored in a given finite interval.The work received financial support from FCT through a PhD grant (SFRH/BD/41179/2007) and from the EU-FP7 ITN project NETT: Neural Engineering Transformative Technologies (nr. 289146)
We consider feed-forward and auto-regulation feed-forward neural (weighted) coupled cell networks. In feed-forward neural networks, cells are arranged in layers such that the cells of the first layer have empty input set and cells of each other layer receive only inputs from cells of the previous layer. An auto-regulation feed-forward neural coupled cell network is a feed-forward neural network where additionally some cells of the first layer have auto-regulation, that is, they have a self-loop. Given a network structure, a robust pattern of synchrony is a space defined in terms of equalities of cell coordinates that is flow-invariant for any coupled cell system (with additive input structure) associated with the network. In this paper, we describe the robust patterns of synchrony for feed-forward and auto-regulation feed-forward neural networks. Regarding feed-forward neural networks, we show that only cells in the same layer can synchronize. On the other hand, in the presence of auto-regulation, we prove that cells in different layers can synchronize in a robust way and we give a characterization of the possible patterns of synchrony that can occur for auto-regulation feed-forward neural networks.
4 May 2020 in IEEE Transactions on Cognitive and Developmental Systems
Many of our sequential activities require that behaviors must be both precisely timed and put in the proper order. This paper presents a neuro-computational model based on the theoretical framework of Dynamic Neural Fields that supports the rapid learning and flexible adaptation of coupled order-timing representations of sequential events. A key assumption is that elapsed time is encoded in the monotonic buildup of self-stabilized neural population activity representing event memory. A stable activation gradient over subpopulations carries the information of an entire sequence. With robotics applications in mind, we test the model in simulations of a learning by observation paradigm, in which the cognitive agent first memorizes the order and relative timing of observed events and, subsequently, recalls the information from memory taking potential speed constraints into account. Model robustness is tested by systematically varying sequence complexity along the temporal and the ordinal dimension. Furthermore, an adaptation rule is proposed that allows the agent to adjust in a single trial a learned timing pattern to a changing temporal context. The simulation results are discussed with respect to our goal to endow autonomous robots with the capacity to efficiently learn complex sequences with time constraints, supporting more natural human-robot interactions.