Asynchronous Flooding Planner for Multi-Robot Navigation

Bernd Brüeggemann, Michael Brunner, Dirk Schulz

2013

Abstract

Within the topic of coordinated navigation of multi-robot systems (MRS) the problem may occur that there is a difference between where the robots are able to move to and where they are allowed to move. To deal with such constraints we propose a roadmap approach where those two different kinds of information are merged. So we encounter the problem of connecting several target positions with valid paths in a graph structure. Therefore, an asynchronous, parallel search algorithm is developed to find a passable and allowed way to the target positions. In addition to static planning we show that our search algorithm is able to deal with dynamic graphs and, to some extend, unknown environments.

References

  1. (1996). Radio equipment and systems: High performance radio local area network (hiperlan) type 1, functional specifications,. Technical report, ETSI STC-RES10 Committee.
  2. Blin, L., Potop-Butucaru, M., and Rovedakis, S. (2009). A superstabilizing log (n)-approximation algorithm for dynamic steiner trees. Stabilization, Safety, and Security of Distributed Systems, pages 133-148.
  3. Brueggemann, B., Brunner, M., and Schulz, D. (2012). Spatially constrained coordinated navigation for a multirobot system. Ad Hoc Networks, (0):-.
  4. Brüggemann, B., Langetepe, E., Lenerz, A., and Schulz, D. (2012). From a multi-robot global plan to single robot actions. In Proceedings of Informatics in Control, Automation and Robotics (ICINCO).
  5. Burgard, W., Moors, M., Fox, D., Simmons, R., and Thrun, S. (2000). Collaborative multi-robot exploration. volume 1, pages 476-481 vol.1.
  6. Ding, S. and Ishii, N. (2000). An online genetic algorithm for dynamic steiner tree problem. In Industrial Electronics Society, 2000. IECON 2000. 26th Annual Confjerence of the IEEE, volume 2, pages 812-817 vol.2.
  7. Gilbert, E. and Pollak, H. (1968). Steiner minimal trees. SIAM Journal on Applied Mathematics, pages 1-29.
  8. Lagoudakis, M. G., Markakis, E., Kempe, D., Keskinocak, P., Kleywegt, A., Koenig, S., Tovey, C., Meyerson, A., and Jain, S. (2005). Auction-based multi-robot routing. In Robotics: Science and Systems, pages 343- 350. Citeseer.
  9. Mehlhorn, K. (1988). A faster approximation algorithm for the steiner problem in graphs. Inf. Process. Lett., 27(3):125-128.
  10. Monier, P., Doniec, A., Piechowiak, S., and Mandiau, R. (2010). Metrics for the evaluation of discsp: some experiments on multi-robot exploration. In Web Intelligence and Intelligent Agent Technology (WI-IAT), 2010 IEEE/WIC/ACM International Conference on, volume 2, pages 370-373. IEEE.
  11. Mosteo, A. R., Montano, L., and Lagoudakis, M. G. (2008). Multi-robot routing under limited communication range. In IEEE International Conference on Robotics and Automation (ICRA) 2008.
  12. Mosteo, A. R., Montano, L., and Lagoudakis, M. G. (2009). Guaranteed-performance multi-robot routing under limited communication range. In Distributed Autonomous Robotic Systems 8, pages 491- 502. Springer Berlin Heidelberg.
  13. Qayyum, A., Viennot, L., and Laouiti, A. (2002). Multipoint relaying for flooding broadcast messages in mobile wireless networks. In System Sciences, 2002. HICSS. Proceedings of the 35th Annual Hawaii International Conference on, pages 3866-3875.
  14. C?agalj, M., Hubaux, J.-P., and Enz, C. (2002). Minimumenergy broadcast in all-wireless networks: Npcompleteness and distribution issues. In Proceedings of the 8th annual international conference on Mobile computing and networking, MobiCom 7802, pages 172-182, New York, NY, USA. ACM.
  15. Zou, H. and Choueiry, B. (2003). Multi-agent based search versus local search and backtrack search for solving tight csps: A practical case study. In Working Notes of the Workshop on Stochastic Search Algorithms (IJCAI 03), Acapulco, Mexico, pages 17-24.
Download


Paper Citation


in Harvard Style

Brüeggemann B., Brunner M. and Schulz D. (2013). Asynchronous Flooding Planner for Multi-Robot Navigation . In Proceedings of the 10th International Conference on Informatics in Control, Automation and Robotics - Volume 2: ICINCO, ISBN 978-989-8565-71-6, pages 222-230. DOI: 10.5220/0004457802220230


in Bibtex Style

@conference{icinco13,
author={Bernd Brüeggemann and Michael Brunner and Dirk Schulz},
title={Asynchronous Flooding Planner for Multi-Robot Navigation},
booktitle={Proceedings of the 10th International Conference on Informatics in Control, Automation and Robotics - Volume 2: ICINCO,},
year={2013},
pages={222-230},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004457802220230},
isbn={978-989-8565-71-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 10th International Conference on Informatics in Control, Automation and Robotics - Volume 2: ICINCO,
TI - Asynchronous Flooding Planner for Multi-Robot Navigation
SN - 978-989-8565-71-6
AU - Brüeggemann B.
AU - Brunner M.
AU - Schulz D.
PY - 2013
SP - 222
EP - 230
DO - 10.5220/0004457802220230