Abstract
In this paper we propose a completely distributed multi-robot coordination algorithm to explore and map terrain. This algorithm is based on a market bidding process of unrevealed frontiers, where the bids are calculated by each robot. When it reaches the target the robot makes a decision by itself, which involves every one of the team members without lost of time in a distributed behavior and without the necessity of a central module. The result is an efficient and fault tolerant approach.
The bid function includes the distance of the actual robot towards the frontier, the distances to the others robots and theirs objectives. This function gives a tendency of robots separation in a minimum route towards the frontier.
This research was partialy funded by project number 51623 from “Fondo Mixto Conacyt-Gobierno del Estado de Tamaulipas”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Zlot, R., Stentz, A., Dias, M., Thayer, S.: Multi-robot exploration controlled by a market economy. In: Proceedings of the IEEE International Conference on Robotics and Automation, pp. 3016–3023 (2002)
Simmons, R.G., Apfelbaum, D., Burgard, W., Fox, D., Moors, M., Thrun, S., Younes, H.: Coordination for multi-robot exploration and mapping. In: AAAI/IAAI, pp. 852–858 (2000)
Burgard, W., Moors, M., Stachniss, C., Schneider, F.: Coordinated multi-robot exploration. IEEE Transactions on Robotics and Automation 21, 376–386 (2005)
Sheng, W., Yang, Q., Tan, J., Xi, N.: Distributed multi-robot coordination in area exploration. Robot. Auton. Syst. 54, 945–955 (2006)
Yamauchi, B.: A frontier-based approach for autonomous exploration. In: CIRA 1997: Proceedings of the 1997 IEEE International Symposium on Computational Intelligence in Robotics and Automation, Washington, DC, USA, p. 146. IEEE Computer Society, Los Alamitos (1997)
Albers, S., Kursawe, K., Schuierer, S.: Exploring unknown environments with obstacles. In: SODA 1999: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA. Society for Industrial and Applied Mathematics, pp. 842–843 (1999)
Dudek, G., Jenkin, M., Milios, E., Wilkes, D.: Robotic exploration as graph construction. IEEE Transactions on Robotics and Automation, 859–865 (1991)
Thrun, S.: Learning metric-topological maps for indoor mobile robot navigation. Artificial Intelligence 99, 21–71 (1998)
Yamauchi, B.: Decentralized coordination for multirobot exploration. Robotics and Autonomous Systems 29, 111–118 (1999)
Stachniss, C., Martínez-Mozos, O., Burgard, W.: Speeding-up multi-robot exploration by considering semantic place information. In: Proceedings 2006 IEEE International Conference on Robotics and Automation, ICRA 2006, pp. 1692–1697 (2006)
Baglietto, M., Paolucci, M.S., Zoppoli, L.R.: Information-based multi-agent exploration. In: Proceedings of the Third International Workshop on Robot Motion and Control, RoMoCo 2002, November 9-11, pp. 173–179 (2002)
Poernomo, A., Ying, H.S.: New cost function for multi-robot exploration. In: 9th International Conference on Control, Automation, Robotics and Vision, ICARCV 2006, December 5-8, pp. 1–6 (2006)
Brian, P., Gerkey, R.T.V., Howard, A.: The player/stage project: Tools for multi-robot and distributed sensor systems. In: Proc. of the Intl. Conf. on Advanced Robotics (ICAR), pp. 317–323 (July 2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Elizondo-Leal, J.C., Ramírez-Torres, G., Pulido, G.T. (2008). Multi-robot Exploration and Mapping Using Self Biddings. In: Geffner, H., Prada, R., Machado Alexandre, I., David, N. (eds) Advances in Artificial Intelligence – IBERAMIA 2008. IBERAMIA 2008. Lecture Notes in Computer Science(), vol 5290. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88309-8_40
Download citation
DOI: https://doi.org/10.1007/978-3-540-88309-8_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88308-1
Online ISBN: 978-3-540-88309-8
eBook Packages: Computer ScienceComputer Science (R0)