| M. A. Batalin and G. S. Sukhatme, "Efficient exploration without localization," in To appear in Proc. of IEEE International Conference on Robotics and Automation (ICRA'03), Taipei, Taiwan, 2003. |
....accordance to the potential will never hit obstacles, but it may get stuck in local minima. We combine these two methods to find the best path to the goal, which is safe and short, and modify them to exploit the distributed nature of sensor networks. Another related work by Batalin and Sukhatme [1] is to address the problem of coverage and exploration of an unknown dynamic environment using a mobile robot by using beacons. The beacons (markers) that form a communication network are used a support infrastructure to aid exploration of the mobile robot. III. A DISTRIBUTED ALGORITHM FOR ....
M. Batalin and G.S. Sukhatme. Efficient exploration without localization. In Int. Conference on Robotics and Automation (ICRA), Taipei, May 2003.
No context found.
M. A. Batalin and G. S. Sukhatme, "Efficient exploration without localization," in To appear in Proc. of IEEE International Conference on Robotics and Automation (ICRA'03), Taipei, Taiwan, 2003.
No context found.
M. A. Batalin and G. S. Sukhatme, "Efficient exploration without localization," in In Proc. of IEEE International Conference on Robotics and Automation (ICRA'03), Taipei, Taiwan, 2003, pp. 2714--2719.
No context found.
Maxim A. Batalin,Gaurav S. Sukhatme, "Efficient Exploration without Localization", To appear in International Conference on Robotics and Automation, ICRA2003
....more stable than the exploration only algorithm. I. INRODUCTION This paper presents DINTA, Distributed In network Task Allocation a novel paradigm for multi robot task allocation (MRTA) where tasks are allocated implicitly to robots by a pre deployed, static sensor network. In prior work [1] [2] we have developed an algorithm for the deployment, and maintainance of such a static network by robots. We have also developed algorithms for exploration and navigation [1] 2] where robots use the deployed network to efficiently explore their environment and navigate to a designated goal. In ....
....(MRTA) where tasks are allocated implicitly to robots by a pre deployed, static sensor network. In prior work [1] 2] we have developed an algorithm for the deployment, and maintainance of such a static network by robots. We have also developed algorithms for exploration and navigation [1] [2] where robots use the deployed network to efficiently explore their environment and navigate to a designated goal. In this paper, we assume the network is pre deployed (through means outlined in [1] 2] and robots have to perform spatially and temporally distributed tasks efficiently. Our ....
[Article contains additional citation context not shown here]
M. A. Batalin and G. S. Sukhatme, "Efficient exploration without localization," in To appear in Proc. of IEEE International Conference on Robotics and Automation (ICRA'03), Taipei, Taiwan, 2003.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC