Following a familiar route and finding a novel route in a familiar environment depend on different cognitive processes and representations. A recent study by Hartley et al. begins to identity the neural basis of route following and wayfinding in humans. Their study also raises important questions about the functions of the hippocampus.

Following on from our work concerning travellers’ preferences in public transportation networks (Wu and Hartley, 2004), we introduce the concept of stochasticity to our algorithms. Stochasticity greatly increases the complexity of the route finding problem, so greater algorithmic efficiency becomes imperative. Public transportation networks (buses, trains) have two important features: edges can...

This article presents an investigation of the relationship between lesioning and neuroimaging methods of assessing functional specialisation, using synthetic brain imaging (SBI) and lesioning of a connectionist network of past-tense formation. The model comprised two processing 'routes': one was a direct route between layers of input and output units, while the other, indirect, route featured a...

In traditional traffic assignment procedure, each traffic analysis zone is represented by one point in its geometric center which is connected to the network by several connectors. Results of studies show that different connector patterns would result up to 10% change in estimated volume and up to 20% change in total travel time. Also the different patterns of connectors can change the priority...

Clustering is an important technique in mobile ad hoc networks to provide a framework for management and reduce the overhead of route acquisition. Many clustering techniques had been proposed in the literature, but few of them had considered the status of network from the aspect of stability. In this paper, a stability-based clustering (SBC) technique is proposed. SBC only constructs stable eno...

There is a vast amount of researched literature available on Route Finding and Link Establishment in MANET protocols based on various concepts such as “pro-active”, “reactive”, “power awareness”, “cross-layering” etc. Most of these techniques are rather restrictive, taking into account a few of the several aspects that go into effective route establishment. When we look at practical implementat...

Given an orthogonal polygon P with n vertices, the goal of the watchman route problem is finding a path S of the minimum length in P such that every point of the polygon P is visible from at least one of the point of S. In the other words, in the watchman route problem we must compute a shortest watchman route inside a simple polygon of n vertices such that all the points interior to the polygo...

Many routing algorithms, proposed for ad-hoc wireless networks, are based on source routing scheme. When a route is broken in source routing, route recovery and maintenance procedures are executed. However, these procedures consume many resources. To minimize route breaking, it’s important to find a route that endures longer time. Shortest path route has short lifetime especially in highly dens...