IDEAS home Printed from https://ideas.repec.org/a/hin/complx/2327637.html
   My bibliography  Save this article

An Improved AMCL Algorithm Based on Laser Scanning Match in a Complex and Unstructured Environment

Author

Listed:
  • Gang Peng
  • Wei Zheng
  • Zezao Lu
  • Jinhu Liao
  • Lu Hu
  • Gongyue Zhang
  • Dingxin He

Abstract

Adaptive Monte Carlo localization (AMCL) algorithm has a limited pose accuracy because of the nonconvexity of the laser sensor model, the complex and unstructured features of the working environment, the randomness of particle sampling, and the final pose selection problem. In this paper, an improved AMCL algorithm is proposed, aiming to build a laser radar-based robot localization system in a complex and unstructured environment, with a LIDAR point cloud scan-matching process after the particle score calculating process. The weighted mean pose of AMCL particle swarm is used as the initial pose of the scan matching process. The LIDAR point cloud is matched with the probability grid map from coarse to fine using the Gaussian-Newton method, which results in more accurate poses. Moreover, the scan-matching pose is added into the particle swarm as a high-weight particle. So the particle swarm after resampling will be more concentrated in the correct position. The particle filter and the scan-matching process form a closed loop, thus enhancing the localization accuracy of mobile robots. The experiment results demonstrate that the proposed improved AMCL algorithm is superior to the traditional AMCL algorithm in the complex and unstructured environment, by exploiting the high-accuracy characteristic of scan matching while inheriting the stability of AMCL.

Suggested Citation

  • Gang Peng & Wei Zheng & Zezao Lu & Jinhu Liao & Lu Hu & Gongyue Zhang & Dingxin He, 2018. "An Improved AMCL Algorithm Based on Laser Scanning Match in a Complex and Unstructured Environment," Complexity, Hindawi, vol. 2018, pages 1-11, December.
  • Handle: RePEc:hin:complx:2327637
    DOI: 10.1155/2018/2327637
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2018/2327637.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/8503/2018/2327637.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2018/2327637?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:2327637. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.