Strategic Searching Approaches in a Multi-Robot System

Yan Meng, Ke Cao

2006

Abstract

In a partially known dynamic environment, two multi-robot strategic searching approaches are proposed in this paper: utility greedy approach and game theoretic approach. It is assumed that a-priori probabilities of the targets’ distributions are provided. A one-step dynamic-programming is used to formalize the utility functions for both approaches, which not only depends on the targets’ distribution probabilities, but also on travel cost. Extensive simulation results shows that the proposed approaches are more efficient and robust compared to the other heuristic searching strategies, and game theoretic approach guaranteed better worst-case performance and be more robust to handle the environmental uncertainty.

References

  1. Murphy, R.R.: Biomimetic search for urbane search and rescue. IEEE/RSJ International Conference on Intelligent Robots and Systems, vol. 3, pp. 2073-2078 (2000).
  2. Bourgault, F, Furukawa, T., and Durrant-Whyte, H.F.: Coordinated decentralized search for a lost target in a bayesian world. IEEE/RSJ International Conference on Intelligent Robots and Systems (2003).
  3. Lau, H, Huang, S., and Dissanayake, G. :Optimal search for multiple targets in a built environment. IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'05), Edmonton, Alberta, Canada (2005).
  4. L'opez-Ortiz1, A., and Schuierer, S. : Online parallel heuristics and robot searching under the competitive framework. 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5 (2002).
  5. Kao, M., Reif, J. H., and Tate, S. R.:Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, pages 441-447 (1993).
  6. Baeza-Yates, R., Culberson, J., and Rawlins, R.: Searching in the plane. Informationand Computation, 106:234-252 (1993).
  7. Skrzypczyk, K.: Game theory based target following by a team of robots. Fourth International Workshop on Robot Motion and Control, June 17-20 (2004).
  8. LaValle, S., and Hutchinson, S.: Path selection and coordination for multiple robots via Nash equilibria. Proc. IEEE Int. Conf. Robot and Automation, pp. 1847-1852 (1994).
  9. Hespanha, J. P., Prandini, M., and Sastry, S.:Probabilistic pursuit-evasion games: a onestep Nash approach. In proc. of the 39th conf. on decision and control, vol. 3, (2000).
Download


Paper Citation


in Harvard Style

Meng Y. and Cao K. (2006). Strategic Searching Approaches in a Multi-Robot System . In Proceedings of the 2nd International Workshop on Multi-Agent Robotic Systems - Volume 1: MARS, (ICINCO 2006) ISBN 978-972-8865-66-5, pages 106-111. DOI: 10.5220/0001222501060111


in Bibtex Style

@conference{mars06,
author={Yan Meng and Ke Cao},
title={Strategic Searching Approaches in a Multi-Robot System},
booktitle={Proceedings of the 2nd International Workshop on Multi-Agent Robotic Systems - Volume 1: MARS, (ICINCO 2006)},
year={2006},
pages={106-111},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001222501060111},
isbn={978-972-8865-66-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 2nd International Workshop on Multi-Agent Robotic Systems - Volume 1: MARS, (ICINCO 2006)
TI - Strategic Searching Approaches in a Multi-Robot System
SN - 978-972-8865-66-5
AU - Meng Y.
AU - Cao K.
PY - 2006
SP - 106
EP - 111
DO - 10.5220/0001222501060111