MAP EXPLORATION USING A LINE-BASED FORMATION OF MOBILE ROBOTS

Bart Wyns, Jens Boeykens, Luc Boullart

2010

Abstract

Exploration of an unknown environment is a well-studied problem for single robot systems. However, using just a single robot limits the speed in which a map can be fully explored. Using a multi-robot approach, a noticeable performance gain can be achieved. In this article a line-based formation strategy to explore a static area is introduced, without making any assumptions about the shape of the obstacles within. A software simulator including this line-based formation strategy was built to evaluate performance in different environments. Results show that the robot formation can easily get around both convex and concave obstacles whilst constructing a map that is both complete and correct.

References

  1. A. Koestler and T. Bräunl (2004). Mobile Robot Simulation with Realistic Error Models. International Conference on Autonomous Robots and Agents, 6:46-51.
  2. A. U. Irturk (2006). Distributed Multi-robot Coordination For Area Exploration and Mapping.
  3. H. Choset (2001). Coverage for robotics - A survey of recent results. Annals of mathematics and artificial intelligence, 31(1-4):113-126.
  4. I. Rekleitis, V. Lee-Shue, Ai Peng New, and H. Choset (2004). Limited communication, multi-robot team based coverage. Proc. 2004 IEEE International Conference on Robotics and Automation, 1-5:3462-3468.
  5. J. Fredslund and M. J. Mataric (2002). A General Algorithm for Robot Formations Using Local Sensing and Minimal Communication. IEEE transactions on robotics and automation, 18(5):837-846.
  6. J. Ota (2006). Multi-agent robot systems as distributed autonomous systems. Advanced engineering informatics, 20(1):59-70.
  7. K. Easton and J. Burdick (2005). A coverage algorithm for multi-robot boundary inspection. IEEE International Conference on Robotics and Automation (ICRA), 1- 4:727-734.
  8. Rogge, J. and Aeyels, D. (2007). A novel strategy for exploration with multiple robots. Icinco 2007: proceedings of the fourth international conference on informatics in control, automation and robotics, vol ra-1- robotics and automation, 1:76-83.
  9. S. Weihua, Y. Qingyan, T. Jindong, and X. Ning (2006). Distributed multi-robot coordination in area exploration. Robotics and autonomous systems, 54(12):945-955.
  10. Simmons, R., Apfelbaum, D., Burgard, W., Fox, D., Moors, M., Thrun, S., and Younes, H. (2000). Coordination for multi-robot exploration and mapping. Proceedings Seventeenth National Conference on Artificial Intelligence (AAAI-2000). Twelfth Innovative Applications of Artificial Intelligence Conference (IAAI2000), pages 852-8.
  11. W. Burgard, M. Moors, C. Stachniss, and F. Schneider (2005). Coordinated Multi-robot exploration. IEEE transactions on robotics, 21(3):376-386.
  12. W. Kerr, D. Spears, W. Spears, and D. Thayer (2005). Two formal gas models for multi-agent sweeping and obstacle avoidance. Formal Approaches to Agent-Based Systems, 3228:111-130.
Download


Paper Citation


in Harvard Style

Wyns B., Boeykens J. and Boullart L. (2010). MAP EXPLORATION USING A LINE-BASED FORMATION OF MOBILE ROBOTS . In Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-674-022-1, pages 241-244. DOI: 10.5220/0002591002410244


in Bibtex Style

@conference{icaart10,
author={Bart Wyns and Jens Boeykens and Luc Boullart},
title={MAP EXPLORATION USING A LINE-BASED FORMATION OF MOBILE ROBOTS},
booktitle={Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2010},
pages={241-244},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002591002410244},
isbn={978-989-674-022-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - MAP EXPLORATION USING A LINE-BASED FORMATION OF MOBILE ROBOTS
SN - 978-989-674-022-1
AU - Wyns B.
AU - Boeykens J.
AU - Boullart L.
PY - 2010
SP - 241
EP - 244
DO - 10.5220/0002591002410244