ePrints

An efficient algorithm for grid-based robotic path planning based on priority sorting of direction vectors

Lookup NU author(s): Dr Wanqing ZhaoORCiD

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

This paper presents an efficient grid-based robotic path planning algorithm. This method is motivated by the engineering requirement in practical embedded systems where the hardware resource is always limited. The main target of this algorithm is to reduce the searching time and to achieve the minimum number of movements. In order to assess the performance, the classical A* algorithm is also developed as a reference point to verify the effectiveness and determine the performance of the proposed algorithm. The comparison results confirm that the proposed approach considerably shortens the searching time by nearly half and produces smoother paths with less jagged segments than A* algorithm. © 2010 Springer-Verlag.

Publication metadata

Author(s): Yang A, Niu Q, Zhao W, Li K, Irwin GW

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: Life System Modeling and Intelligent Computing: International Conference on Life System Modeling and Simulation (LSMS 2010) and International Conference on Intelligent Computing for Sustainable Energy and Environment (ICSEE 2010)

Year of Conference: 2010

Pages: 456-466

ISSN: 0302-9743

Publisher: Springer

URL: https://doi.org/10.1007/978-3-642-15597-0_50

DOI: 10.1007/978-3-642-15597-0_50

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computer Science

ISBN: 9783642155963

Share