Research graph
References from The multi-robot forest coverage for weighted terrain1. Local targets link to admitted publications; unresolved targets remain external evidence.
10.1007/978-3-642-74341-2
10.1007/978-3-642-74341-2 · External reference
10.1515/9781400831470
10.1515/9781400831470 · External reference
WCA: A weighted clustering algorithm for mobile ad hoc networks
10.1023/a:1013941929408 · 2002 · External reference
10.1145/10515.10518
10.1145/10515.10518 · External reference
Coverage control for mobile sensing networks
10.1109/tra.2004.824698 · 2004 · External reference
Spatially-distributed coverage optimization and control with limited-range interactions
2005 · External reference
10.1007/978-3-642-23719-5_59
10.1007/978-3-642-23719-5_59 · External reference
Unresolved reference
External reference
10.1109/robot.2005.1570204
10.1109/robot.2005.1570204 · External reference
Inapproximability results for guarding polygons without holes
10.1007/3-540-49381-6_45 · 1998 · External reference
Unresolved reference
External reference
10.1109/icra.2011.5979838
10.1109/icra.2011.5979838 · External reference
10.1109/icra.2012.6224694
10.1109/icra.2012.6224694 · External reference
Unresolved reference
External reference
Planning a typical working day for indoor service robots
2011 · External reference
The problem of sensor placement for triangulation-based localisation
10.1504/ijaac.2011.042855 · 2011 · External reference
The problem of sensor placement
2012 · External reference
The set of parameterized k-covers problem
10.1016/j.tcs.2011.12.052 · 2012 · External reference
Task-resource scheduling problem
10.1007/s11633-012-0664-y · 2012 · External reference
Programming for modular reconfigurable robots
10.1134/s0361768812010033 · 2012 · External reference
The far from most string problem
2012 · External reference
On the problem of sensor placement
2012 · External reference
SAT solvers for the problem of sensor placement
2012 · External reference
Clustering algorithm in mobile ad hoc networks
2012 · External reference
The problem of selection of a minimal set of visual landmarks
2012 · External reference
A real-world experiments setup for investigations of the problem of visual landmarks selection for mobile robots
2012 · External reference
Computational experiments for the problem of selection of a minimal set of visual landmarks
2012 · External reference
On the problem of placement of visual landmarks
2012 · External reference
Localization on discrete grid graphs
10.1007/978-94-007-1839-5_105 · 2012 · External reference
10.1109/robot.2006.1641953
10.1109/robot.2006.1641953 · External reference
A visibility-based algorithm for multi-robot boundary coverage
10.5772/5659 · 2008 · External reference
Terrain guarding is NP-hard
10.1137/100791506 · 2011 · External reference
Computational complexity of art gallery problems
10.1109/tit.1986.1057165 · 1986 · External reference
Least squares quantization in PCM
10.1109/tit.1982.1056489 · 1982 · External reference
10.1007/978-3-642-16098-1_7
10.1007/978-3-642-16098-1_7 · External reference
Unresolved reference
External reference
Partially distinguishable guards
2012 · External reference
Sensor placement for triangulation based localization
10.1109/tase.2009.2037135 · 2010 · External reference
Optimizing clustering algorithm in mobile ad hoc networks using genetic algorithmic approach
2002 · External reference
10.1109/robot.2006.1641954
10.1109/robot.2006.1641954 · External reference
Multi-robot forest coverage for weighted and unweighted terrain
10.1109/tro.2010.2072271 · 2010 · External reference
10.1109/mesa.2012.6275533
10.1109/mesa.2012.6275533 · External reference
