A method for multi-agent exploration planning
dc.contributor.author | Chekanov, Alexander | |
dc.contributor.department | Chalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers) | sv |
dc.contributor.department | Chalmers University of Technology / Department of Computer Science and Engineering (Chalmers) | en |
dc.date.accessioned | 2019-07-03T12:54:39Z | |
dc.date.available | 2019-07-03T12:54:39Z | |
dc.date.issued | 2012 | |
dc.description.abstract | This project is concerned with the problem of exploration planning, which arises in systems of one or several mobile robots set with a task of exploring the map of their environment. Today the most popular algorithm that deals with this problem is the naive (greedy) approach, which is very simple and usually shows reasonably good results. This algorithm performs poorly in the worst case with several robots however. To cope with this problem, a new approach is developed and analyzed. This approach, called coordinated breadth-first search, is shown to guarantee linear scaling and to be asymptotically more efficient than the naive method in the worst case. To test these findings a computer simulation was developed which admits both algorithms and arbitrary maps. Finally, a comparison between the algorithms is made and further improvements are suggested. | |
dc.identifier.uri | https://hdl.handle.net/20.500.12380/161383 | |
dc.language.iso | eng | |
dc.setspec.uppsok | Technology | |
dc.subject | Datavetenskap (datalogi) | |
dc.subject | Computer Science | |
dc.title | A method for multi-agent exploration planning | |
dc.type.degree | Examensarbete för masterexamen | sv |
dc.type.degree | Master Thesis | en |
dc.type.uppsok | H | |
local.programme | Computer science – algorithms, languages and logic (MPALG), MSc |
Ladda ner
Original bundle
1 - 1 av 1
Hämtar...
- Namn:
- 161383.pdf
- Storlek:
- 735.06 KB
- Format:
- Adobe Portable Document Format
- Beskrivning:
- Fulltext