DMVP:时变图的首要航点覆盖
DMVP: Foremost Waypoint Coverage of Time-Varying Graphs
摘要:
我们认为动态地图访问问题(DMVP),其中一个团队的代理必须尽快访问的关键位置的集合,在一个环境中,可能会迅速变化,在代理的导航不可预测。我们应用最新配方的时变图(TVG)DMVP,脱落新的光TVG类的计算层次$\mathcal{R} \supset \mathcal{B} \supset \mathcal{P}$通过分析它们的上下文中的图形导航。我们提供的硬度结果为所有三类,并为几个限制拓扑,我们显示了严重的不可逼近性在$\mathcal{R}$,有限的逼近性在$\mathcal{B}$,和易处理性在$\mathcal{P}$类之间的分离。我们还给出了拓扑结构,其中DMVP在$\mathcal{R}$是固定参数易处理的,这可以作为第一步充分表征的功能,使DMVP困难。
英文摘要:
We consider the Dynamic Map Visitation Problem (DMVP), in which a team of agents must visit a collection of critical locations as quickly as possible, in an environment that may change rapidly and unpredictably during the agents' navigation. We apply recent formulations of time-varying graphs (TVGs) to DMVP, shedding new light on the computational hierarchy $\mathcal{R} \supset \mathcal{B} \supset \mathcal{P}$ of TVG classes by analyzing them in the context of graph navigation. We provide hardness results for all three classes, and for several restricted topologies, we show a separation between the classes by showing severe inapproximability in $\mathcal{R}$, limited approximability in $\mathcal{B}$, and tractability in $\mathcal{P}$. We also give topologies in which DMVP in $\mathcal{R}$ is fixed parameter tractable, which may serve as a first step toward fully characterizing the features that make DMVP difficult.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。