Robot Path Planning Based on Random Coding Particle Swarm Optimization

Abstract

Mobile robot navigation is to find an optimal path to guide the movement of the robot, so path planning is guaranteed to find a feasible optimal path. However, the path planning problem must be solve two problems, i.e., the path must be kept away from obstacles or avoid the collision with obstacles and the length of path should be minimized. In this paper, a path planning algorithm based on random coding particle swarm optimization (RCPSO) algorithm is proposed to get the optimal collision-free path. Dijstra algorithm is applied to search a sub-optimal collision-free path in our algorithm; then the RCPSO algorithm is developed to tackle this optimal path planning problem in order to generate the global optimal path. The crossover operator of genetic algorithm and random coding are introduced into the particle swarm optimization to optimize the location of the sub-optimal path. The experiment results show that the proposed method is effective and feasible compared with different algorithms.

Authors and Affiliations

Kun Su, YuJia Wang, XinNan Hu

Keywords

Related Articles

Security Issues in Cloud Computing and their Solutions: A Review

Cloud computing is an internet-based, emerging technology, tends to be prevailing in our environment especially computer science and information technology fields which require network computing on large scale. Cloud com...

Developing an Algorithm for Securing the Biometric Data Template in the Database

In the current technology advancement, biometric template provides a dependable solution to the problem of user verification in an identity control system. The template is saved in the database during the enrollment and...

Multi-Attributes Web Objects Classification based on Class-Attribute Relation Patterns Learning Approach

The amount of Web data increases with the proliferation of a variety of Web objects, primarily in the form of text, images, video, and music data files. Each of these published objects has some properties that support de...

A Collective Neurodynamic Approach to Survivable Virtual Network Embedding

Network virtualization has attracted significant amount of attention in the last few years as one of the key features of cloud computing. Network virtualization allows multiple virtual networks to share physical resource...

Performance Enhancement of Scheduling Algorithm in Heterogeneous Distributed Computing Systems

Efficient task scheduling is essential for obtaining high performance in heterogeneous distributed computing systems. Some algorithms have been proposed for both homogeneous and heterogeneous distributed computing system...

Download PDF file
  • EP ID EP163534
  • DOI 10.14569/IJACSA.2015.060408
  • Views 113
  • Downloads 0

How To Cite

Kun Su, YuJia Wang, XinNan Hu (2015). Robot Path Planning Based on Random Coding Particle Swarm Optimization. International Journal of Advanced Computer Science & Applications, 6(4), 58-64. https://europub.co.uk/articles/-A-163534