no code implementations • 21 Aug 2023 • Lei Han, Chunyu Tu, Zhiwen Yu, Zhiyong Yu, Weihua Shan, Liang Wang, Bin Guo
In this paper, we explicitly address the route planning for a group of agents, including UAVs, workers, and cars, with the goal of maximizing the task completion rate.
1 code implementation • IEEE Transactions on Emerging Topics in Computing 2022 • Jianping Cai, Ximeng Liu, Zhiyong Yu, Kun Guo, Jiayin Li
The experiments show that our proposed algorithm takes only about 400 seconds to handle up to 9. 6 million large-scale samples, while the state-of-the-art algorithms take close to 1000 seconds to handle every 1000 samples, which embodies the advantage of our algorithms in handling large-scale samples. δ -data indistinguishability theory, we provide quantitative theoretical guarantees for the security of our algorithms.
no code implementations • 18 Jul 2020 • Zhiyong Yu, Lei Han, Chao Chen, Wenzhong Guo, Zhiwen Yu
This paper proposes a strategy named IHMs (Intermediate Searching at Heuristic Moments): each step we figure out which moment is the best to search according to a heuristic indicator, then at that moment search locations one by one in descending order of predicted appearing probabilities, until a search hits; iterate this step until we get the object's current location.