Web-based Virtual Tour has attractive advantages over traditional 3D rendering approach in that it does not require labor intensive 3D modeling process or high bandwidth for realistic virtual tour yet provides virtual tour with free navigation and immersive experience of walking around through the WWW. In this paper, we focus on presenting a robust image registration technique for a web-based v...

This paper proposes a new generalization of the Voronoi diagram. Suppose that restaurants and bookstores are located in a city, and we want to visit both a restaurant and bookstore and return to our house. To each pair of a restaurant and a bookstore, we can assign a region such that a resident in this region can visit the restaurant and bookstore in a round tour that is shorter than that for a...

Time considerations have been largely ignored in the study of vehicle routing problems with stochastic demands, even though they are crucial in practice. We show that tour duration limits can effectively and efficiently be incorporated in solution approaches that build fixed, or a priori, tours for such problems. We do so by assuming that each tour must be duration-feasible for all demand reali...

This paper describes a radio frequency identification (RFID) and sonar-guided tour guide robot, CATE (Central’s Automated Tour Experience). The portable terminal unit is an embedded system equipped with an RFID reader for localization, and sonar and IR sensors for obstacle detection and avoidance. CATE can guide the visitor through a predefined tour of the building, or create a new route onthe-...

Assistance for the Baha Tourism Village, Mengwi District, Badung Regency aims to ensure that tourism village can develop properly and provide socio-cultural economic benefits local community. The methods used in this assistance are community education methods, training, science technology substitution, participatory decision making processes. Village has resulted increased public awareness of c...

Given a graph ( , ) G N E  , the Covering Salesman Problem (CSP) is to identify the minimum length tour “covering” all the nodes. More specifically, it seeks the minimum length tour visiting a subset of the nodes in N such that each node i not on the tour is within a predetermined distance di of a node on the tour. In this paper, we define and develop a generalized version of the CSP, and refe...

In autumn 1978 the IAEA arranged a Study Tour on Radiation Protection and Waste Management, as a form of technical assistance to developing countries. This tour was organized in collaboration with the Governments of Czechoslovakia, Federal Republic of Germany, France, German Democratic Republic and Hungary, and led through all of these countries. The present review covers only one aspect of thi...

The traveling salesman problem is a problem of finding the shortest tour through given points. In 1959, Beardwood, Halton, and Hammersley studied asymptotic length of the shortest tour through points on Euclidean space. In particular they described the optimal tour length with Euclidean dimension for the case that points are distributed with respect to Lebesgue absolutely continuous measure. In...

Fig. 1 shows one such scene. A group of family accepted a tour. While the robot explained a shop at a stop (Fig. 1-a), a child (not part of the tour) noticed the robot and approached it from its right (Fig. 1-b). Since she remained in front of it, the robot was not able to move to the next location (Fig. 1c). The family briefly watched and then left (Fig. 1-d). Since the new girl did not follow...

The standard courier does the following: every day he receives a fresh list of addresses, from which he computes a TSP tour (only using the addresses he received that day). The lazy courier, being lazy, would like to avoid the work of having to compute a new tour every day. He decides to use all of the addresses in the database to compute a single TSP tour. He will then follow that tour every d...