Classifying the multi robot path finding problem into a quadratic competitive complexity class (Q1022454): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10472-009-9122-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2088502025
@@ Property / OpenAlex ID: W2088502025 / rank @@
+Normal rank
@@ Property / cites work @@
+Searching in the plane
@@ Property / cites work: Searching in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+Q4704221
@@ Property / cites work: Q4704221 / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning-tree based coverage of continuous areas by a mobile robot
+Normal rank
@@ Property / cites work @@
+Competitive on-line coverage of grid environments by a mobile robot
+Normal rank
@@ Property / cites work @@
+COMPETITIVE COMPLEXITY OF MOBILE ROBOT ON-LINE MOTION PLANNING PROBLEMS
+Normal rank
@@ Property / cites work @@
+Q4736555
@@ Property / cites work: Q4736555 / rank @@
+Normal rank
@@ Property / cites work @@
+Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
+Normal rank