计算机科学
数学优化
调度(生产过程)
路径(计算)
近似算法
最优化问题
对数
移动机器人
分布式计算
机器人
计算机网络
算法
数学
人工智能
数学分析
作者
Lin Chen,Shan Lin,Hua Huang,Weihua Yang
出处
期刊:IEEE ACM Transactions on Networking
[Institute of Electrical and Electronics Engineers]
日期:2022-10-01
卷期号:30 (5): 2262-2273
被引量:2
标识
DOI:10.1109/tnet.2022.3167781
摘要
We study a class of generic charging path optimization problems arising from emerging networking applications, where mobile chargers are dispatched to deliver energy to mobile agents (e.g., robots, drones, vehicles), which have specified tasks and mobility patterns. We instantiate our work by focusing on finding the charging path maximizing the number of nodes charged within a fixed time horizon. We show that this problem is APX-hard. By recursively decomposing the problem into sub-problems of searching sub-paths, we design quasi-polynomial-time algorithms achieving logarithmic approximation to the optimum charging path. Our approximation algorithms can be further adapted and extended to solve a variety of charging path optimization and scheduling problems with realistic constraints, such as limited time and energy budget.
科研通智能强力驱动
Strongly Powered by AbleSci AI