On competitive search games for multiple vehicles

Minghui Zhu, Emilio Frazzoli

Research output: Contribution to journalConference article

2 Citations (Scopus)

Abstract

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
DOIs
StatePublished - Dec 1 2012
Event51st IEEE Conference on Decision and Control, CDC 2012 - Maui, HI, United States
Duration: Dec 10 2012Dec 13 2012

Fingerprint

Search Game
Game
Nash Equilibrium
Probability density function
Target
Counterexample
Ring
Sufficient Conditions

All Science Journal Classification (ASJC) codes

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

Cite this

@article{4d7b96272f454aad81af398e4297f377,
title = "On competitive search games for multiple vehicles",
abstract = "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.",
author = "Minghui Zhu and Emilio Frazzoli",
year = "2012",
month = "12",
day = "1",
doi = "10.1109/CDC.2012.6426371",
language = "English (US)",
pages = "5798--5803",
journal = "Proceedings of the IEEE Conference on Decision and Control",
issn = "0191-2216",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

On competitive search games for multiple vehicles. / Zhu, Minghui; Frazzoli, Emilio.

In: Proceedings of the IEEE Conference on Decision and Control, 01.12.2012, p. 5798-5803.

Research output: Contribution to journalConference article

TY - JOUR

T1 - On competitive search games for multiple vehicles

AU - Zhu, Minghui

AU - Frazzoli, Emilio

PY - 2012/12/1

Y1 - 2012/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84874257113&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84874257113&partnerID=8YFLogxK

U2 - 10.1109/CDC.2012.6426371

DO - 10.1109/CDC.2012.6426371

M3 - Conference article

AN - SCOPUS:84874257113

SP - 5798

EP - 5803

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

SN - 0191-2216

M1 - 6426371

ER -