In this paper a novel solution to the Simultaneous Localization and Mapping (SLAM) problem for a team of mobile robots is proposed. The algorithm aims at approximating the robots surrounding environment by a set of polynomials, ensuring high mapping performance and low communication cost. To this sake, once two robots meet, only the acquired polynomials data are exchanged. Also, the algorithm has been developed trying to minimize each robot computational requirements so that it can be implemented in a decentralized way. Numerical simulations are reported to show the effectiveness of the proposed solution.
A decentralized Polynomial based SLAM algorithm for a team of mobile robots
D'Alfonso, Luigi
;Muraca, Pietro;Pugliese, Paolo;
2014-01-01
Abstract
In this paper a novel solution to the Simultaneous Localization and Mapping (SLAM) problem for a team of mobile robots is proposed. The algorithm aims at approximating the robots surrounding environment by a set of polynomials, ensuring high mapping performance and low communication cost. To this sake, once two robots meet, only the acquired polynomials data are exchanged. Also, the algorithm has been developed trying to minimize each robot computational requirements so that it can be implemented in a decentralized way. Numerical simulations are reported to show the effectiveness of the proposed solution.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
