Sciweavers

23 search results - page 2 / 5
» Adversarial Modeling in the Robotic Coverage Problem
Sort
View
ICRA
2007
IEEE
129views Robotics» more  ICRA 2007»
13 years 11 months ago
Robust Distributed Coverage using a Swarm of Miniature Robots
Abstract— For the multi-robot coverage problem deterministic deliberative as well as probabilistic approaches have been proposed. Whereas deterministic approaches usually provide...
Nikolaus Correll, Alcherio Martinoli
AMAI
2008
Springer
13 years 5 months ago
Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm
We study distributed boundary coverage of known environments using a team of miniature robots. Distributed boundary coverage is an instance of the multi-robot task-allocation prob...
Patrick Amstutz, Nikolaus Correll, Alcherio Martin...
IJRR
2010
115views more  IJRR 2010»
13 years 2 months ago
Improving the Efficiency of Clearing with Multi-agent Teams
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
Geoffrey Hollinger, Sanjiv Singh, Athanasios Kehag...
BMVC
2010
13 years 2 days ago
Multi-View Planning for Simultaneous Coverage and Accuracy Optimisation
View planning for three-dimensional (3D) reconstruction and inspection solves the problem of finding an efficient sequence of views allowing complete and high quality reconstructi...
Christoph Munkelt, Andreas Breitbarth, Gunther Not...
FAABS
2004
Springer
13 years 10 months ago
Two Formal Gas Models for Multi-agent Sweeping and Obstacle Avoidance
Abstract. The task addressed here is a dynamic search through a bounded region, while avoiding multiple large obstacles, such as buildings. In the case of limited sensors and commu...
Wesley Kerr, Diana F. Spears, William M. Spears, D...