Bidirectional swarm search method for autonomous path planning

Autonomous Path Planning (APP) problem is an important research topic in many fields including Mobile Robot (MR) applications. The main purpose of APP is to minimize the human intervention in searching feasible sequence path from the initial to goal position at optimal cost that satisfies any given...

Full description

Saved in:

Bibliographic Details
Main Author:	Md. Esa, Md. Fadil
Format:	Thesis
Published:	2014
Subjects:	G Geography Anthropology Recreation
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-utm-ep.48365
record_format	uketd_dc
spelling	my-utm-ep.483652017-08-03T01:11:25Z Bidirectional swarm search method for autonomous path planning 2014 Md. Esa, Md. Fadil G Geography. Anthropology. Recreation Autonomous Path Planning (APP) problem is an important research topic in many fields including Mobile Robot (MR) applications. The main purpose of APP is to minimize the human intervention in searching feasible sequence path from the initial to goal position at optimal cost that satisfies any given constraints. Most of the paths planning algorithms developed so far used one direction information in developing the path solution. However, this approach leads to arguable solution. This research attempts to integrate the bidirectional searching strategy with Swarm Intelligence (SI) or called as Bidirectional Swarm (BiS) model. SI such as the Foraging Food Ant (FFAnt) behaviour is proven efficient in solving the path planning problem. The current research on FFAnt mostly focused on pheromone concept for agent communication. Instead, in this research the non-pheromone FFAnt is used and the agent communication is conducted via bidirectional interaction. The BiS was validated with double bridge experiment standard benchmark and similar result from the original double bridge model is obtained. The developed model has led to the development of Bidirectional Swarm based Path Planning (BiSPP) algorithm for MR using top-down methodology. The matrix performances of BiSPP are measured via computational time and path length. A series of experiment were conducted through the developed simulation tool with various static environments. The results are compared to Bidirectional Ant Colony Optimization algorithm and Multi-Scout Ants Cooperation algorithm. Results show that BiSPP algorithm has outperform the other two algorithms by decreasing up to 20 percent of the path length in a reasonable computational time. The simulation results indicate that the BiSPP algorithm has a potential to perform in static environment 2014 Thesis http://eprints.utm.my/id/eprint/48365/ masters Universiti Teknologi Malaysia, Faculty of Computing Faculty of Computing
institution	Universiti Teknologi Malaysia
collection	UTM Institutional Repository
topic	G Geography Anthropology Recreation
spellingShingle	G Geography Anthropology Recreation Md. Esa, Md. Fadil Bidirectional swarm search method for autonomous path planning
description	Autonomous Path Planning (APP) problem is an important research topic in many fields including Mobile Robot (MR) applications. The main purpose of APP is to minimize the human intervention in searching feasible sequence path from the initial to goal position at optimal cost that satisfies any given constraints. Most of the paths planning algorithms developed so far used one direction information in developing the path solution. However, this approach leads to arguable solution. This research attempts to integrate the bidirectional searching strategy with Swarm Intelligence (SI) or called as Bidirectional Swarm (BiS) model. SI such as the Foraging Food Ant (FFAnt) behaviour is proven efficient in solving the path planning problem. The current research on FFAnt mostly focused on pheromone concept for agent communication. Instead, in this research the non-pheromone FFAnt is used and the agent communication is conducted via bidirectional interaction. The BiS was validated with double bridge experiment standard benchmark and similar result from the original double bridge model is obtained. The developed model has led to the development of Bidirectional Swarm based Path Planning (BiSPP) algorithm for MR using top-down methodology. The matrix performances of BiSPP are measured via computational time and path length. A series of experiment were conducted through the developed simulation tool with various static environments. The results are compared to Bidirectional Ant Colony Optimization algorithm and Multi-Scout Ants Cooperation algorithm. Results show that BiSPP algorithm has outperform the other two algorithms by decreasing up to 20 percent of the path length in a reasonable computational time. The simulation results indicate that the BiSPP algorithm has a potential to perform in static environment
format	Thesis
qualification_level	Master's degree
author	Md. Esa, Md. Fadil
author_facet	Md. Esa, Md. Fadil
author_sort	Md. Esa, Md. Fadil
title	Bidirectional swarm search method for autonomous path planning
title_short	Bidirectional swarm search method for autonomous path planning
title_full	Bidirectional swarm search method for autonomous path planning
title_fullStr	Bidirectional swarm search method for autonomous path planning
title_full_unstemmed	Bidirectional swarm search method for autonomous path planning
title_sort	bidirectional swarm search method for autonomous path planning
granting_institution	Universiti Teknologi Malaysia, Faculty of Computing
granting_department	Faculty of Computing
publishDate	2014
_version_	1747817372451864576

Bidirectional swarm search method for autonomous path planning

Similar Items