论文信息 - SAT Solvers for the Problem of Sensor Placement

SAT Solvers for the Problem of Sensor Placement

In this paper we consider an approach to solve the problem of sensor placement. This approach is based on constructing SAT solvers for logical models of the problem. PACS: 42.30.Tz

Anna Gorbenko | Vladimir Popov

[1] Anna Gorbenko,et al. Programming for Modular Reconfigurable Robots , 2011 .

[2] A. Gorbenko,et al. The Longest Common Subsequence Problem , 2012 .

[3] Andrey S. Krylov,et al. The problem of sensor placement for triangulation-based localisation , 2011, Int. J. Autom. Control..

[4] Andrey Sheka,et al. Robot self-awareness: Temporal relation based data mining , 2011 .

[5] Anna Gorbenko,et al. The Binary Paint Shop Problem , 2012 .

[6] Anna Gorbenko,et al. The Problem of Sensor Placement , 2012 .

[7] Andrey Sheka,et al. Localization on Discrete Grid Graphs , 2012 .

[8] A. Gorbenko,et al. Algebras of Stepping Motor Programs , 2011 .

[9] Vladimir Yu. Popov,et al. The set of parameterized k-covers problem , 2012, Theor. Comput. Sci..

[10] Anna Gorbenko,et al. The problem of placement of visual landmarks , 2011 .

[11] A. Gorbenko,et al. The longest common parameterized subsequence problem , 2012 .

[12] Anna Gorbenko,et al. Task-resource scheduling problem , 2012, International Journal of Automation and Computing.

[13] A. Gorbenko,et al. Planning a Typical Working Day for Indoor Service Robots , 2011 .

[14] Anna Gorbenko,et al. Computational Experiments for the Problem of Selection of a Minimal Set of Visual Landmarks , 2012 .

[15] Anna Gorbenko,et al. A Real-World Experiments Setup for Investigations of the Problem of Visual Landmarks Selection for Mobile Robots , 2012 .