scispace - formally typeset
Journal ArticleDOI

Safe Motion Planning Based on a New Encoding Technique for Tree Expansion Using Particle Swarm Optimization

Sara Bouraine, +1 more
- 01 May 2021 - 
- Vol. 39, Iss: 5, pp 885-927
Reads0
Chats0
TLDR
A motion planning method intended to simultaneously solve these two problems in a formal way, dubbed PassPMP-PSO, based on a periodic process that interleaves planning and execution for a regular update of the environment’s information.
Abstract
Robots are now among us and even though they compete with human beings in terms of performance and efficiency, they still fail to meet the challenge of performing a task optimally while providing strict motion safety guarantees. It is therefore necessary that the future generation of robots evolves in this direction. Generally, in robotics state-of-the-art approaches, the trajectory optimization and the motion safety issues have been addressed separately. An important contribution of this paper is to propose a motion planning method intended to simultaneously solve these two problems in a formal way. This motion planner is dubbed PassPMP-PSO. It is based on a periodic process that interleaves planning and execution for a regular update of the environment’s information. At each cycle, PassPMP-PSO computes a safe near-optimal partial trajectory using a new tree encoding technique based on particle swarm optimization (PSO). The performances of the proposed approach are firstly highlighted in simulation environments in the presence of moving objects that travel at high speed with arbitrary trajectories, while dealing with sensors field-of-view limits and occlusions. The PassPMP-PSO algorithm is tested for different tree expansions going from 13 to more than 200 nodes. The results show that for a population between 20 and 100 particles, the frequency of obtaining optimal trajectory is 100% with a rapid convergence of the algorithm to this solution. Furthermore, an experiment-based comparison demonstrates the performances of PassPMP-PSO over two other motion planning methods (the PassPMP, a previous variant of PassPMP-PSO, and the input space sampling). Finally, PassPMP-PSO algorithm is assessed through experimental tests performed on a real robotic platform using robot operating system in order to confirm simulation results and to prove its efficiency in real experiments.

read more

Citations
More filters
Journal ArticleDOI

Optimal Design of a Parallel Manipulator for Aliquoting of Biomaterials Considering Workspace and Singularity Zones

TL;DR: In this paper , a robotic system for aliquoting of biomaterial, consisting of a serial manipulator in combination with a parallel Delta-like robot, is presented, where a mathematical formulation for approximating the geometric constraints of the parallel robot as a set of solutions to a system of nonlinear inequalities is described.
Journal ArticleDOI

Particle swarm optimization for solving a scan-matching problem based on the normal distributions transform

TL;DR: In this article, an evolutionary scan-matching approach is proposed to solve an optimization issue in simultaneous localization and mapping (SLAM), which can directly affect the accuracy of the environment's map and the estimated pose.
Journal ArticleDOI

Collision-Free Motion Planning for an Aligned Multiple-turret System Operating in Extreme Environment

Ümit Yerlikaya, +1 more
- 16 Jun 2021 - 
TL;DR: With the help of the proposed algorithm, 4-dimensional (D) path planning problem was realized as 2-D + 2-D by using six sequences and their options and no collision was observed between any bodies in these three options.
Journal ArticleDOI

Multi-robot co-operation for stick carrying application using hybridization of meta-heuristic algorithm

TL;DR: In this article , a modified Q-learning algorithm was proposed to solve the problem of multi-robot cooperation for stick-carving in a multrobot environment by embedding the modified Q learning into the hybrid process of an improved version of particle swarm optimization and intelligent water drop algorithm, and the proposed hybrid algorithm computes the collision free subsequent position for each robot pair by avoiding the obstacles in its path, avoiding the trapping at the local optima, improving the convergence speed, optimizing the path distance for every pair of robots, energy usage and path smoothness both in the static and dynamic environment's.
Journal ArticleDOI

Point cloud modeling and slicing algorithm for trajectory planning of spray painting robot

TL;DR: The simulation and numerical experiment results show that the uniformity of coating thickness and spraying efficiency are improved using the proposed point cloud modeling and slicing algorithm.
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.
Journal ArticleDOI

A note on two problems in connexion with graphs

TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Book

Genetic Algorithms + Data Structures = Evolution Programs

TL;DR: GAs and Evolution Programs for Various Discrete Problems, a Hierarchy of Evolution Programs and Heuristics, and Conclusions.
Journal ArticleDOI

A Formal Basis for the Heuristic Determination of Minimum Cost Paths

TL;DR: How heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching is described and an optimality property of a class of search strategies is demonstrated.
Proceedings ArticleDOI

A modified particle swarm optimizer

TL;DR: A new parameter, called inertia weight, is introduced into the original particle swarm optimizer, which resembles a school of flying birds since it adjusts its flying according to its own flying experience and its companions' flying experience.
Related Papers (5)