The problem of sensor placement for triangulation-based localisation

Problems of sensor placement for intelligent environments of robotic testbeds

“…In this section, we consider SAT solvers for explicit polynomial reductions from SP to MAXSAT and 3SAT (see [14,15]) and for the explicit polynomial reduction from SPP to 3SAT (see [18]). Note that some SAT solvers for SP and SPP were considered in [16,18].…”

“…Note that some SAT solvers for SP and SPP were considered in [16,18]. In this section, we consider A1 genetic algorithm with expansion and exploration operators for MAXSAT (see [22]);…”

“…It should be noted that different sensor placement problems received a lot of attention recently (see e.g. [12] - [18]). In particular, it were obtained explicit polynomial reductions from the problem of sensor placement SP to MAXSAT, SAT and 3SAT (see [14,15]).…”

“…In particular, it were obtained explicit polynomial reductions from the problem of sensor placement SP to MAXSAT, SAT and 3SAT (see [14,15]). Explicit polynomial reductions from the decision version of the problem of sensor placement for triangulation based localization SPP to SAT and 3SAT were proposed in [18]. It is easy to see that we can use SP and SPP to solve problems of sensor placement for intelligent environments of robotic testbeds.…”

An intelligent gradient detector for monitoring of passenger flows

“…In particular, we can mention visual navigation in robotics (see e.g. [5] - [24]). In this paper, we study the problem of monitoring of passenger flows and consider an intelligent gradient algorithm to solve the problem.…”