Metaheuristic global path planning algorithm for mobile robots
نویسندگان
چکیده
منابع مشابه
Metaheuristic global path planning algorithm for mobile robots
A new metaheuristic method applied to the global path planning for mobile robots in dynamic environments is presented. This algorithm, named the Quad Harmony Search method, consists of dividing the robot‟s environment into free regions by applying the Quad-tree algorithm and utilizing this information to accelerate the next phase which implements the Harmony Search optimization method to provid...
متن کاملPSO-Based Path Planning Algorithm for Humanoid Robots Considering Safety
In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...
متن کاملCellular Automata Based Path-planning Algorithm for Autonomous Mobile Robots
This paper presents the application of Cellular Automata (CA) model in solving the problem of path planning. It is shown that a CA allows the efficient computation of a path from an initial to a goal configuration on a physical space cluttered with obstacles. The cellular space represents a discrete version of the workspace. The method was experimentally tested on an autonomous mobile robot on ...
متن کاملA parallel path planning algorithm for mobile robots
This paper presents a path planning algorithm for mobile robots. We introduce a parallel search approach which is based on a regular grid representation of the map. The search is formulated as a cellular automaton by which local inter-cell communication rules are defined. The algorithm is made adaptive by utilising a multiresolution representation of the map. It is implemented on AMT DAP 510, w...
متن کاملWave front Method Based Path Planning Algorithm for Mobile Robots
Path planning problem revolves around finding a path from start node to goal node without any collisions. This paper presents an improved version of Focused Wave Front Algorithm for mobile robot path planning in static 2D environment. Existing wave expansion algorithms either provide speed or optimality. We try to counter this problem by preventing the full expansion of the wave and expanding s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Reasoning-based Intelligent Systems
سال: 2015
ISSN: 1755-0556,1755-0564
DOI: 10.1504/ijris.2015.070910