Advertisement

Collective search by mobile robots using alpha-beta coordination

  • Steven Y. Goldsmith
  • Rush RobinettIII
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1456)

Abstract

One important application of mobile robots is searching a geographical region to locate the origin of a specific sensible phenomenon. Mapping mine fields, extraterrestrial and undersea exploration, the location of chemical and biological weapons, and the location of explosive devices are just a few potential applications. Teams of “robotic bloodhounds” have a simple common goal; to converge on the location of the source phenomenon, confirm its intensity, and to remain aggregated around it until directed to take some other action. In cases where human intervention through teleoperation is not possible, the robot team must be deployed in a territory without supervision, requiring an autonomous decentralized coordination strategy. This paper presents the alpha-beta coordination strategy, a family of collective search algorithms that are based on dynamic partitioning of the robotic team into two complementary social roles according to a sensor-based status measure. Robots in the alpha role are risk-takers, motivated to improve their status by exploring new regions of the search space. Robots in the beta role are motivated to improve but are conservative, and tend to remain aggregated and stationary until the alpha robots have identified better regions of the search space. Roles are determined dynamically by each member of the team based on the status of the individual robot relative to the current state of the collective. Partitioning the robot team into alpha and beta roles results in a balance between exploration and exploitation, and can yield collective energy savings and improved resistance to sensor noise and defectors. Alpha robots waste energy exploring new territory, and are more sensitive to the effects of ambient noise and to defectors reporting inflated status. Hypothetically, beta robots conserve energy by moving in a direct path to regions of confirmed high status. Beta robots also resist the effects of noise and defectors by averaging status data, but must rely on alpha robots to improve their performance. Alpha-beta is a reactive strategy that requires directed communication of instantaneous sensor data among team members, but does not rely on a domain model. Alpha-beta coordination is a new and ongoing research effort. We present the basic concepts behind the alpha-beta strategy and exhibit preliminary simulation data that illustrate the collective search modes in an idealized search domain.

Keywords

collective robotics collective search reactive coordination emergent behavior collaborative agents 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arkin, R. and References J. 1994. Dimensions of communication and social organization in multi-agent robotic systems. In Proc. Simulation of Adaptive Behavior.Google Scholar
  2. Balch, T. 1997. Social entropy: A new metric for learning multi-robot teams. In Proc. FLAIRS-97.Google Scholar
  3. Brooks, R. 1986. A robust layered control system for a mobile robot. IEEE Journal of Robotics and Automation RA-2.Google Scholar
  4. Brooks, R. 1991. Intelligence without reason. In Proc. IJCAI-91.Google Scholar
  5. Cao, U., Fukunaga, A., Kahng, A., and Meng, F. 1995. Cooperative mobile robotics: Antecedents and directions. In Proc. of IEEE/RSJ IROS.Google Scholar
  6. Goldberg, D. and Mataric, M. 1997. Interference as a tool for designing and evaluating multi-robot controllers. In Proceedings, AAAI-97, Providence, Rhode Island, July 27–31, 1997, 637–642.Google Scholar
  7. Goldsmith, S. and Robinett, R. 1998a. Collaborative search by mobile robots-Part I: Problem definition. In progress. Preprint at www.sandia.gov/aisUrobotics/collaborationGoogle Scholar
  8. Goldsmith, S., and Robinett, R. 1998b. Stability and performance of alpha-beta coordination. Working paper. Preprint: www.sandia.gov/aisUrobotics/ab-stabilityGoogle Scholar
  9. Goss, S., and Deneubourg, J. 1992. Harvesting by a group of robots. In Proc. European Conf on Artificial Life.Google Scholar
  10. Kube, C. and Zhang, H. 1993. Collective robotics: From social insects to robots. Adaptive Behavior, 2(2). Klarer, P. 1998. Flocking small smart machines: An experiment in cooperative multimachine control. Sandia National Laboratories Report. In progress.Google Scholar
  11. Lamport, L., Shostak, R., and Pease, M. “The Byzantine Generals Problem,” ACM Transactions on Programming Languages and Systems 4, 3 (July 1982), 382–401.Google Scholar
  12. Large, E., Henrik, C., Bajcsy, R. 1997. Dynamic Robot Planning: cooperation through competition. In Proceedings of the IEEE International Conference on Robotics and Automation, Albuquerque, NM.Google Scholar
  13. Mataric, M. 1992. Behavior-based systems: Key properties and implications. In IEEE International Conference on Robotics and Automation, Workshop on Architectures for Intelligent Control Systems.Google Scholar
  14. Mataric, M. 1994. Interaction and intelligent behavior. MIT AI Lab Tech report AITR1495.Google Scholar
  15. Mataric, M. 1995. Designing and understanding adaptive group behavior. Adaptive Behavior (4:1).Google Scholar
  16. McFarland, D. 1994. Towards robot cooperation. In Proc. Simulation of Adaptive Behavior.Google Scholar
  17. Spires, S., and Goldsmith, S. 1998. Exhaustive Geographic Search with Mobile Robots Along Space-Filling Curves. Submitted to Collective Robotics Workshop, Agent World `98.Google Scholar
  18. Steels, L. 1990. Cooperation between distributed agents through self-organization. In European Workshop on Modeling Autonomous Agents in a Multi-Agent World.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Steven Y. Goldsmith
    • 1
  • Rush RobinettIII
    • 1
  1. 1.Sandia National LaboratoriesAlbuquerqueUSA

Personalised recommendations