Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/27447
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yang, Z | - |
dc.contributor.author | Naz, N | - |
dc.contributor.author | Liu, P | - |
dc.contributor.author | Huda, MN | - |
dc.coverage.spatial | Cambridge, UK | - |
dc.date.accessioned | 2023-10-26T18:25:52Z | - |
dc.date.available | 2023-10-26T18:25:52Z | - |
dc.date.issued | 2023-09-08 | - |
dc.identifier | ORCID iD: M. Nazmul Huda https://orcid.org/0000-0002-5376-881X | - |
dc.identifier.citation | Yang, Z. et al. (2023) 'Evaluation of SLAM Algorithms for Search and Rescue Applications', in Iida, F. et al. (eds) Towards Autonomous Robotic Systems. TAROS 2023. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) vol. 14136 LNAI, pp. 114 - 125. doi: 10.1007/978-3-031-43360-3_10. | en_US |
dc.identifier.isbn | 978-3-031-43359-7 (pbk) | - |
dc.identifier.isbn | 978-3-031-43360-3 (ebk) | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | https://bura.brunel.ac.uk/handle/2438/27447 | - |
dc.description.abstract | Copyright © 2023 The Author(s). Search and rescue robots have been widely investigated to detect humans in disaster scenarios. SLAM (Simultaneous Localisation and Mapping), as a critical function of the robot, can localise the robot and create the map during the rescue tasks. In this paper, prominent 2D SLAM algorithms are investigated and three of them (Gmapping, Hector, and Karto) are implemented on a low-cost search and rescue robot to demonstrate their feasibility. Moreover, experiments containing various ground surface scenarios are performed. Maps created by various SLAM algorithms are compared to identify the best SLAM algorithm for search and rescue tasks using a low-cost robot. The experimental results suggest that Karto SLAM performs best for low-cost search and rescue robots among the three SLAM algorithms. | en_US |
dc.format.extent | 114 - 125 | - |
dc.format.medium | Print-Electronic | - |
dc.language | English | - |
dc.language.iso | en_US | en_US |
dc.publisher | Springer Nature | en_US |
dc.rights | Copyright © 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG. This version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use (https://www.springernature.com/gp/open-research/policies/book-policies), but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/978-3-031-43360-3_10. | - |
dc.rights.uri | https://www.springernature.com/gp/open-research/policies/book-policies | - |
dc.source | Annual Conference Towards Autonomous Robotic Systems TAROS 2023 | - |
dc.source | Annual Conference Towards Autonomous Robotic Systems TAROS 2023 | - |
dc.subject | search and rescue | en_US |
dc.subject | low-cost robot | en_US |
dc.subject | SLAM | en_US |
dc.subject | Karto | en_US |
dc.subject | Gmapping | en_US |
dc.title | Evaluation of SLAM Algorithms for Search and Rescue Applications | en_US |
dc.type | Conference Paper | en_US |
dc.identifier.doi | https://doi.org/10.1007/978-3-031-43360-3_10 | - |
dc.relation.isPartOf | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
pubs.finish-date | 2023-09-15 | - |
pubs.finish-date | 2023-09-15 | - |
pubs.publication-status | Published | - |
pubs.start-date | 2023-09-13 | - |
pubs.start-date | 2023-09-13 | - |
pubs.volume | 14136 LNAI | - |
dc.identifier.eissn | 1611-3349 | - |
dc.rights.holder | The Author(s) | - |
Appears in Collections: | Dept of Electronic and Electrical Engineering Embargoed Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FullText.pdf | Embargoed until 8 September 2024 | 438.67 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.