[PDF] Top 20 Path Planning on Road Network by Caching

... of road networks states that two paths are very likely to share sub-paths if they meet the following spatial constraints at same time: (1) the source nodes of two queries are closer to each other; and (2)the ... See full document

... of path queries on road networks : In this paper, Path queries that find the shortest path between a source and a destination of the ...simultaneous path queries in road ... See full document

... the road network, along with the latest estimation of the target’s location and the current location of the ...best path is updated using the path chosen by “what-if” ...the path of the ... See full document

... the path-planning in urban area the 2D grid-based search tree is employed ...The road network is transformed into a uniform 8-connected 2D grid ...the road system came across when ... See full document

... shortest path factor and stochastic factor are the same in model or in practice, there are other questions can’t be solved such as shorter path question, stochastic strength, and ...and road ... See full document

... charging path planning of large-scale electric vehicles based on traffic conditions and distribution network conditions is still very ...charging path planning strategy combining ... See full document

... intelligent path planning was ...shortest path calculation will be ...blocked road parts is sent to a mobile robot using a wireless ad hoc network ...the road for the shortest ... See full document

... proposed road map based path planning by Khepera robot having perception of a predefined road ...The road map path based planning is introduced here using the image ... See full document

... balancing act between speed and sub optimality of the computed routes. Due to these reasons, there is a considerable interest in the development of more efficient and accurate route planning techniques [2]. A* ... See full document

... cost path analysis is considered to be appropriate for the procedure of opening up forest’s planning and it is more efficient as the distance increases between two points we want to ...effective ... See full document

... The related work clearly showed that an optimal algorithm could not be defined yet, and thus a suitable localization algorithm needs to be designed on the specificities of the situations, taking into account the size of ... See full document

... Abstract—In this paper, we aim at maximizing the cache offloading gain for a clustered device-to-device (D2D) caching network by exploiting probabilistic caching and cooperative transmission among ... See full document

... The trac model adopted in this paper is the one presented by S. Deng after analyzing sets of actual trac data 16]. In his empirical model, the trac generated by a Web browser is an ON-OFF process. During the OFF period, ... See full document

... In addition, Web-based applications also need more intensive I/O access, putting higher requirements on I/O performance. To meet this requirement, we are facing issues of how to create effectiveness for the total ... See full document

... cost over the network nodes, because the cluster head role is energy expansive. That permits to grant approximately, the same lifetime until the battery energy depletion. So, in every transmission round, some new ... See full document

... Economic expansion and development of urbanization have led to an enormous increase in demand for electricity consumption, requiring the high reliability of the power supply. As the connection between the electricity ... See full document

... Kennedy and Eberhart proposed PSO in 1995. In PSO, each particle adjusts its path according to its own flight experience and companions' flight experience. The best position that each particle has experienced is ... See full document

... forest planning (Zeki Baskent and Keles 2005) and specifically also in forest road planning (Na- jafi and Richards 2013, Hayati et ...forest planning under a sustainable perspective (Ducey and ... See full document

... a path is found, otherwise, if there are no more vertices to visit then there is no ...actual path[6] can be obtained by maintaining back pointers which indicate for each vertex the vertex that expanded ... See full document

... for the years preceding their rehabilitation, most had a roughness oscillating around 4.2 m/km. In most cases this magnitude of roughness existed for a considerable time before the road was rebuilt. Therefore the ... See full document