arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1604.08464eess.SYcs.SY
收藏

一种具有燃油限制的自主车辆路径规划问题的精确算法

An Exact Algorithm for a Fuel-Constrained Autonomous Vehicle Path Planning Problem

Center for Non-Linear Studies, Los Alamos National Laboratory(洛斯阿拉莫斯国家实验室非线性研究中心);Dept. of Industrial and Systems Engg., Wayne State University(韦恩州立大学工业与系统工程系);Dept. of Mechanical Engg., Texas A&M University(德克萨斯农工大学机械工程系)

Kaarthik Sundar, Saravanan Venkatachalam, Sivakumar Rathinam

AI总结:

本文提出四种混合整数线性规划模型,解决具有多个加油站的自主车辆路径规划问题,旨在最小化总行驶成本并确保车辆不缺油。

摘要:

本文针对存在多个加油站点的自主车辆路径规划问题,提出四种混合整数线性规划模型。问题给定一组目标点、一组加油站点和一个仓库,其中$m$辆车辆驻扎于此。车辆可在任意加油站点加油,目标是确定每辆车从仓库出发并返回仓库的路线,使得每个目标点至少被一辆车访问,车辆在行驶过程中不缺油,且所有路线的总行驶成本最小。我们为该问题提出了四种新的混合整数线性规划模型,并在分析和实证上进行了比较,开发了分支定界算法以计算最优解。还展示了在大量测试实例上的广泛计算结果,以证明算法的有效性。

英文摘要:

This paper addresses a fuel-constrained, autonomous vehicle path planning problem in the presence of multiple refueling stations. We are given a set of targets, a set of refueling stations, and a depot where $m$ vehicles are stationed. The vehicles are allowed to refuel at any refueling station, and the objective of the problem is to determine a route for each vehicle starting and terminating at the depot, such that each target is visited by at least one vehicle, the vehicles never run out of fuel while traversing their routes, and the total travel cost of all the routes is a minimum. We present four new mixed-integer linear programming formulations for the problem. These formulations are compared both analytically and empirically, and a branch-and-cut algorithm is developed to compute an optimal solution. Extensive computational results on a large class of test instances that corroborate the effectiveness of the algorithm are also presented.

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

↑