Optimal tour constructions for multiple mobile robots

The attempts to use mobile robots in a variety of environments are currently being limited by their navigational capability, thus a set of robots must be configured for one specific environment. The problem of navigating an environment is the fundamental problem in mobile robotic where various metho...

Full description

Bibliographic Details
Main Author: Shafie, Amir Akramin
Format: Article
Language:English
Published: Taylor's University 2011
Subjects:
Online Access:http://irep.iium.edu.my/2897/
http://irep.iium.edu.my/2897/1/Vol_6%282%29_215_227_SHAFIE.pdf
_version_ 1848776069739446272
author Shafie, Amir Akramin
author_facet Shafie, Amir Akramin
author_sort Shafie, Amir Akramin
building IIUM Repository
collection Online Access
description The attempts to use mobile robots in a variety of environments are currently being limited by their navigational capability, thus a set of robots must be configured for one specific environment. The problem of navigating an environment is the fundamental problem in mobile robotic where various methods including exact and heuristic approaches have been proposed to solve the problem. This paper proposed a solution to the navigation problem via the use of multiple robots to explore the environment employing heuristic methods to navigate the environment using a variant of a Traveling Salesman Problem (TSP) known as Multiple Traveling Salesman Problem (M-TSP). © School of Engineering, Taylors University.
first_indexed 2025-11-14T14:24:14Z
format Article
id iium-2897
institution International Islamic University Malaysia
institution_category Local University
language English
last_indexed 2025-11-14T14:24:14Z
publishDate 2011
publisher Taylor's University
recordtype eprints
repository_type Digital Repository
spelling iium-28972013-06-20T02:42:42Z http://irep.iium.edu.my/2897/ Optimal tour constructions for multiple mobile robots Shafie, Amir Akramin TJ210.2 Mechanical devices and figures. Automata. Ingenious mechanism. Robots (General) The attempts to use mobile robots in a variety of environments are currently being limited by their navigational capability, thus a set of robots must be configured for one specific environment. The problem of navigating an environment is the fundamental problem in mobile robotic where various methods including exact and heuristic approaches have been proposed to solve the problem. This paper proposed a solution to the navigation problem via the use of multiple robots to explore the environment employing heuristic methods to navigate the environment using a variant of a Traveling Salesman Problem (TSP) known as Multiple Traveling Salesman Problem (M-TSP). © School of Engineering, Taylors University. Taylor's University 2011-04 Article PeerReviewed application/pdf en http://irep.iium.edu.my/2897/1/Vol_6%282%29_215_227_SHAFIE.pdf Shafie, Amir Akramin (2011) Optimal tour constructions for multiple mobile robots. Journal of Engineering Science and Technology, 6 (2). pp. 227-239. ISSN 18234690 http://jestec.taylors.edu.my/V6Issue2.html
spellingShingle TJ210.2 Mechanical devices and figures. Automata. Ingenious mechanism. Robots (General)
Shafie, Amir Akramin
Optimal tour constructions for multiple mobile robots
title Optimal tour constructions for multiple mobile robots
title_full Optimal tour constructions for multiple mobile robots
title_fullStr Optimal tour constructions for multiple mobile robots
title_full_unstemmed Optimal tour constructions for multiple mobile robots
title_short Optimal tour constructions for multiple mobile robots
title_sort optimal tour constructions for multiple mobile robots
topic TJ210.2 Mechanical devices and figures. Automata. Ingenious mechanism. Robots (General)
url http://irep.iium.edu.my/2897/
http://irep.iium.edu.my/2897/
http://irep.iium.edu.my/2897/1/Vol_6%282%29_215_227_SHAFIE.pdf