The Search for an Alerted Moving Target

The Search for an Alerted Moving Target

We investigate a two-sided, multi-stage search problem where a continuous search effort is made by one or more search units to detect a moving target in a continuous target space, under noisy detection conditions. A specific example of this problem is hunting for an enemy submarine by naval forces....

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:The Journal of the Operational Research Society. - Taylor & Francis, Ltd.. - 56(2005), 5, Seite 514-525
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2005
Zugriff auf das übergeordnete Werk:The Journal of the Operational Research Society
Schlagworte:Defence studies Optimization Heuristics Decision support system Probability Search theory Applied sciences Mathematics Behavioral sciences Philosophy Social sciences
LEADER 01000caa a22002652 4500
001 JST05059205X
003 DE-627
005 20240621182328.0
007 cr uuu---uuuuu
008 150324s2005 xx |||||o 00| ||eng c
035 |a (DE-627)JST05059205X 
035 |a (JST)4102105 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
245 1 4 |a The Search for an Alerted Moving Target 
264 1 |c 2005 
336 |a Text  |b txt  |2 rdacontent 
337 |a Computermedien  |b c  |2 rdamedia 
338 |a Online-Ressource  |b cr  |2 rdacarrier 
520 |a We investigate a two-sided, multi-stage search problem where a continuous search effort is made by one or more search units to detect a moving target in a continuous target space, under noisy detection conditions. A specific example of this problem is hunting for an enemy submarine by naval forces. So far, this problem has not been solved, because of the difficulty of predicting the target's behaviour. In finding promising routes for the search units, a heuristic has been developed. To obtain these routes, at every decision moment in time an optimal point to go to must be determined. This amounts to finding at every decision moment an optimum of a function that changes over time. 
540 |a Copyright 2005 Operational Research Society Ltd 
650 4 |a Defence studies 
650 4 |a Optimization 
650 4 |a Heuristics 
650 4 |a Decision support system 
650 4 |a Probability 
650 4 |a Search theory 
650 4 |a Applied sciences  |x Technology  |x Tools  |x Measuring instruments  |x Sensors 
650 4 |a Mathematics  |x Applied mathematics  |x Statistics  |x Applied statistics  |x Descriptive statistics  |x Statistical distributions  |x Distribution functions  |x Probability distributions  |x Mathematical moments 
650 4 |a Behavioral sciences  |x Psychology  |x Cognitive psychology  |x Cognitive processes  |x Problem solving  |x Heuristics 
650 4 |a Philosophy  |x Metaphysics  |x Etiology  |x Determinism 
650 4 |a Behavioral sciences  |x Psychology  |x Cognitive psychology  |x Decision theory  |x Operations research 
650 4 |a Mathematics  |x Pure mathematics  |x Probability theory  |x Probabilities  |x Conditional probabilities 
650 4 |a Mathematics  |x Mathematical expressions  |x Mathematical functions  |x Weighting functions 
650 4 |a Mathematics  |x Pure mathematics  |x Geometry  |x Euclidean geometry  |x Plane geometry  |x Vertices 
650 4 |a Applied sciences  |x Engineering  |x Transportation  |x Vehicles  |x Watercraft  |x Military vessels  |x Frigates 
650 4 |a Social sciences  |x Communications  |x Semiotics  |x Signals  |x Case-Oriented Papers 
655 4 |a research-article 
773 0 8 |i Enthalten in  |t The Journal of the Operational Research Society  |d Taylor & Francis, Ltd.  |g 56(2005), 5, Seite 514-525  |w (DE-627)320465098  |w (DE-600)2007775-0  |x 14769360  |7 nnns 
773 1 8 |g volume:56  |g year:2005  |g number:5  |g pages:514-525 
856 4 0 |u https://www.jstor.org/stable/4102105  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_JST 
912 |a GBV_ILN_11 
912 |a GBV_ILN_20 
912 |a GBV_ILN_22 
912 |a GBV_ILN_23 
912 |a GBV_ILN_24 
912 |a GBV_ILN_31 
912 |a GBV_ILN_39 
912 |a GBV_ILN_40 
912 |a GBV_ILN_60 
912 |a GBV_ILN_62 
912 |a GBV_ILN_63 
912 |a GBV_ILN_65 
912 |a GBV_ILN_69 
912 |a GBV_ILN_70 
912 |a GBV_ILN_90 
912 |a GBV_ILN_100 
912 |a GBV_ILN_110 
912 |a GBV_ILN_187 
912 |a GBV_ILN_224 
912 |a GBV_ILN_285 
912 |a GBV_ILN_370 
912 |a GBV_ILN_374 
912 |a GBV_ILN_647 
912 |a GBV_ILN_702 
912 |a GBV_ILN_2001 
912 |a GBV_ILN_2003 
912 |a GBV_ILN_2005 
912 |a GBV_ILN_2006 
912 |a GBV_ILN_2007 
912 |a GBV_ILN_2008 
912 |a GBV_ILN_2009 
912 |a GBV_ILN_2010 
912 |a GBV_ILN_2011 
912 |a GBV_ILN_2014 
912 |a GBV_ILN_2015 
912 |a GBV_ILN_2018 
912 |a GBV_ILN_2020 
912 |a GBV_ILN_2021 
912 |a GBV_ILN_2026 
912 |a GBV_ILN_2027 
912 |a GBV_ILN_2034 
912 |a GBV_ILN_2044 
912 |a GBV_ILN_2050 
912 |a GBV_ILN_2056 
912 |a GBV_ILN_2057 
912 |a GBV_ILN_2061 
912 |a GBV_ILN_2088 
912 |a GBV_ILN_2093 
912 |a GBV_ILN_2107 
912 |a GBV_ILN_2111 
912 |a GBV_ILN_2129 
912 |a GBV_ILN_2190 
912 |a GBV_ILN_2336 
912 |a GBV_ILN_2507 
912 |a GBV_ILN_2548 
912 |a GBV_ILN_2935 
912 |a GBV_ILN_2940 
912 |a GBV_ILN_2949 
912 |a GBV_ILN_2950 
912 |a GBV_ILN_4012 
912 |a GBV_ILN_4035 
912 |a GBV_ILN_4037 
912 |a GBV_ILN_4046 
912 |a GBV_ILN_4112 
912 |a GBV_ILN_4126 
912 |a GBV_ILN_4242 
912 |a GBV_ILN_4251 
912 |a GBV_ILN_4305 
912 |a GBV_ILN_4306 
912 |a GBV_ILN_4307 
912 |a GBV_ILN_4313 
912 |a GBV_ILN_4322 
912 |a GBV_ILN_4323 
912 |a GBV_ILN_4324 
912 |a GBV_ILN_4325 
912 |a GBV_ILN_4335 
912 |a GBV_ILN_4346 
912 |a GBV_ILN_4393 
912 |a GBV_ILN_4700 
951 |a AR 
952 |d 56  |j 2005  |e 5  |h 514-525