Modern SLAM (Simultaneous Localization and Mapping) algorithms launched on a moving agent are bounded with its computation resources. The consistent way out is to add more computing agents that might explore the environment quicker than one and thus to decrease the load of each agent. This paper presents the state of art in area of Multi-agent SLAM algorithms and describes problems that are faced in front of a developer of such approach. The outstanding problem of Multiagent SLAM - merging of maps built by separate agent during algorithm is also considered in this paper. Moreover the algorithm that extends laser 2D single hypothesis SLAM for multiple agents is introduced with evaluation of its performance.