The protection of pathways holds immense significance across various domains, including urban planning, transportation, surveillance, and security. This article introduces a groundbreaking approach to safeguarding pathways by employing orthogonal robots. The study specifically addresses the challenge of efficiently guarding orthogonal areas with the minimum number of orthogonal robots. The primary focus is on orthogonal pathways, characterized by a path-like dual graph of vertical decomposition. It is demonstrated that determining the minimum number of orthogonal robots for pathways can be achieved in linear time. However, it is essential to note that the general problem of finding the minimum number of robots for simple polygons with general visibility, even in the orthogonal case, is known to be NP-hard. Emphasis is placed on the flexibility of placing robots anywhere within the polygon, whether on the boundary or in the interior.

通过利用正交机器人的创新方法来保护路径，研究旨在以最小数量的正交机器人高效地守卫正交区域，重点研究具有垂直分解路径状双图特征的正交路径，并发现在线性时间内确定路径所需的最小正交机器人数量是可行的。但需要注意，即使在正交情况下，对于具有普通可见性的简单多边形寻找最小机器人数量的问题是已知NP-hard问题，本文强调机器人可以灵活地放置在多边形的边界或内部。

利用正交机器人保护路径