Honey-pot constrained searching with local sensory information (Q2507866): 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.1016/j.na.2005.10.049
+Normal rank
@@ Property / OpenAlex ID @@
+W2103649577
@@ Property / OpenAlex ID: W2103649577 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952696
@@ Property / cites work: Q4952696 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040684
@@ Property / cites work: Q4040684 / rank @@
+Normal rank
@@ Property / cites work @@
+The Optimal Search for a Moving Target When the Search Path Is Constrained
+Normal rank
@@ Property / cites work @@
+An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for Euclidean Shortest Paths in the Plane
+Normal rank
@@ Property / cites work @@
+Hamilton Paths in Grid Graphs
@@ Property / cites work: Hamilton Paths in Grid Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952698
@@ Property / cites work: Q4952698 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
+Normal rank
@@ Property / cites work @@
+Q3833854
@@ Property / cites work: Q3833854 / rank @@
+Normal rank
@@ Property / cites work @@
+Discrete Sequential Search with Positive Switch Cost
+Normal rank
@@ Property / cites work @@
+Q3033693
@@ Property / cites work: Q3033693 / rank @@
+Normal rank
@@ Property / cites work @@
+A singular perturbation approach to modeling and control of Markov chains
+Normal rank
@@ Property / cites work @@
+Q4936005
@@ Property / cites work: Q4936005 / rank @@
+Normal rank
@@ Property / cites work @@
+Theory of optimal search
@@ Property / cites work: Theory of optimal search / rank @@
+Normal rank
@@ Property / cites work @@
+Technical Note—The Complexity of the Optimal Searcher Path Problem
+Normal rank