and the destination points are in different maps. For instance, bus-stop T3 can be reached from C1 by highway line H2 (or H1) to C3 and then by bus trip R1: S 22 (C1H2) ∧ S 34 (C3H2) ∧ T 22 (C3R1) ∧ T 23 (T3R1). Additional types of connections can be defined to express situations involving routes from a station to another. In procedural terms the previous definitions reduce to a search for inte...

In this work, three experiments are reported that studied the use and interaction of navigation strategies both during the learning of a virtual environment and during subsequent route planning tasks. Special interest concerned the role of regions within the environments. Results from Experiment 1 suggest that the regions are perceived and encoded in spatial memory very early during the process...

Route planning in realistic terrains is a critical task for many autonomous agents such as mobile robots, autonomous vehicles or Computer Generated Forces. The route planning problem is often formulated as one of finding a minimum-cost route between two locations in a digitised map which represents a complex terrain of variable altitude, where the cost of a route is an indication of its quality...

Pedestrian routing has its specific set of challenges, which are often neglected by state-of-theart route planners. For instance, the lack of detailed sidewalk data and the inability to traverse plazas and parks in a natural way often leads to unappealing and suboptimal routes. In this work, we first propose to augment the network by generating sidewalks based on the street geometry and adding ...

Medical services are usually provided in hospitals; however, in developing country, some rural residences have fewer opportunities to access in healthcare services due to the limitation of transportation communication. Therefore, in Thailand, there are charitable organizations operating to provide medical treatments to these people by shifting the medical services to operation sites; this is co...

We present new complexity results and efficient algorithms for optimal route planning in the presence of uncertainty. We employ a decision theoretic framework for defining the optimal route: for a given source S and destination T in the graph, we seek an ST -path of lowest expected cost where the edge travel times are random variables and the cost is a nonlinear function of total travel time. A...

To expand the operative area for surveillance UAV, we propose the use of a relay UAV. The relay UAV is used as an intermediary node in a communication network: the surveillance UAV transmits data to the relay UAV, which sends it back to a ground station. In this exploratory report, we calculate the route for a relay UAV, to ensure communication at certain time points, given the route of the sur...

Prior research on route descriptions does not reveal much about the relationship between mentally planning and describing routes, and the routes chosen when actually travelling. This paper addresses route choice in a familiar urban environment under three different conditions: walking the route, planning and describing the route for oneself, and planning and describing the route for an addresse...

This research presents a collaborative evolutionary planning framework for large scale grid exploration and planning problems. It caters for both dynamic and unknown environments using evolutionary techniques. In addition, we integrate the exploration and planning process in a unified framework using multi agent system. As a proof of success, we have developed extensive simulations with realist...

In this paper we evaluate the effectiveness of agent-based aiding in support of a time-critical team-planning task for teams of both humans and heterogeneous software agents. The team task consists of human subjects playing the role of military commanders and cooperatively planning to move their respective units to a common rendezvous point, given time and resource constraints. The objective of...