The reset disambiguation policy for navigating stochastic obstacle fields (Q3005837): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Stochastic shortest paths with recourse / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3138961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A likelihood-MPEC approach to target classification / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Shortest paths without a map / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Stochastic shortest path problems with recourse / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Importance sampling for spatial scan analysis: computing scan statistic \(p-\)values for marked point processes. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A polynomial-time algorithm to find shortest paths with recourse / rank | |||
Normal rank |
Latest revision as of 04:14, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The reset disambiguation policy for navigating stochastic obstacle fields |
scientific article |
Statements
The reset disambiguation policy for navigating stochastic obstacle fields (English)
0 references
9 June 2011
0 references
mine countermeasures
0 references
probabilistic path planning
0 references
random disambiguation path
0 references
tangent arc graph
0 references
Markov decision process
0 references
0 references