Show simple item record

dc.contributor.advisorMukhopadhyay, Shayok
dc.contributor.authorUmari, Hassan Abdul-Rahman
dc.date.accessioned2017-05-31T08:43:34Z
dc.date.available2017-05-31T08:43:34Z
dc.date.issued2017-05
dc.identifier.other35.232-2017.10
dc.identifier.urihttp://hdl.handle.net/11073/8857
dc.descriptionA Master of Science thesis in Mechatronics Engineering by Hassan Abdul-Rahman Umari entitled, "Multi-Robot Map Exploration Based on Multiple Rapidly-Exploring Randomized Trees," submitted in May 2017. Thesis advisor is Dr. Shayok Mukhopadhyay. Soft and hard copy available.en_US
dc.description.abstractEfficient robotic navigation requires a predefined map. In order to autonomously acquire a map, it is desired that robots have the ability to explore unknown environments with minimum cost and time, while ensuring complete map coverage. Meeting these requirements is challenging, and has attracted a lot of research. Various autonomous map exploration strategies exist, which direct robots to unexplored space by detecting frontiers. Frontiers are boundaries separating known space form unknown space. Usually frontier detection utilizes image processing tools like edge detection, thus limiting it to two dimensional (2-D) exploration. In this work we present a new exploration strategy based on the use of multiple Rapidly-exploring Random Trees (RRTs). The RRT algorithm is chosen because it is biased towards unexplored regions. Also, using RRT provides a general approach which can be extended to higher dimensional spaces. The proposed strategy is implemented and tested using the Robot Operating System (ROS) framework. Additionally this work uses local and global trees for detecting frontier points, which enables efficient robotic exploration. Further more, a marketbased task allocation strategy for coordination between multiple robots is adopted. Simulations and experimental results show that the proposed strategy can successfully extract frontiers, and explore the entire map in a reasonable amount of time, and with a reduced map exploration cost. It is also shown in this work that the proposed approach has the above mentioned performance benefits without substantially losing performance when compared against image processing-based frontier detection techniques in two dimensional spaces.en_US
dc.description.sponsorshipCollege of Engineeringen_US
dc.description.sponsorshipDepartment of Mechanical Engineeringen_US
dc.language.isoen_USen_US
dc.relation.ispartofseriesMaster of Science in Mechatronics Engineering (MSMTR)en_US
dc.relation.ispartofseriesAmerican University of Sharjah Student Worken_US
dc.subjectMappingen_US
dc.subjectExplorationen_US
dc.subjectROSen_US
dc.subjectRobot Operating System (ROS)en_US
dc.subjectMulti Agenten_US
dc.subjectRRTen_US
dc.subjectRapidly-exploring Random Trees (RRTs)en_US
dc.subject.lcshAutonomous robotsen_US
dc.subject.lcshDigital mappingen_US
dc.subject.lcshNavigationen_US
dc.subject.lcshAlgorithmsen_US
dc.titleMulti-Robot Map Exploration Based on Multiple Rapidly-Exploring Randomized Treesen_US
dc.typeThesisen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record