• International Journal of Computer Science & Network Security
• /
• v.24 no.1
• /
• pp.45-51
• /
• 2024

The subject of navigation has drawn a large interest in the last few years. The navigation within a city is to find the path between two points, source location and destination location. In many cities, solving the routing problem is very essential as to find the route between different locations (starting location (source) and an ending location (destination)) in a fast and efficient way. This paper considers streets with diagonal streets. Such streets pose a problem in determining the directions of the route to be followed. The paper presents a solution for the path planning using the reconfigurable mesh (R-Mesh). R-Mesh is a parallel platform that has very fast solutions to many problems and can be deployed in moving vehicles and moving robots. This paper presents a solution that is very fast in computing the routes.

• Journal of the Architectural Institute of Korea Planning & Design
• /
• v.35 no.7
• /
• pp.63-72
• /
• 2019

The purpose of this study is to apply the types of urban street pattern and the shape of streets to the master plan of a religious community complexes. The street pattern is a framework of urban structure and to understand the urban structure is helpful to understand the nature of urban streets. By analysing the precedent researches, the types of street patterns are classified as a serial pattern, a branching pattern, a grid pattern and a web pattern. The street patterns are hierarchically composed and classified as a differential development and sequential development. There are boundaries and gates where the street space is differentiated to the more private level. The urban streets continue to the architectural streets such as arcades, deck streets, corridors, lobbies and halls. The purposes and results of the master plan of this religious community complexes are as follows. 1) The school area, housing area and service area are properly separated and connected. They are separated by the building masses and connected by the street space in between. 2) The street pattern of this complexes is a serial pattern where the streets are the center of each functional building groups. The entry square is divided by the symbolic building. The one branch is school street and the other is living street. These streets are combined again to the festival street. 3) The architectural streets are organically related to the urban streets. 4) Each street spaces are of adequate form according to its properties as a place. 5) There are boundaries or gates such as a gab between buildings, posts, arches and deck streets according to the relationship between streets.

• International Journal of Computer Science & Network Security
• /
• v.21 no.4
• /
• pp.1-8
• /
• 2021

The subject of navigation has drawn a large interest in the last few years. Navigation problem (or path planning) finds the path between two points, source location and destination location. In smart cities, solving navigation problem is essential to all residents and visitors of such cities to guide them to move easily between locations. Also, the navigation problem is very important in case of moving robots that move around the city or part of it to get some certain tasks done such as delivering packages, delivering food, etc. In either case, solution to the navigation is essential. The core to navigation systems is the navigation algorithms they employ. Navigation algorithms can be classified into navigation algorithms that depend on maps and navigation without the use of maps. The map contains all available routes and its directions. In this proposal, we consider the first class. In this paper, we are interested in getting path planning solutions very fast. In doing so, we employ a parallel platform, Reconfigurable mesh (R-Mesh), to compute the path from source location to destination location. R-Mesh is a parallel platform that has very fast solutions to many problems and can be deployed in moving vehicles and moving robots. This paper presents two algorithms for path planning. The first assumes maps with linear streets. The second considers maps with branching streets. In both algorithms, the quality of the path is evaluated in terms of the length of the path and the number of turns in the path.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.2
• /
• pp.53-66
• /
• 1989

The Public Vehicle Routing Problem (PVRP) is to find the minimum total cost routes of M or less Public-Vehicles to traverse the required arcs(streets) at least once, and return to their starting depot on a directed network. In this paper, first, a mathematical model is formulated as minimal cost flow model with illegal subtour elimination constraints, and with the fixed cost and routing cost as an objective function. Second, an efficient branch and bound algorithm is developed to obtain an exact solution. A subproblem in this method is a minimal cost flow problem relaxing illegal subtour elimination constraints. The branching strategy is a variable dichotomy method according to the entering nonrequired arcs which are candidates to eneter into an illegal subtour. To accelerate the fathoming process, a tighter lower bound of a candidate subproblem is calculated by using a minimum reduced coast of the entering nonrequired arcs. Computational results based on randomly generated networks report that the developed algorithm is efficient.