• norsk
    • English
  • norsk 
    • norsk
    • English
  • Logg inn
Vis innførsel 
  •   Hjem
  • Fakultet for informasjonsteknologi og elektroteknikk (IE)
  • Institutt for teknisk kybernetikk
  • Vis innførsel
  •   Hjem
  • Fakultet for informasjonsteknologi og elektroteknikk (IE)
  • Institutt for teknisk kybernetikk
  • Vis innførsel
JavaScript is disabled for your browser. Some features of this site may not work without it.

Collaborating Robots - Multi-robot Exploration of an Unknown Environment

Halvorsen, Øyvind Ulvin
Master thesis
Thumbnail
Åpne
10762_FULLTEXT.pdf (7.003Mb)
10762_ATTACHMENT.zip (192.3Mb)
10762_COVER.pdf (184.1Kb)
Permanent lenke
http://hdl.handle.net/11250/2433768
Utgivelsesdato
2014
Metadata
Vis full innførsel
Samlinger
  • Institutt for teknisk kybernetikk [2193]
Sammendrag
This thesis aims to develop and implement an algorithm for collaboration, such that two LEGO-robots can collaborate on mapping an unknown area using infrared sensors, a simultaneous localization and mapping (SLAM) algorithm and controlled from MATLAB.

In order to have a testing platform during development of the algorithms, the simulator was updated to allow for parallel operations and communication.

Further, the communication protocol between the robots were implemented such that data could be exchanged in a reliable fashion, which was the key for allowing collaboration.

The robots exchanged their local SLAM-generated maps such that they could operate in one common map. The map was merged by removing the initial distance between the robots.

For the NXT-robot, positioning and feedback on the sensor tower was implemented, which improved the sensor data significantly.

The main objective was to develop and implement a navigation algorithm for choosing target points, a path planner for ensuring collision free driving and coordination of the robots in order to exploit the use of multiple robots.

The navigation algorithm was implemented with a Frontier-based approach and a cost function, which was minimized in order to find the next target point.

The path planner was implemented by a Breadth-first search (BFS) algorithm and the coordination was achieved by a CLIENT/SERVER- structure.

Finally, the algorithm was tested in the simulator and on the physical system. It was shown that the robots were able to collaborate on the mapping task, as was intended in the problem description.
Utgiver
NTNU

Kontakt oss | Gi tilbakemelding

Personvernerklæring
DSpace software copyright © 2002-2019  DuraSpace

Levert av  Unit
 

 

Bla i

Hele arkivetDelarkiv og samlingerUtgivelsesdatoForfattereTitlerEmneordDokumenttyperTidsskrifterDenne samlingenUtgivelsesdatoForfattereTitlerEmneordDokumenttyperTidsskrifter

Min side

Logg inn

Statistikk

Besøksstatistikk

Kontakt oss | Gi tilbakemelding

Personvernerklæring
DSpace software copyright © 2002-2019  DuraSpace

Levert av  Unit