The use of simulated annealing to solve the mobile manipulator path planning problem

2002 ◽  
Author(s):  
W.F. Carriker ◽  
P.K. Khosla ◽  
B.H. Krogh
Keyword(s):  
Simulated Annealing ◽  
Path Planning ◽  
Mobile Manipulator ◽  
Planning Problem ◽  
Path Planning Problem

Soccer robot path planning based on the artificial potential field approach with simulated annealing

Robotica ◽  
2004 ◽  
Vol 22 (5) ◽  
pp. 563-566 ◽  
Author(s):  
Pei-Yan Zhang ◽  
Tian-Sheng Lü ◽  
Li-Bo Song
Keyword(s):  
Simulated Annealing ◽  
Path Planning ◽  
Simulated Annealing Algorithm ◽  
Minimum Problem ◽  
Planning Problem ◽  
Soccer Robot ◽  
Annealing Algorithm ◽  
Local Minimum Problem ◽  
Path Planning Problem ◽  
Robot Path

The paper presents research on the APF approach for solving the GNRON and local minima problems. The repulsive potential function is modified in order to solve the GNRON problem. A simulated annealing algorithm integrated into the APF has solved the local minimum problem. The improved APF is applied to the path-planning problem of soccer robots. The simulated experiments show the validity of this approach.

Solving the multi-objective path planning problem in mobile robotics with a firefly-based approach

2015 ◽  
Vol 21 (4) ◽  
pp. 949-964 ◽  
Author(s):  
Alejandro Hidalgo-Paniagua ◽  
Miguel A. Vega-Rodríguez ◽  
Joaquín Ferruz ◽  
Nieves Pavón
Keyword(s):  
Path Planning ◽  
Mobile Robotics ◽  
Planning Problem ◽  
Multi Objective ◽  
Path Planning Problem

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

Robotica ◽  
2021 ◽  
pp. 1-30
Author(s):  
Ümit Yerlikaya ◽  
R.Tuna Balkan
Keyword(s):  
Path Planning ◽  
Extreme Environment ◽  
Configuration Spaces ◽  
Planning Problem ◽  
Different Types ◽  
Planning Algorithm ◽  
Line Path ◽  
Path Planning Algorithm ◽  
Path Planning Problem ◽  
System Operating

Abstract Instead of using the tedious process of manual positioning, an off-line path planning algorithm has been developed for military turrets to improve their accuracy and efficiency. In the scope of this research, an algorithm is proposed to search a path in three different types of configuration spaces which are rectangular-, circular-, and torus-shaped by providing three converging options named as fast, medium, and optimum depending on the application. 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. The results obtained were simulated and no collision was observed between any bodies in these three options.

Path Planning for Spheres in Three Dimensional Environments With Low Interference Index

1994 ◽  
Author(s):  
Duane W. Storti ◽  
Debasish Dutta
Keyword(s):  
Path Planning ◽  
Free Path ◽  
Configuration Space ◽  
Local Knowledge ◽  
Three Dimensional ◽  
Target Point ◽  
Planning Problem ◽  
Spherical Object ◽  
Starting Point ◽  
Path Planning Problem

Abstract We consider the path planning problem for a spherical object moving through a three-dimensional environment composed of spherical obstacles. Given a starting point and a terminal or target point, we wish to determine a collision free path from start to target for the moving sphere. We define an interference index to count the number of configuration space obstacles whose surfaces interfere simultaneously. In this paper, we present algorithms for navigating the sphere when the interference index is ≤ 2. While a global calculation is necessary to characterize the environment as a whole, only local knowledge is needed for path construction.

ON THE PATH PLANNING PROBLEM IN THE VICINITY OF OBSTACLES

1998 ◽  
Vol 29 (8) ◽  
pp. 807-868 ◽  
Author(s):  
ALBERT Y. ZOMAYA MATT R. WRIGHT TAR
Keyword(s):  
Path Planning ◽  
Planning Problem ◽  
Path Planning Problem
Sign in / Sign up

Export Citation Format

Share Document