Reliable Reliable Path Finding Technique for Mobile Robot
Autor(a) principal: | |
---|---|
Data de Publicação: | 2020 |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | INFOCOMP: Jornal de Ciência da Computação |
Texto Completo: | https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/994 |
Resumo: | This paper we have discussed path planning techniques of mobile robot (Automated Vehicle). Though different researchers had proposed different path planning strategies, each plan has its own advantages and disadvantages. The goal of the research work is to develop an algorithm to find out an optimal path from source to destination along with the obstacles. The path planning algorithm not only minimizes the risk of collision but also reduces the planning time. This method creates a reliable path between desired locations avoiding obstacles. The proposed algorithm is to be implemented to get the reliable path and to be compared with that of the existing algorithm to find the optimized path. The new approach is able to minimize the risk of collision and travelling time with the help of different parameters and simulation software. It has been proved through experimental results that the performance of the proposed algorithm is improved considerably and work efficiently when the shape and size of the image changes. It also turns closely at the corners of the obstacles and also reduces the number of steps without any effect to the steps and corners. Time and space complexity analysis for this algorithm is experimentally tested and implemented. |
id |
UFLA-5_99fcc33918d85ad3737f5a8e7c4d1f4a |
---|---|
oai_identifier_str |
oai:infocomp.dcc.ufla.br:article/994 |
network_acronym_str |
UFLA-5 |
network_name_str |
INFOCOMP: Jornal de Ciência da Computação |
repository_id_str |
|
spelling |
Reliable Reliable Path Finding Technique for Mobile RobotThis paper we have discussed path planning techniques of mobile robot (Automated Vehicle). Though different researchers had proposed different path planning strategies, each plan has its own advantages and disadvantages. The goal of the research work is to develop an algorithm to find out an optimal path from source to destination along with the obstacles. The path planning algorithm not only minimizes the risk of collision but also reduces the planning time. This method creates a reliable path between desired locations avoiding obstacles. The proposed algorithm is to be implemented to get the reliable path and to be compared with that of the existing algorithm to find the optimized path. The new approach is able to minimize the risk of collision and travelling time with the help of different parameters and simulation software. It has been proved through experimental results that the performance of the proposed algorithm is improved considerably and work efficiently when the shape and size of the image changes. It also turns closely at the corners of the obstacles and also reduces the number of steps without any effect to the steps and corners. Time and space complexity analysis for this algorithm is experimentally tested and implemented.Editora da UFLA2020-12-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/994INFOCOMP Journal of Computer Science; Vol. 19 No. 2 (2020): December 2020; 42-561982-33631807-4545reponame:INFOCOMP: Jornal de Ciência da Computaçãoinstname:Universidade Federal de Lavras (UFLA)instacron:UFLAenghttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/994/542Copyright (c) 2020 Chandra Kanta Samalinfo:eu-repo/semantics/openAccessSamal, Chandra Kanta2020-12-01T21:34:08Zoai:infocomp.dcc.ufla.br:article/994Revistahttps://infocomp.dcc.ufla.br/index.php/infocompPUBhttps://infocomp.dcc.ufla.br/index.php/infocomp/oaiinfocomp@dcc.ufla.br||apfreire@dcc.ufla.br1982-33631807-4545opendoar:2024-05-21T19:54:45.611082INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)true |
dc.title.none.fl_str_mv |
Reliable Reliable Path Finding Technique for Mobile Robot |
title |
Reliable Reliable Path Finding Technique for Mobile Robot |
spellingShingle |
Reliable Reliable Path Finding Technique for Mobile Robot Samal, Chandra Kanta |
title_short |
Reliable Reliable Path Finding Technique for Mobile Robot |
title_full |
Reliable Reliable Path Finding Technique for Mobile Robot |
title_fullStr |
Reliable Reliable Path Finding Technique for Mobile Robot |
title_full_unstemmed |
Reliable Reliable Path Finding Technique for Mobile Robot |
title_sort |
Reliable Reliable Path Finding Technique for Mobile Robot |
author |
Samal, Chandra Kanta |
author_facet |
Samal, Chandra Kanta |
author_role |
author |
dc.contributor.author.fl_str_mv |
Samal, Chandra Kanta |
description |
This paper we have discussed path planning techniques of mobile robot (Automated Vehicle). Though different researchers had proposed different path planning strategies, each plan has its own advantages and disadvantages. The goal of the research work is to develop an algorithm to find out an optimal path from source to destination along with the obstacles. The path planning algorithm not only minimizes the risk of collision but also reduces the planning time. This method creates a reliable path between desired locations avoiding obstacles. The proposed algorithm is to be implemented to get the reliable path and to be compared with that of the existing algorithm to find the optimized path. The new approach is able to minimize the risk of collision and travelling time with the help of different parameters and simulation software. It has been proved through experimental results that the performance of the proposed algorithm is improved considerably and work efficiently when the shape and size of the image changes. It also turns closely at the corners of the obstacles and also reduces the number of steps without any effect to the steps and corners. Time and space complexity analysis for this algorithm is experimentally tested and implemented. |
publishDate |
2020 |
dc.date.none.fl_str_mv |
2020-12-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/994 |
url |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/994 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/994/542 |
dc.rights.driver.fl_str_mv |
Copyright (c) 2020 Chandra Kanta Samal info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Copyright (c) 2020 Chandra Kanta Samal |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Editora da UFLA |
publisher.none.fl_str_mv |
Editora da UFLA |
dc.source.none.fl_str_mv |
INFOCOMP Journal of Computer Science; Vol. 19 No. 2 (2020): December 2020; 42-56 1982-3363 1807-4545 reponame:INFOCOMP: Jornal de Ciência da Computação instname:Universidade Federal de Lavras (UFLA) instacron:UFLA |
instname_str |
Universidade Federal de Lavras (UFLA) |
instacron_str |
UFLA |
institution |
UFLA |
reponame_str |
INFOCOMP: Jornal de Ciência da Computação |
collection |
INFOCOMP: Jornal de Ciência da Computação |
repository.name.fl_str_mv |
INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA) |
repository.mail.fl_str_mv |
infocomp@dcc.ufla.br||apfreire@dcc.ufla.br |
_version_ |
1799874742636773376 |