A numerical coupling method for particle tracking in electromagnetic fields

Jing, Heng; Yang, Xiaoqing; Wu, Suqin; Zhang, Man; Zhou, Jie; Yuan, Jianping; Zhu, Zefei

doi:10.1140/epje/i2019-11810-3

Cited by 2 publications

(1 citation statement)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…HiTi aims to reduce the search space for the shortest path computation. While HiTi achieves high performance on road weight updates and reduces storage overheads, it incurs higher computation costs when computing the shortest paths than the HEPV and the Hub Indexing methods [12], [13], [14]. To compute time-dependent fast paths, Demiryurek et al [15] propose the B-TDFP algorithm by leveraging backward searches to reduce the search space.…”

Section: Path Planningmentioning

confidence: 99%

Untitled

2018

IJET

View full text Add to dashboard Cite

In mobile navigation services, on-road path planning is a basic function that finds a route between a queried start location and a destination. While on roads, a path planning query may be issued due to dynamic factors in various scenarios, such as a sudden change in driving direction, unexpected traffic conditions, or lost ofGPS signals. In these scenarios, path planning needs to be delivered in a timely fashion. The requirement of timeliness is even more challenging when an overwhelming number of path planning queries is submitted to the server, e.g.,during peak hours. As the response time is critical to user satisfaction with personal navigation services, it is a mandate for the server to efficiently handle the heavy workload of path planning requests. To meet this need, we propose a system, namely, Path Planning by Caching (PPC), that aims to answer a new path planning query efficiently by caching and reusing historically queried paths (queried-paths in short). Unlike conventional cache-based path planning systems where a cached query is returned only when it matches completely with a new query, PPC leverages partially matched queried-paths in cache to answer part(s) of the new query. As a result, the server only needs to compute the unmatched path segments, thus significantly reducing the overall system workload.

show abstract

Section: Path Planningmentioning

confidence: 99%