The reset disambiguation policy for navigating stochastic obstacle fields (Q3005837): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/nav.20454
@@ Property / full work available at URL: https://doi.org/10.1002/nav.20454 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2025252735
@@ Property / OpenAlex ID: W2025252735 / rank @@
+Normal rank
@@ Property / cites work @@
+Stochastic shortest paths with recourse
@@ Property / cites work: Stochastic shortest paths with recourse / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138961
@@ Property / cites work: Q3138961 / rank @@
+Normal rank
@@ Property / cites work @@
+A likelihood-MPEC approach to target classification
+Normal rank
@@ Property / cites work @@
+Shortest paths without a map
@@ Property / cites work: Shortest paths without a map / rank @@
+Normal rank
@@ Property / cites work @@
+Stochastic shortest path problems with recourse
@@ Property / cites work: Stochastic shortest path problems with recourse / rank @@
+Normal rank
@@ Property / cites work @@
+Importance sampling for spatial scan analysis: computing scan statistic \(p-\)values for marked point processes.
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm to find shortest paths with recourse
+Normal rank