COLLABORATIVE EXPLORATION IN GRID DOMAINS - Constructive Conjecture of a Polynomial Time Complexity

Yaniv Altshuler, Alfred M. Bruckstein, Israel A. Wagner

Abstract

This work discusses the problem of exploration of an unknown environment using a collaborative group of simple agents. While this problem was known to be of a non-polynomial time complexity, it was speculated in the past that in grid domains the completion time of this problem is much lower (although analytic proofs were not available hitherto). In this work we present a preliminary result concerning a constructive analytic constraint for guaranteeing that the time complexity of this problem in grid domains is indeed polynomial.

References

  1. Acar, E., Zhang, Y., Choset, H., Schervish, M., Costa, A., Melamud, R., Lean, D., and Gravelin, A. (2001). Path planning for robotic demining and development of a test platform. In International Conference on Field and Service Robotics, pages 161-168.
  2. Alami, R., Fleury, S., Herrb, M., Ingrand, F., and Robert, F. (1998). Multi-robot cooperation in the martha project. IEEE Robotics and Automation Magazine, 5(1):36- 47.
  3. Altshuler, Y., Bruckstein, A., and Wagner, I. (2005a). Swarm robotics for a dynamic cleaning problem. In IEEE Swarm Intelligence Symposium, pages 209-216.
  4. Altshuler, Y., Wagner, I., and Bruckstein, A. (2009). Swarm ant robotics for a dynamic cleaning problem - upper bounds. The 4th International conference on Autonomous Robots and Agents (ICARA-2009), pages 227-232.
  5. Altshuler, Y., Yanovski, V., Wagner, I., and Bruckstein, A. (2005b). The cooperative hunters - efficient cooperative search for smart targets using uav swarms. In Second International Conference on Informatics in Control, Automation and Robotics (ICINCO), the First International Workshop on Multi-Agent Robotic Systems (MARS), pages 165-170.
  6. Arkin, R. (1990). Integrating behavioral, perceptual, and world knowledge in reactive navigation. Robotics and Autonomous Systems, 6:105-122.
  7. Balch, T. and Arkin, R. (1998). Behavior-based formation control for multi-robot teams. IEEE Transactions on Robotics and Automation, 14(6):926-939.
  8. Batalin, M. and Sukhatme, G. (2002). Spreading out: A local approach to multi-robot coverage. In 6th International Symposium on Distributed Autonomous Robotics Systems.
  9. Beni, G. and Wang, J. (1991). Theoretical problems for the realization of distributed robotic systems. In IEEE Internal Conference on Robotics and Automation, pages 1914-1920.
  10. Butler, Z., Rizzi, A., and Hollis, R. (2001). Distributed coverage of rectilinear environments. In Proceedings of the Workshop on the Algorithmic Foundations of Robotics.
  11. Candea, C., Hu, H., Iocchi, L., Nardi, D., and Piaggio, M. (2001). Coordinating in multi-agent robocup teams. Robotics and Autonomous Systems, 36(2-3):67-86.
  12. Chevallier, D. and Payandeh, S. (2000). On kinematic geometry of multi-agent manipulating system based on the contact force information. In The Sixth International Conference on Intelligent Autonomous Systems (IAS-6), pages 188-195.
  13. E.Bonabeau, M.Dorigo, and G.Theraulaz (1999). Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, US.
  14. Efraim, A. and D.Peleg (2007). Distributed algorithms for partitioning a swarm of autonomous mobile robots. Structural Information and Communication Complexity, Lecture Notes in Computer Science, 4474:180- 194.
  15. Gerkey, B. and Mataric, M. (2002). Sold! market methods for multi-robot control. IEEE Transactions on Robotics and Automation, Special Issue on Multirobot Systems.
  16. Gordon, N., Wagner, I., and Bruckstein, A. (2003). Discrete bee dance algorithms for pattern formation on a grid. In IEEE International Conference on Intelligent Agent Technology (IAT03), pages 545-549.
  17. Haynes, T. and Sen, S. (1986). Evolving Behavioral Strategies in Predators and Prey, volume 1042 of Lecture Notes in Computer Science, chapter Adaptation and Learning in Multi-Agent Systems, pages 113-126. Springer, Berlin.
  18. Hettiarachchi, S. and Spears, W. (2005). Moving swarm formations through obstacle fields. In International Conference on Artificial Intelligence.
  19. Kerr, W. and Spears, D. (2005). Robotic simulation of gases for a surveillance task. In Intelligent Robots and Systems (IROS 2005), pages 2905-2910.
  20. Koenig, S. and Liu, Y. (2001). Terrain coverage with ant robots: A simulation study. In AGENTS'01.
  21. Koenig, S., Szymanski, B., and Liu, Y. (2001). Efficient and inefficient ant coverage methods. Annals of Mathematics and Artificial Intelligence, 31:41-76.
  22. Kong, C., Peng, N., and Rekleitis, I. (2006). Distributed coverage with multi-robot system. In IEEE International Conference on Robotics and Automation.
  23. MacKenzie, D., Arkin, R., and Cameron, J. (1997). Multiagent mission specification and execution. Autonomous Robots, 4(1):29-52.
  24. Mataric, M. (1992). Designing emergent behaviors: From local interactions to collective intelligence. In J.Meyer, H.Roitblat, and S.Wilson, editors, Proceedings of the Second International Conference on Simulation of Adaptive Behavior, pages 432-441. MIT Press.
  25. Mataric, M. (1994). Interaction and Intelligent Behavior. PhD thesis, Massachusetts Institute of Technology.
  26. Olfati-Saber, R. (2006). Flocking for multi-agent dynamic systems: Algorithms and theory. IEEE Transactions on Automatic Control, 51(3):401-420.
  27. Passino, K., Polycarpou, M., Jacques, D., Pachter, M., Liu, Y., Yang, Y., Flint, M., and Baum, M. (2002). Cooperative Control for Autonomous Air Vehicles, chapter Cooperative Control and Optimization. Kluwer Academic, Boston.
  28. Polycarpou, M., Yang, Y., and Passino, K. (2001). A cooperative search framework for distributed agents. In IEEE International Symposium on Intelligent Control, pages 1-6.
  29. Rabideau, G., Estlin, T., Chien, T., and Barrett, A. (1999). A comparison of coordinated planning methods for cooperating rovers. In Proceedings of the American Institute of Aeronautics and Astronautics (AIAA) Space Technology Conference.
  30. Rekleitis, I., Dudek, G., and Milios, E. (2003). Experiments in free-space triangulation using cooperative localization. In IEEE/RSJ/GI International Conference on Intelligent Robots and Systems (IROS).
  31. Rekleitis, I., New, A., and Choset, H. (2005). Distributed coverage of unknown/unstructured environments by mobile sensor networks. In The Third MRS workshop.
  32. Rekleitisy, I., Lee-Shuey, V., Newz, A. P., and Choset, H. (2004). Limited communication, multi-robot team based coverage. In IEEE International Conference on Robotics and Automation.
  33. Shucker, B. and Bennett, J. (2005). Target tracking with distributed robotic macrosensors. In Military Communications Conference (MILCOM 2005), volume 4, pages 2617-2623.
  34. Steels, L. (1990). Cooperation between distributed agents through self-organization. In Y.DeMazeau and J.P.Muller, editors, Decentralized A.I - Proc. first European Workshop on Modeling Autonomous Agents in Multi-Agents world, pages 175-196. Elsevier.
  35. Stone, L. (1975). Theory of Optimal Search. Academic Press, New York.
  36. Svennebring, J. and Koenig, S. (2004). Building terraincovering ant robots: A feasibility study. Autonomous Robots, 16(3):313-332.
  37. Thayer, S., Dias, M., Digney, B., Stentz, A., Nabbe, B., and Hebert, M. (2000). Distributed robotic mapping of extreme environments. In Proceedings of SPIE, volume 4195 of Mobile Robots XV and Telemanipulator and Telepresence Technologies VII.
  38. Vincent, P. and Rubin, I. (2004). A framework and analysis for cooperative search using uav swarms. In ACM Simposium on applied computing.
  39. Wagner, I., Altshuler, Y., Yanovski, V., and Bruckstein, A. (2008). Cooperative cleaners: A study in ant robotics. The International Journal of Robotics Research (IJRR), 27(1):127-151.
  40. Wagner, I. and Bruckstein, A. (2001). From ants to a(ge)nts: A special issue on ant-robotics. Annals of Mathematics and Artificial Intelligence, Special Issue on Ant Robotics, 31(1-4):1-6.
  41. Yamashita, A., Fukuchi, M., Ota, J., Arai, T., and Asama, H. (2000). Motion planning for cooperative transportation of a large object by multiple mobile robots in a 3d environment. In In Proceedings of IEEE International Conference on Robotics and Automation, pages 3144-3151.
Download


Paper Citation


in Harvard Style

Altshuler Y., M. Bruckstein A. and A. Wagner I. (2009). COLLABORATIVE EXPLORATION IN GRID DOMAINS - Constructive Conjecture of a Polynomial Time Complexity . In Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO, ISBN 978-989-8111-99-9, pages 252-257. DOI: 10.5220/0002214402520257


in Bibtex Style

@conference{icinco09,
author={Yaniv Altshuler and Alfred M. Bruckstein and Israel A. Wagner},
title={COLLABORATIVE EXPLORATION IN GRID DOMAINS - Constructive Conjecture of a Polynomial Time Complexity},
booktitle={Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO,},
year={2009},
pages={252-257},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002214402520257},
isbn={978-989-8111-99-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO,
TI - COLLABORATIVE EXPLORATION IN GRID DOMAINS - Constructive Conjecture of a Polynomial Time Complexity
SN - 978-989-8111-99-9
AU - Altshuler Y.
AU - M. Bruckstein A.
AU - A. Wagner I.
PY - 2009
SP - 252
EP - 257
DO - 10.5220/0002214402520257