Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem (Q2962565): 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.1287/ijoc.2013.0571
+Normal rank
@@ Property / OpenAlex ID @@
+W2127372295
@@ Property / OpenAlex ID: W2127372295 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal obstacle placement with disambiguations
@@ Property / cites work: Optimal obstacle placement with disambiguations / rank @@
+Normal rank
@@ Property / cites work @@
+The reset disambiguation policy for navigating stochastic obstacle fields
+Normal rank
@@ Property / cites work @@
+Efficient, optimal stochastic-action selection when limited by an action budget
+Normal rank
@@ Property / cites work @@
+Probabilistic planning with clear preferences on missing information
+Normal rank
@@ Property / cites work @@
+Shortest paths without a map
@@ Property / cites work: Shortest paths without a map / rank @@
+Normal rank
@@ Property / cites work @@
+Random disambiguation paths for traversing a mapped hazard field
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm to find shortest paths with recourse
+Normal rank
@@ Property / cites work @@
+The Canadian Traveller Problem and its competitive analysis
+Normal rank