Navigation among visually connected sets of partially distinguishable landmarks

A robot navigates in a polygonal region populated by a set of partially distinguishable landmarks. The robot's motion primitives consist of actions of the form “drive toward a landmark of class x”. To effectively navigate, the robot must always be able to see a landmark. Also, if the robot sees two landmarks of the same class, its motion primitives become ambiguous. Finally, if the robot wishes to navigate from landmark s
₀
to landmark s
_goal
with a simple graph search algorithm, then there must be a sequence of landmarks [s
₀
, s
₁
, s
₂
, ..., s
_k
= s
_goal
], in which landmark s
_i
is visible from s
_i-1
. Given these three conditions, how many landmark classes are required for navigation in a given polygon P? We call this minimum number of landmark classes the connected landmark class number, denoted
_χCL
(P). We study this problem for the monotone polygons, an important family of polygons that are frequently generated as intermediate steps in other decomposition algorithms. We demonstrate that for all odd k, there exists a monotone polygon M
_k
with 3 over 4 (k
²
+ 2k + 1) vertices such that
_χCL
(P) ≥ k. We also demonstrate that for any n-vertex monotone polygon P,
_χCL
(P) ≤ n/3 + 12.