|
|
|
|
|
Qiuling Tang and Wanfeng Dou
Calculating the least-cost path (LCP) is a fundamental operation in raster-based geographic information systems (GIS). The LCP is applied to raster cost surfaces, in which it determines the most cost-effective path. Increasing the raster resolution resul...
ver más
|
|
|
|
|
|
|
|
|
|
|
Juarez Machado da Silva, Gabriel de Oliveira Ramos and Jorge Luis Victória Barbosa
The Shortest Path (SP) problem resembles a variety of real-world situations where one needs to find paths between origins and destinations. A generalization of the SP is the Dynamic Shortest Path (DSP) problem, which also models changes in the graph at a...
ver más
|
|
|
|
|
|
|
|
|
|
|
Debajyoti Ghosh, Jagan Sankaranarayanan, Kiran Khatter and Hanan Samet
Many spatial applications benefit from the fast answering to a seemingly simple spatial query: ?Is a point of interest (POI) ?in-path? to the shortest path between a source and a destination?? In this context, an in-path POI is one that is either on the ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Keyju Lee and Junjae Chae
The vehicle routing problem (VRP) attempts to find optimal (minimum length) routes for a set of vehicles visiting a set of locations. Solving a VRP calls for a cost matrix between locations. The size of the matrix grows quadratically with an increasing n...
ver más
|
|
|
|
|
|
|
|
|
|
|
Zhenyu Tian, Jiali You and Linlin Hu
Network layer multicast is a powerful method for transmitting data from sources to multiple group members. When joining a multicast group, a group member first sends a request to a designated router (DR). Then, the DR selects a node in the existing multi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Daniela Ambrosino, Carmine Cerrone and Anna Sciomachen
This paper presents a new heuristic algorithm tailored to solve large instances of an NP-hard variant of the shortest path problem, denoted the cost-balanced path problem, recently proposed in the literature. The problem consists in finding the origin?de...
ver más
|
|
|
|
|
|
|
|
|
|
|
Xinning Li, Qun He, Qin Yang, Neng Wang, Hu Wu and Xianhai Yang
In order to obtain the optimal perspectives of the recognition target, this paper combines the motion path of the manipulator arm and camera. A path planning method to find the optimal perspectives based on an A* algorithm is proposed. The quality of per...
ver más
|
|
|
|
|
|
|
|
|
|
|
Arbi Haza Nasution, Shella Eldwina Fitri, Rizauddin Saian, Winda Monika and Nasreen Badruddin
Indonesia has a diverse ethnic and cultural background. However, this diversity sometimes creates social problems, such as intertribal conflict. Because of the large differences among tribal languages, it is often difficult for conflicting parties to dia...
ver más
|
|
|
|
|
|
|
|
|
|
|
Saeed A. Astaneh, Shahram Shah Heydari, Sara Taghavi Motlagh and Alireza Izaddoost
We consider the problem of SDN flow optimization in the presence of a dynamic probabilistic link failures model. We introduce a metric for path risk, which can change dynamically as network conditions and failure probabilities change. As these probabilit...
ver más
|
|
|
|
|
|
|
|
|
|
|
Xu Chen, Shaohua Wang, Huilai Li, Fangzheng Lyu, Haojian Liang, Xueyan Zhang and Yang Zhong
The ability to quickly calculate or query the shortest path distance between nodes on a road network is essential for many real-world applications. However, the traditional graph traversal shortest path algorithm methods, such as Dijkstra and Floyd?Warsh...
ver más
|
|
|
|
|
|