Use of Exocentric and Egocentric Representations in the Concurrent Planning of Sequential Saccades

The concurrent planning of sequential saccades offers a simple model to study the nature of visuomotor transformations since the second saccade vector needs to be remapped to foveate the second target following the first saccade. Remapping is thought to occur through egocentric mechanisms involving an efference copy of the first saccade that is available around the time of its onset. In contrast, an exocentric representation of the second target relative to the first target, if available, can be used to directly code the second saccade vector. While human volunteers performed a modified double-step task, we examined the role of exocentric encoding in concurrent saccade planning by shifting the first target location well before the efference copy could be used by the oculomotor system. The impact of the first target shift on concurrent processing was tested by examining the end-points of second saccades following a shift of the second target during the first saccade. The frequency of second saccades to the old versus new location of the second target, as well as the propagation of first saccade localization errors, both indices of concurrent processing, were found to be significantly reduced in trials with the first target shift compared to those without it. A similar decrease in concurrent processing was obtained when we shifted the first target but kept constant the second saccade vector. Overall, these results suggest that the brain can use relatively stable visual landmarks, independent of efference copy-based egocentric mechanisms, for concurrent planning of sequential saccades.

Smooth Path Planning for Passages with Heading and Curvature Discontinuities

The problem of continuous curvature path planning for passages is considered. This problem arises when an autonomous vehicle traverses between prescribed boundaries such as corridors, tunnels, channels, etc. Passage boundaries with curvature and heading discontinuities pose challenges for generating smooth paths passing through them. Continuous curvature half-S shaped paths derived from the Four Parameter Logistic Curve family are proposed as a prospective path planning solution. Analytic conditions are derived for generating continuous curvature paths confined within the passage boundaries. Zero end curvature highlights the scalability of the proposed solution and its compatibility with other path planners in terms of larger path planning domains. Various scenarios with curvature and heading discontinuities are considered presenting viability of the proposed solution.

Multi-scale vulnerability assessment for adaptation planning

Vulnerability of communities and natural ecosystems, to potential impacts of climate change in developing countries like India, and the need for adaptation are rapidly emerging as central issues in the debate around policy responses to climate change. The present study presents an approach to identify and prioritize the most vulnerable districts, villages and households in Karnataka State, through a multi-scale assessment of inherent vulnerability to current climate variability. It also identifies the drivers of inherent vulnerability, thereby providing a tool for developing and mainstreaming adaptation strategies, in ongoing developmental or dedicated adaptation programmes. The multi-scale assessment was made for all 30 districts at the state level in Karnataka, about 1220 villages in Chikballapur district, and at the household level for two villages - Gundlapalli and Saddapalli - in Bagepalli taluk of Chikballapur district. At the district, village and household levels, low levels of education and skills are the dominant factors contributing to vulnerability. At the village and household level, the lack of income diversification and livelihood support institutions are key drivers of vulnerability. The approach of multi-scale vulnerability assessment facilitates identification and prioritization of the drivers of vulnerability at different scales, to focus adaptation interventions to address these drivers.

Simulation-based optimal sensor scheduling with application to observer trajectory planning

The sensor scheduling problem can be formulated as a controlled hidden Markov model and this paper solves the problem when the state, observation and action spaces are continuous. This general case is important as it is the natural framework for many applications. The aim is to minimise the variance of the estimation error of the hidden state w.r.t. the action sequence. We present a novel simulation-based method that uses a stochastic gradient algorithm to find optimal actions. © 2007 Elsevier Ltd. All rights reserved.