Welcome to Journal of Beijing Institute of Technology
Advance Search
Volume 21Issue 3
.
Turn off MathJax
Article Contents
Article Navigation> JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY> 2012> 21(3): 328-335
ZHANG Hao-jie, CHEN Hui-yan, JIANG Yan, GONG Jian-wei, XIONG Guang-ming. Variable dimensional state space based global path planning for mobile robot[J]. JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 2012, 21(3): 328-335.
Citation: ZHANG Hao-jie, CHEN Hui-yan, JIANG Yan, GONG Jian-wei, XIONG Guang-ming. Variable dimensional state space based global path planning for mobile robot[J].JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 2012, 21(3): 328-335.
shu

Variable dimensional state space based global path planning for mobile robot

  • School of Mechanical Engineering, Beijing Institute of Technology, Beijing 100081, China

  • Received Date:2011-06-04
    Abstract
  • A variable dimensional state space (VDSS) has been proposed to improve the re-planning time when the robotic systems operate in large unknown environments. VDSS is constructed by uniforming lattice state space and grid state space. In VDSS, the lattice state space is only used to construct search space in the local area which is a small circle area near the robot, and grid state space elsewhere. We have tested VDSS with up to 80 indoor and outdoor maps in simulation and on segbot robot platform. Through the simulation and segbot robot experiments, it shows that exploring on VDSS is significantly faster than exploring on lattice state space by Anytime Dynamic A *(AD *) planner and VDSS is feasible to be used on robotic systems.
    • FullText(HTML)
  • loading
    • References (13)
  • [1]
    Hart P, Nilsson N, Raphael B. A formal basis for the heuristic determination of minimum cost paths in graphs[J]. IEEE Transactions on Systems Science and Cybernetics, 1968, 2(30): 100-107.
    [2]
    Koenig S, Likhachev M, Liu Yaxin, et al. Incremental heuristic search in artificial intelligence[J]. Artificial Intelligence Magazine, 2004, 25: 99-112.
    [3]
    Likhachev M, Gordon G, Sebastian Thrum. ARA *: Anytime A *with provable bounds on sub-optimality[C]//The Seventeenth Annual Conference on Neural Information Processing Systems. Cambridge: MIT Press, 2004: 1-8.
    [4]
    Likhachev M, Ferguson D, Gordon G, et al. Anytime dynamic A *: An anytime, replanning algorithm[C]//The International Conference on Automated Planning and Scheduling. Monterey: AAAI Press, 2005: 262-271.
    [5]
    LaValle S. Rapidly-exploring random trees: A new tool for path planning. Ames, Iowa, USA: Iowa State University, 1998.
    [6]
    LaValle S, Kuffner J. Randomized kinodynamic planning[C]//IEEE International Conference on Robotics and Automation. Detroit, MI,USA: IEEE, 1999: 473-479.
    [7]
    Kirby R, Simmons R, Forlizzi J. Variable sized grid cells for rapid replanning in dynamic environments[C]//IEEE/RSJ International Conference on Intelligent Robots and Systems. St. Louis, MO, USA: IEEE, 2009: 4913-4918.
    [8]
    Likhachev M, Dave Ferguson. Planning long dynamically-feasible maneuvers for autonomous vehicles[J]. The International Journal of Robotics Research, 2009, 28(8): 933-945.
    [9]
    Pivtoraiko M, Knepper R, Kelly A. Optimal, smooth, nonholonomic mobile robot motion planning in state lattices, technical report CMU-RI-TR-07-15. Pittsburgh, Pennsylvania, USA: Carnegie Mellon University, 2007.
    [10]
    Likhachev M, Ferguson D, Gordon G, et al. Anytime search in dynamic graphs[J]. Artificial Intelligence Journal, 2008, 172(14): 1613-1643.
    [11]
    Gaschnig J. Performance measurement and analysis of certain search algorithms. Pittsburgh, Pennsylvania, USA: Carnegie Mellon University, 1979.
    [12]
    Davis H, Bramanti-Gregor A, and Wang Jin. The advantages of using depth and breadth components in heuristic search[J]. Methodologies for Intelligent Systems, 1988, 3: 19-28.
    [13]
    Cohen B, Chitta S, Likhachev M. Search-based planning for manipulation with motion primitives[C]//IEEE International Conference on Robotics and Automation. Anchorage, AK, USA: IEEE, 2010: 2902-2908.
    • Relative Articles
  • Supplements (0)
  • Cited By
  • 加载中

Catalog

    通讯作者:陈斌, bchen63@163.com
    • 1.

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索
    Get Citation
    PDF
    XML

    Article Metrics

    Article views (1071) PDF downloads(123) Cited by()
    Proportional views
    Related

    Address:5 Zhongguancun South Street, Haidian District, Beijing

    Tel:86-10-68914374

    Email:blgywb@bit.edu.cn

    Copy Right © Journal of Beijing Institute of Technology

    Supported by:Beijing Renhe Information Technology Co. Ltd

    /

      Return
      Return
        Baidu
        map