On competitive search games for multiple vehicles

Minghui Zhu, Emilio Frazzoli

Research output: Contribution to journalConference articlepeer-review

4 Scopus citations


We investigate the competitive search game where a group of vehicles compete to locate the target on a ring in 2 where the probability density function of the target is known a priori. In order to compute Nash strategies for vehicles, we first perform a game reduction and determine an auxiliary Nash game which, on one hand, has a much smaller dimension, and on the other hand, is equivalent to the competitive search game. For the auxiliary Nash game, we first provide a counter-example where Nash equilibrium does not exist. Then we study computation algorithms to seek a class of constrained Nash equilibrium under certain sufficient conditions.

Original languageEnglish (US)
Article number6426371
Pages (from-to)5798-5803
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
StatePublished - 2012
Event51st IEEE Conference on Decision and Control, CDC 2012 - Maui, HI, United States
Duration: Dec 10 2012Dec 13 2012

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization


Dive into the research topics of 'On competitive search games for multiple vehicles'. Together they form a unique fingerprint.

Cite this