Adaptive workspace biasing for sampling-based planners

被引:44
|
作者
Zucker, Matt [1 ]
Kuffher, James [1 ]
Bagnell, J. Andrew [1 ]
机构
[1] Carnegie Mellon Univ, Inst Robot, Pittsburgh, PA 15213 USA
关键词
D O I
10.1109/ROBOT.2008.4543787
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The widespread success of sampling-based planning algorithms stems from their ability to rapidly discover the connectivity of a configuration space. Past research has found that non-uniform sampling in the configuration space can significantly outperform uniform sampling; one important strategy is to bias the sampling distribution based on features present in the underlying workspace. In this paper, we unite several previous approaches to workspace biasing into a general framework for automatically discovering useful sampling distributions. We present a novel algorithm, based on the REINFORCE family of stochastic policy gradient algorithms, which automatically discovers a locally-optimal weighting of workspace features to produce a distribution which performs well for a given class of sampling-based motion planning queries. We present as well a novel set of workspace features that our adaptive algorithm can leverage for improved configuration space sampling. Experimental results show our algorithm to be effective across a variety of robotic platforms and high-dimensional configuration spaces.
引用
收藏
页码:3757 / 3762
页数:6
相关论文
共 50 条
  • [1] Generalized Sampling-Based Motion Planners
    Chakravorty, Suman
    Kumar, Sandip
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2011, 41 (03): : 855 - 866
  • [2] On the Performance of Sampling-Based Optimal Motion Planners
    Elbanhawi, Mohamed
    Simic, Milan
    [J]. UKSIM-AMSS SEVENTH EUROPEAN MODELLING SYMPOSIUM ON COMPUTER MODELLING AND SIMULATION (EMS 2013), 2013, : 73 - 78
  • [3] Decoupling Constraints from Sampling-Based Planners
    Kingston, Zachary
    Moll, Mark
    Kavraki, Lydia E.
    [J]. ROBOTICS RESEARCH, 2020, 10 : 913 - 928
  • [4] An efficient deterministic sequence for sampling-based motion planners
    Rosell, J
    Heise, M
    [J]. ISATP 2005: IEEE INTERNATIONAL SYMPOSIUM ON ASSEMBLY AND TASK PLANNING (ISATP), 2005, : 212 - 217
  • [5] Sliding Local Planners for Sampling-based Path Planning
    Rahman, S. M. Rayhan
    Whitesides, Sue
    [J]. 2017 FIRST IEEE INTERNATIONAL CONFERENCE ON ROBOTIC COMPUTING (IRC), 2017, : 271 - 276
  • [6] Fast collision detection through bounding volume hierarchies in workspace-time space for sampling-based motion planners
    Schwesinger, Ulrich
    Siegwart, Roland
    Furgale, Paul
    [J]. 2015 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2015, : 63 - 68
  • [7] On the Implementation of Single-Query Sampling-Based Motion Planners
    Sucan, Ioan A.
    Kavraki, Lydia E.
    [J]. 2010 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2010, : 2005 - 2011
  • [8] Topological Nearest-Neighbor Filtering for Sampling-Based Planners
    Sandstrom, Read
    Bregger, Andrew
    Smith, Ben
    Thomas, Shawna
    Amato, Nancy M.
    [J]. 2018 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2018, : 3053 - 3060
  • [9] Benchmark of Sampling-Based Optimizing Planners for Outdoor Robot Navigation
    Atas, Fetullah
    Cielniak, Grzegorz
    Grimstad, Lars
    [J]. INTELLIGENT AUTONOMOUS SYSTEMS 17, IAS-17, 2023, 577 : 231 - 243
  • [10] Adaptive Sampling for Generalized Sampling Based Motion Planners
    Kumar, Sandip
    Chakravorty, Suman
    [J]. 49TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2010, : 7688 - 7693