Autonomous Search in Complex Spaces

  • Erol Gelenbe
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1513)

Abstract

The search for information in a complex system space-such as the Web or large digital libraries, or in an unkown robotics environment-requires the design of efficient and intelligent strategies for (1) determining regions of interest using a variety of sensors, (2) detecting and classifying objects of interest, and (3) searching the space by autonomous agents. This paper discusses strategies for directing autonomous search based on spatio-temporal distributions. We discuss a model for search assuming that the environment is static, except for the effect of identifying object locations. Algorithms are designed and compared for autonomously directing a robot.

Keywords

Search Optimal Strategies Greedy and Infinite Horizon Algorithms 

References

  1. 1.
    A.C. Kamil, F. Lindstrom, J. Peters “The detwection of cryptic prey by blue jays (Cyanocitta cristata): I. The effects of travel time”, Animal Behaviour Vol. 33(4) pp. 1068–1079, 1985.CrossRefGoogle Scholar
  2. 2.
    J. McNamara, A. Houston “A simple model of information use in the exploitation of patchily distributed food”, Animal Behaviour Vol. 33(2), pp. 553–560, 1985.CrossRefGoogle Scholar
  3. 3.
    C. Jorgensen, W. Hamel and C. Weisbin. “Autonomous robot navigation”, BYTE, Vol. 11, pp. 223–235, Jan. 1986.Google Scholar
  4. 4.
    N. Rao “Algorithmic framework for learned robot navigation in unknown terrains” Computer pp. 37–43, 1989.Google Scholar
  5. 5.
    P. Pf. Spelt, E. Lyness and G. deSaussure. “Developpment and training of a learning expert system in an autonomous mobile robor via simulation”, Simulation, pp. 223–228, 1989.Google Scholar
  6. 6.
    C.R. Weisbin, G. deSaussure, J.R. Einstein and F.G. Pin. “Autonomous mobile robot navigation and learning”, Computer pp. 29–35, 1989.Google Scholar
  7. 7.
    Gelenbe E., “Random neural networks with negative and positive signals and product form solution”, Neural Computation, Vol. 1, No. 4, pp 502–511, 1989.CrossRefGoogle Scholar
  8. 8.
    Gelenbe E., “Stability of the random neural network model”, Neural Computation, Vol. 2, No. 2, pp. 239–247, 1990.CrossRefGoogle Scholar
  9. 9.
    Z. Shiller and Y.R. Gwo. Dynamic Motion Planning of Autonomous Vehicles. IEEE Transaction On Robotics and Automation, Vol. 7, no. 2, pp. 241–249, 1991.CrossRefGoogle Scholar
  10. 10.
    G. Beni and J. Wang. Theoretical problems for the realization of Distributed Robotic Systems. Proc. IEEE Int. Conf. on Robotics and Automation, pp. 1914–1920, 1991.Google Scholar
  11. 11.
    M.J. Mataric, “Distributed approaches to behavior control”, Proc. SPIE, Vol. 1828, Sensor Fusion V, pp. 373–382, 1992.Google Scholar
  12. 12.
    Y. Shoham and M. Tennenholtz “On the synthesis of useful social laws for artificial agent societies”, Proc. 10th National Conf. on Artificial Intelligence, pp. 276–281, 1992.Google Scholar
  13. 13.
    S. Gross and J.L. Deneubourg, “Harvesting by a group of robots” Proc. 1st European Conf. on Artificial Life, pp. 195–204, 1992.Google Scholar
  14. 14.
    G. Lucarini, M. Varoli, R. Cerutti, and G. Sandini, “Cellular Robotics: simulation and hardware implementation” Proc. IEEE Int. Conf. on Robotics and Automation, pp. 846–852, 1993.Google Scholar
  15. 15.
    T. Ueyama and T. Fukuda. “Self-organization of Cellular Robots using random walk with simple rules”, Proc. IEEE Int. Conf. on Robotics and Automation, pp. 595–600, 1993.Google Scholar
  16. 16.
    N. Schmajuk, H.T. Blair “Place learning and the dynamics of spatial navigation: A neural network approach,” Adaptive Behavior Vol. 1, No. 3, pp. 353–385, 1993.CrossRefGoogle Scholar
  17. 17.
    N. Schmajuk, A.D. Thieme, H.T. Blair “Maps, routes, and the Hippocampus: A neural network approach”, Hippocampus, Vol. 3, No. 3, pp. 387–400, 1993.CrossRefGoogle Scholar
  18. 18.
    D. Maio, and S. Rizzi. “Map Learning and Clustering in Autonomous Systems”, IEEE Transaction On Pattern Analysis And Machine Intelligence, Vol. 15, no. 12, pp. 1286–1297, 1993.CrossRefGoogle Scholar
  19. 19.
    E. Hou and D. Zheng “Mobile robot path planning based on hierarchical hexagonal decomposition and artificial potential fields”, Journal of Robotic Systems, pp. 605–614, 1994.Google Scholar
  20. 20.
    L.E. Parker “Designing control laws for cooperative agent teams”, Proc. IEEE Int. Conf. on Robotics and Automation, pp. 582–587, 1994.Google Scholar
  21. 21.
    E. Rimon and J.F. Canny “Construction of C-space roadmaps from local sensory data: What should the sensors look for?”, Proc. IEEE Int. Conf. on Robotics and Automation, pp. 117–123, 1994.Google Scholar
  22. 22.
    J.A. Meyer, H.L. Roitblat and S.W. Wilson (eds.) “From Animals to Animats 2: Proceedings of the Second International Conference on Simulation of Adaptive Behavior (Complex adaptive systems)” pp. 432–510. MIT Press, Cambridge, MA, 523 p., 1992.Google Scholar
  23. 23.
    J. Reif and H. Wang, “Social potential fields: A distributed behavioral control for autonomous robots”, Proc. Workshop on the Algorithmic Foundations of Robotics, pp. 331–345, 1994.Google Scholar
  24. 24.
    S. Benhamou “Spatial memory and searching efficiency,” Animal Behaviour Vol. 47(6), pp. 1423–1433, 1994.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Erol Gelenbe
    • 1
  1. 1.School of Computer ScienceUniversity of Central FloridaOrlando

Personalised recommendations