图上模块化Agent的最优路由
Optimal Routing of Modular Agents on a Graph
摘要:
受自主模块化车辆的新兴框架的启发,我们考虑最优路由两个模块的抽象问题,即,在图表上可以相互连接或分离的车辆。这些模块的目标是达到一组预设的节点,同时产生最小的资源成本。我们假设由两个模块连接而成的代理所产生的资源成本与单个模块的资源成本相同。这种成本公式简单地模拟了连接两个模块的好处,例如模块之间的乘客重新分配,减少交通拥堵和更高的燃油效率。为了找到一个最优的计划,我们提出了一个启发式算法,使用的概念图中心,以确定何时何地加入模块。此外,我们使用最近邻的方法来估计成本路由连接或分离的模块。基于该估计的成本,该算法确定两个模块的后续节点。所提出的算法是多项式时间:最坏情况下的计算数量的规模为图中的总节点数的八次方。为了验证它的好处,我们模拟了大量的伪随机图,由真实的运输场景,它的表现优于最相关的基准,一个适应最近邻算法为两个独立的代理,超过85%的时间的动机所提出的算法。
英文摘要:
Motivated by an emerging framework of Autonomous Modular Vehicles, we consider the abstract problem of optimally routing two modules, i.e., vehicles that can attach to or detach from each other in motion on a graph. The modules' objective is to reach a preset set of nodes while incurring minimum resource costs. We assume that the resource cost incurred by an agent formed by joining two modules is the same as that of a single module. Such a cost formulation simplistically models the benefits of joining two modules, such as passenger redistribution between the modules, less traffic congestion, and higher fuel efficiency. To find an optimal plan, we propose a heuristic algorithm that uses the notion of graph centrality to determine when and where to join the modules. Additionally, we use the nearest neighbor approach to estimate the cost routing for joined or separated modules. Based on this estimated cost, the algorithm determines the subsequent nodes for both modules. The proposed algorithm is polynomial time: the worst-case number of calculations scale as the eighth power of the number of the total nodes in the graph. To validate its benefits, we simulate the proposed algorithm on a large number of pseudo-random graphs, motivated by real transportation scenario where it performs better than the most relevant benchmark, an adapted nearest neighbor algorithm for two separate agents, more than 85 percent of the time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。