资源分类
》 资源 》论文》An Approximation Algorithm for the Subpath Planning Problem

An Approximation Algorithm for the Subpath Planning Problem

2019-11-22 | |  58 |   55 |   0
Abstract The subpath planning problem (SPP) is a branch of path planning problem, which has widespread applications in automated manufacturing process as well as vehicle and robot navigation. This problem aims to find the shortest path or tour subject to covering a set of given subpaths. By casting SPP to a graph routing problem, we propose a deterministic 2-approximation algorithm finding near optimal solutions, which runs in O(n3 ) time.

上一篇：Improved Heuristic and Tie-Breaking for Optimally Solving Sokoban

下一篇：External Memory Bidirectional Search

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...