Computing Path Bundles in Bipartite Networks
Computing Path Bundles in Bipartite Networks
复制标题
DOI：
10.5220/0006480604220427
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
V. Parque;Satoshi Miura;T. Miyashita
中科院分区：
文献类型：
--
作者：
V. Parque;Satoshi Miura;T. Miyashita
路径捆绑是一类路径规划问题，它是将多条路径组合在一起以最小化全局距离度量。自然地，一个树状的结构就形成了，其中的根起着协调信息、货物和人员的联合运输的作用。本文利用无梯度优化和凸表示来解决二部网络中的路径捆绑问题。然后，通过7500个有障碍物和无障碍物不同场景的计算实验，75亿次最短路径计算，证明了网格自适应搜索的可行性和有效性。
Path bundling, a class of path planning problem, consists of compounding multiple routes to minimize a global distance metric. Naturally, a tree-like structure is obtained as a result wherein roots play the role of coordinating the joint transport of information, goods, and people. In this paper we tackle the path bundling problem in bipartite networks by using gradient-free optimization and a convex representation. Then, by using 7,500 computational experiments in diverse scenarios with and without obstacles, implying 7.5 billion shortest path computations, show the feasibility and efficiency of the mesh adaptive search.