Welcome to the InfoSci Platform
Reference Hub2
A Simplistic Approach for Lightweight Multi-Agent SLAM Algorithm

A Simplistic Approach for Lightweight Multi-Agent SLAM Algorithm

Anton Filatov, Kirill Krinkin
Copyright: © 2020 |Volume: 11 |Issue: 3 |Pages: 17
ISSN: 1947-3176|EISSN: 1947-3184|EISBN13: 9781799807018|DOI: 10.4018/IJERTCS.2020070104
Cite Article Cite Article

MLA

Filatov, Anton, and Kirill Krinkin. "A Simplistic Approach for Lightweight Multi-Agent SLAM Algorithm." IJERTCS vol.11, no.3 2020: pp.67-83. http://doi.org/10.4018/IJERTCS.2020070104

APA

Filatov, A. & Krinkin, K. (2020). A Simplistic Approach for Lightweight Multi-Agent SLAM Algorithm. International Journal of Embedded and Real-Time Communication Systems (IJERTCS), 11(3), 67-83. http://doi.org/10.4018/IJERTCS.2020070104

Chicago

Filatov, Anton, and Kirill Krinkin. "A Simplistic Approach for Lightweight Multi-Agent SLAM Algorithm," International Journal of Embedded and Real-Time Communication Systems (IJERTCS) 11, no.3: 67-83. http://doi.org/10.4018/IJERTCS.2020070104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Limitation of computational resources is a challenging problem for moving agents that launch such algorithms as simultaneous localization and mapping (SLAM). To increase the accuracy on limited resources one may add more computing agents that might explore the environment quicker than one and thus to decrease the load of each agent. In this article, the state-of-the-art in multi-agent SLAM algorithms is presented, and an approach that extends laser 2D single hypothesis SLAM for multiple agents is introduced. The article contains a description of problems that are faced in front of a developer of such approach including questions about map merging, relative pose calculation, and roles of agents.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.