Discrete search with multiple sensors
dc.contributor.author | Song, Nah-Oak | en_US |
dc.contributor.author | Teneketzis, Demosthenis | en_US |
dc.date.accessioned | 2006-09-11T16:32:04Z | |
dc.date.available | 2006-09-11T16:32:04Z | |
dc.date.issued | 2004-09 | en_US |
dc.identifier.citation | Song, Nah-Oak; Teneketzis, Demosthenis; (2004). "Discrete search with multiple sensors." Mathematical Methods of Operational Research 60(1): 1-13. <http://hdl.handle.net/2027.42/45842> | en_US |
dc.identifier.issn | 1432-2994 | en_US |
dc.identifier.issn | 1432-5217 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/45842 | |
dc.description.abstract | A stationary object is hidden in location i , i =1,2,..., K , with probability p i . There are M sensors available and each location can be searched by at most one sensor at each instant of time. Each search of a location takes one unit of time and is conducted independently of previous searches, so that a search of location i finds the object, if it is in that location, with probability α i . After each search of a location a sensor may either continue to search the same location or switch without any delay to another location. We determine optimal search strategies that maximize the total probability of successful search in N units of time, discuss an implementation of an optimal search strategy, and specify conditions under which the solution can be obtained by a forward induction argument. Finally, we discuss the relationship to multi-armed bandits with multiple plays. | en_US |
dc.format.extent | 248078 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Springer-Verlag | en_US |
dc.subject.other | Gittins Index | en_US |
dc.subject.other | Multiple Sensors | en_US |
dc.subject.other | Economics | en_US |
dc.subject.other | Search Problem | en_US |
dc.subject.other | Multi-armed Bandits | en_US |
dc.subject.other | Forward Induction | en_US |
dc.title | Discrete search with multiple sensors | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Industrial and Operations Engineering | en_US |
dc.subject.hlbsecondlevel | Industrial and Operations Engineering | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Electrical Engineering and Computer Science, , University of Michigan, , 1301 Beal Avenue, Ann Arbor, MI 48109-2122 | en_US |
dc.contributor.affiliationother | Advanced Network Technologies Division, , National Institute of Standards and Technology, , 100 Bureau Dr. Stop 8920, Gaithersburg, MD 20899-8920 | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/45842/1/186_2004_Article_360.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/s001860400360 | en_US |
dc.identifier.source | Mathematical Methods of Operational Research | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.