The problem of selection of a set of partially distinguishable guards

Abstract

In this paper we consider the problem of selection of a set of partially distinguishable guards. We describe an approach to solve the problem. This approach is based on an explicit reduction from the problem to the satisfiability problem.

Task-Level Learning from Demonstration and Generation of Action Examples for Hierarchical Control Structure

“…It is well known that visual landmarks are extensively used in simple mobile robot navigation (see e.g. [11][12][13]). So, we can try to apply the hierarchical approach to task-level robot learning from demonstration to some problem of visual landmark navigation.…”

Graph-Theoretic Models for the Module of Safe Planning for Control Systems of Mobile Robots

“…[12]), the problem of selection of a minimal set of visual landmarks (see e.g. [13,14]), selection of partially distinguishable guards (see e.g. [15]), the problem of placement of visual landmarks (see e.g.…”

Self-Learning of Robots and the Model of Hamiltonian Path with Fixed Number of Color Repetitions for Systems of Scenarios Creation

“…Among other examples we can mention various problems of visual navigation (see e.g. [1][2][3][4][5]), planning (see e.g. [6][7][8][9][10]), robot self-awareness (see e.g.…”