arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2310.00834cs.RO
收藏

面向配备多个充电站的电池受限机器人的能量感知路径规划

Energy-Aware Route Planning for a Battery-Constrained Robot with Multiple Charging Depots

Ahmad Bilal Asghar, Pratap Tokekar

AI总结:

针对多充电站环境下电池受限机器人的能量感知路径规划问题,提出O(log D)近似算法及启发式改进,在TSPLIB算例上验证显示其运行时间降20多倍,解与ILP最优解平均差距在31%以内。

摘要:

本文研究了在配备多个充电站的环境中作业的电池受限机器人的能量感知路径规划问题。机器人的电池放电时间为$D$,为避免电量耗尽,它最多每$D$个时间单位就必须访问一次充电站。研究目标是在确保机器人访问环境中所有任务地点的前提下,最小化其行驶时间。本文提出了一种针对该问题的$O(\text{log}D)$近似算法,还对该近似算法进行了启发式改进,并在TSPLIB(旅行商问题库)的算例上评估了其性能,将其与通过整数线性规划(ILP)得到的最优解进行了对比。仿真结果表明,尽管运行时间降低了20多倍,所提算法给出的解平均而言与ILP解的差距在31%以内。

英文摘要:

This paper considers energy-aware route planning for a battery-constrained robot operating in environments with multiple recharging depots. The robot has a battery discharge time $D$, and it should visit the recharging depots at most every $D$ time units to not run out of charge. The objective is to minimize robot's travel time while ensuring it visits all task locations in the environment. We present a $O(\log D)$ approximation algorithm for this problem. We also present heuristic improvements to the approximation algorithm and assess its performance on instances from TSPLIB, comparing it to an optimal solution obtained through Integer Linear Programming (ILP). The simulation results demonstrate that, despite a more than $20$-fold reduction in runtime, the proposed algorithm provides solutions that are, on average, within $31\%$ of the ILP solution.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑