Abstract. We investigate the online exploration problem of a shortsighted mobile robot moving in an unknown cellular room without obstacles. The robot has a very limited sensor; it...
Christian Icking, Thomas Kamphans, Rolf Klein, Elm...
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
While 802.11-based wireless hotspots are proliferating, users often have little recourse when the network does not work or performs poorly for them. They are left trying to manual...
Ranveer Chandra, Venkata N. Padmanabhan, Ming Zhan...
Abstract – We present a method for quickly determining the minimum distance between multiple known and multiple unkown objects within a camera image. Known objects are objects wi...
— We consider the problem of tracking multiple moving robots using noisy sensing of inter-robot and interbeacon distances. Sensing is local: there are three fixed beacons at kno...
Jeremy Schiff, Erik B. Sudderth, Kenneth Y. Goldbe...