Abstract
No public abstract is available from the verified source records.
Contact and support
Need help, have a question, or want to contact the ResearchHub team?
© 2026 ResearchHub. Built for responsible scholarly connection.
Privacy-aware community infrastructureAnna Gorbenko
Abstract
Authors
Institutions
No ROR-resolved institution is linked to this work yet.
Provenance
crossref
Confidence 100%
unpaywall
Confidence 95%
datacite
Confidence 0%
No local reference links have been materialized yet.
No local citing links have been materialized yet.
10.1007/978-3-642-74341-2
10.1007/978-3-642-74341-2
10.1515/9781400831470
10.1515/9781400831470
WCA: A weighted clustering algorithm for mobile ad hoc networks
10.1023/a:1013941929408 · 2002
10.1145/10515.10518
10.1145/10515.10518
Coverage control for mobile sensing networks
10.1109/tra.2004.824698 · 2004
Spatially-distributed coverage optimization and control with limited-range interactions
2005
10.1007/978-3-642-23719-5_59
10.1007/978-3-642-23719-5_59
Unresolved referenced work
Kept as external metadata until matched
10.1109/robot.2005.1570204
10.1109/robot.2005.1570204
Inapproximability results for guarding polygons without holes
10.1007/3-540-49381-6_45 · 1998
Unresolved referenced work
Kept as external metadata until matched
10.1109/icra.2011.5979838
10.1109/icra.2011.5979838
10.1109/icra.2012.6224694
10.1109/icra.2012.6224694
Unresolved referenced work
Kept as external metadata until matched
Planning a typical working day for indoor service robots
2011
The problem of sensor placement for triangulation-based localisation
10.1504/ijaac.2011.042855 · 2011
The problem of sensor placement
2012
The set of parameterized k-covers problem
10.1016/j.tcs.2011.12.052 · 2012
Task-resource scheduling problem
10.1007/s11633-012-0664-y · 2012
Programming for modular reconfigurable robots
10.1134/s0361768812010033 · 2012
The far from most string problem
2012
On the problem of sensor placement
2012
SAT solvers for the problem of sensor placement
2012
Clustering algorithm in mobile ad hoc networks
2012
The problem of selection of a minimal set of visual landmarks
2012
A real-world experiments setup for investigations of the problem of visual landmarks selection for mobile robots
2012
Computational experiments for the problem of selection of a minimal set of visual landmarks
2012
On the problem of placement of visual landmarks
2012
Localization on discrete grid graphs
10.1007/978-94-007-1839-5_105 · 2012
10.1109/robot.2006.1641953
10.1109/robot.2006.1641953
A visibility-based algorithm for multi-robot boundary coverage
10.5772/5659 · 2008
Terrain guarding is NP-hard
10.1137/100791506 · 2011
Computational complexity of art gallery problems
10.1109/tit.1986.1057165 · 1986
Least squares quantization in PCM
10.1109/tit.1982.1056489 · 1982
10.1007/978-3-642-16098-1_7
10.1007/978-3-642-16098-1_7
Unresolved referenced work
Kept as external metadata until matched
Partially distinguishable guards
2012
Sensor placement for triangulation based localization
10.1109/tase.2009.2037135 · 2010
Optimizing clustering algorithm in mobile ad hoc networks using genetic algorithmic approach
2002
10.1109/robot.2006.1641954
10.1109/robot.2006.1641954
10.1109/mesa.2012.6275533
10.1109/mesa.2012.6275533 · doi-reference
Multi-robot forest coverage for weighted and unweighted terrain
10.1109/tro.2010.2072271 · doi-reference