Criteria and approximate methods for path-constrained moving-target search problems (Q4698128)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Criteria and approximate methods for path-constrained moving-target search problems |
scientific article; zbMATH DE number 754939
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Criteria and approximate methods for path-constrained moving-target search problems |
scientific article; zbMATH DE number 754939 |
Statements
26 October 1995
0 references
moving-target search problems
0 references
Markov process
0 references
search path
0 references
partially observable Markov decision process
0 references
approximate solutions procedures
0 references
Criteria and approximate methods for path-constrained moving-target search problems (English)
0 references
0.9348645
0 references
0.9143778
0 references
0.90831304
0 references
0.9021048
0 references
