2014
DOI: 10.1016/j.procs.2014.05.466
|View full text |Cite
|
Sign up to set email alerts
|

On the Adequacy of Tabu Search for Global Robot Path Planning Problem in Grid Environments

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
4
4
2

Relationship

0
10

Authors

Journals

citations
Cited by 29 publications
(13 citation statements)
references
References 11 publications
0
13
0
Order By: Relevance
“…Each cell of the matrix is either occupied or empty. The zeroes denote empty cells from the grid map whereas as the ones denote obstacle cells in grid map, whether the cell is completely or partially occupied [55]. In figure 1, the circles shown on the grid map represent all possible places which the blind person can occupy on the grid map.…”
Section: Indoor Environment Representationmentioning
confidence: 99%
“…Each cell of the matrix is either occupied or empty. The zeroes denote empty cells from the grid map whereas as the ones denote obstacle cells in grid map, whether the cell is completely or partially occupied [55]. In figure 1, the circles shown on the grid map represent all possible places which the blind person can occupy on the grid map.…”
Section: Indoor Environment Representationmentioning
confidence: 99%
“…In order to comply with the feasibility constraints and to enhance the efficiency of the path, a certain number of the waypoints in the elite solutions can be modified for each generation by applying three possible operations: waypoint deletion, insertion, or replacement [2] a tabu search system model is designed and a tabu search planner algorithm for solving the path planning problem is proposed. A comprehensive simulation study is conducted using the proposed model and algorithm, in terms of solution quality and execution time.…”
Section: Fig 7 Chromosome and Waypoint Array A) Ga Chromosome; B) mentioning
confidence: 99%
“…The simulation results showed that the method had high feasibility in robot path planning. Chaari et al [10] proposed a tabu search planning algorithm for robot path planning.…”
Section: Introductionmentioning
confidence: 99%