scispace - formally typeset
Proceedings ArticleDOI

Smooth Path Planning of a Mobile Robot Using Stochastic Particle Swarm Optimization

Xin Chen, +1 more
- pp 1722-1727
Reads0
Chats0
TLDR
The stochastic PSO (S-PSO) with high exploration ability is developed, so that a swarm with small size can accomplish path planning and to reduce computational cost of optimization.
Abstract
This paper proposes a new approach using improved particle swarm optimization (PSO) to optimize the path of a mobile robot through an environment containing static obstacles. Relative to many optimization methods that produce nonsmooth paths, the PSO method developed in this paper can generate smooth paths, which are more preferable for designing continuous control technologies to realize path following using mobile robots. To reduce computational cost of optimization, the stochastic PSO (S-PSO) with high exploration ability is developed, so that a swarm with small size can accomplish path planning. Simulation results validate the proposed algorithm in a mobile robot path planning.

read more

Citations
More filters
Journal ArticleDOI

Heuristic approaches in robot path planning

TL;DR: This survey concentrates on heuristic-based algorithms in robot path planning which are comprised of neural network, fuzzy logic, nature inspired algorithms and hybrid algorithms.
Journal Article

Classic and Heuristic Approaches in Robot Motion Planning A Chronological Review

TL;DR: This paper reviews the major contributions to the Motion Planning field throughout a 35-year period, from classic approaches to heuristic algorithms, and concludes with comparative tables and graphs demonstrating the frequency of each MP method’s application.
Journal ArticleDOI

A hybridization of an improved particle swarm optimization and gravitational search algorithm for multi-robot path planning

TL;DR: The Simulation and the Khepera environment result show outperforms of IPSO–IGSA as compared with IPSO and IGSA with respect to optimize the path length from predefine initial position to designation position, energy optimization in the terms of number of turn and arrival time.
Journal ArticleDOI

Research of biogeography particle swarm optimization for robot path planning

TL;DR: A new method of global path planning by combining BBO, PSO and approximate voronoi boundary network (AVBN) in a static environment is presented and results in simulation show that the proposed method is feasible and effective.
Journal ArticleDOI

Path planning for mobile robot using self-adaptive learning particle swarm optimization

TL;DR: A novel self-adaptive learning mechanism is developed to adaptively select the most suitable search strategies at different stages of the optimization process, which can improve the search ability of particle swarm optimization (PSO).
References
More filters
Proceedings ArticleDOI

Particle swarm optimization

TL;DR: A concept for the optimization of nonlinear functions using particle swarm methodology is introduced, and the evolution of several paradigms is outlined, and an implementation of one of the paradigm is discussed.
Proceedings ArticleDOI

A new optimizer using particle swarm theory

TL;DR: The optimization of nonlinear functions using particle swarm methodology is described and implementations of two paradigms are discussed and compared, including a recently developed locally oriented paradigm.
Book ChapterDOI

Parameter Selection in Particle Swarm Optimization

TL;DR: This paper first analyzes the impact that inertia weight and maximum velocity have on the performance of the particle swarm optimizer, and then provides guidelines for selecting these two parameters.
Journal ArticleDOI

An algorithm for planning collision-free paths among polyhedral obstacles

TL;DR: A collision avoidance algorithm for planning a safe path for a polyhedral object moving among known polyhedral objects that transforms the obstacles so that they represent the locus of forbidden positions for an arbitrary reference point on the moving object.
Journal ArticleDOI

The fully informed particle swarm: simpler, maybe better

TL;DR: The canonical particle swarm algorithm is a new approach to optimization, drawing inspiration from group behavior and the establishment of social norms, but each individual is not simply influenced by the best performer among his neighbors.