For oversized cargo transportation, traditional transportation schemes only consider road length, road width, the transportation cost as weight values in analysis and calculation of route selection. However, for oversized trucks, turning direction at road intersections is also a factor worth considering. By introducing the classical algorithm of Dijkstra into the model of road network, this res...

We propose a novel method for the problem of 3D surface mesh segmentation. This mesh segmentation method is based on differential geometry and geodesic distance information. In our algorithm, vertices of the same group of surface types are allowed to join a segment. The geodesic distance is estimated using shortest path between connected vertices, which can be computed from well known algorithm...

Nowadays, self-adaptive multi-agent systems are applied in a variety of areas, including transportation, telecommunications, etc. The main challenge in route guidance system is to direct vehicles to their destination in a dynamic traffic situation, with the aim of reducing the traveling time and to ensure and efficient use of available road networks capacity. In this paper we propose a self-ada...

This paper presents a route navigation system with a new revised shortest path routing algorithm for solving road traffic problems. The system can avoid selecting no left (right) turns, one-way roads, and congested roads when it determines the shortest paths from source to destination. Also, the new revised routing algorithm is compared numerically with existing algorithms such as the Dijkstra ...

The paper demonstrates a system for detection of location robotic platform FESTO Robotino and optimal route building. It processes data from the camera transmits control signals to robot. whole is based on Raspberry Pi. detects robot's current coordinates, angular rotation, difference (difference between previous rotation) displacement robot in its own coordinate system. uses an ArUco marker, p...

The shortest path-searching with the minimal weight for multiple destinations is a crucial need in an indoor applications, especially supermarkets, warehouses, libraries, etc. However, when it used item searches, its becomes higher as searches only path between single sources to each destination separately. If conventional Dijkstra algorithm modified multi-destination mode then decreased, but o...

The ACM-EATCS Edsger W. Dijkstra Prize in Distributed Computing was created to acknowledge outstanding papers on the principles of distributed computing whose significance and impact on the theory or practice of distributed computing have been evident for at least a decade. The Prize is sponsored jointly by the ACM Symposium on Principles of Distributed Computing (PODC) and the EATCS Symposium ...

To identify the optimal route is a complex task in packet switched network because optimization depends upon a number of parameters. In this paper Genetic Algorithm is used to locate the optimal route. Genetic Algorithm starts with a number of solutions where each solution is represented in the form of chromosome using the permutation encoding scheme. The success of Genetic Algorithm depends up...