Abstract: The Shortest Distance Path (SDP) problem is a critical routing issue in communication networks, particularly in satellite networks. Typically, SDP is solved by graph-based iterative ...
Abstract: Most of existing path finding problems focused on searching a path with the minimum cost, such as shortest-path length and shortest travel time. In this paper, we consider a new path finding ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback