Visibility-based pursuit-evasion in a polygonal environment (Q5096922): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-63307-3_45
+Normal rank
@@ Property / OpenAlex ID @@
+W1816496481
@@ Property / OpenAlex ID: W1816496481 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic noncooperative game theory
@@ Property / cites work: Dynamic noncooperative game theory / rank @@
+Normal rank
@@ Property / cites work @@
+Monotonicity in graph searching
@@ Property / cites work: Monotonicity in graph searching / rank @@
+Normal rank
@@ Property / cites work @@
+Optimum watchman routes
@@ Property / cites work: Optimum watchman routes / rank @@
+Normal rank
@@ Property / cites work @@
+SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
+Normal rank
@@ Property / cites work @@
+Randomization for robot tasks: using dynamic programming in the space of knowledge states
+Normal rank
@@ Property / cites work @@
+Primitives for the manipulation of general subdivisions and the computation of Voronoi
+Normal rank
@@ Property / cites work @@
+Q4848595
@@ Property / cites work: Q4848595 / rank @@
+Normal rank
@@ Property / cites work @@
+Pursuit games. An introduction to the theory and applications of differential games of pursuit and evasion
+Normal rank
@@ Property / cites work @@
+Q5331036
@@ Property / cites work: Q5331036 / rank @@
+Normal rank
@@ Property / cites work @@
+Recontamination does not help to search a graph
@@ Property / cites work: Recontamination does not help to search a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3661483
@@ Property / cites work: Q3661483 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of searching a graph
@@ Property / cites work: The complexity of searching a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Min Cut is NP-complete for edge weighted trees
@@ Property / cites work: Min Cut is NP-complete for edge weighted trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q3799261
@@ Property / cites work: Q3799261 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4159394
@@ Property / cites work: Q4159394 / rank @@
+Normal rank
@@ Property / cites work @@
+Searching for a Mobile Intruder in a Polygonal Region
+Normal rank