Results 1 - 10
of
276
Robotic mapping: A survey
- EXPLORING ARTIFICIAL INTELLIGENCE IN THE NEW MILLENIUM
, 2002
"... This article provides a comprehensive introduction into the field of robotic mapping, with a focus on indoor mapping. It describes and compares various probabilistic techniques, as they are presently being applied to a vast array of mobile robot mapping problems. The history of robotic mapping is al ..."
Abstract
-
Cited by 369 (6 self)
- Add to MetaCart
(Show Context)
This article provides a comprehensive introduction into the field of robotic mapping, with a focus on indoor mapping. It describes and compares various probabilistic techniques, as they are presently being applied to a vast array of mobile robot mapping problems. The history of robotic mapping is also described, along with an extensive list of open research problems.
Mobile Sensor Network Deployment using Potential Fields: A Distributed, Scalable Solution to the Area Coverage Problem
, 2002
"... This paper considers the problem of deploying a mobile sensor network in an unknown environment. A mobile sensor network is composed of a distributed collection of nodes, each of which has sensing, computation, communication and locomotion capabilities. Such networks are capable of self-deployment; ..."
Abstract
-
Cited by 343 (15 self)
- Add to MetaCart
This paper considers the problem of deploying a mobile sensor network in an unknown environment. A mobile sensor network is composed of a distributed collection of nodes, each of which has sensing, computation, communication and locomotion capabilities. Such networks are capable of self-deployment; i.e., starting from some compact initial configuration, the nodes in the network can spread out such that the area `covered' by the network is maximized. In this paper, we present a potential-field-based approach to deployment. The fields are constructed such that each node is repelled by both obstacles and by other nodes, thereby forcing the network to spread itself throughout the environment. The approach is both distributed and scalable.
An Online Mapping Algorithm for Teams of Mobile Robots
- International Journal of Robotics Research
, 2001
"... We propose a new probabilistic algorithm for online mapping of unknown environments with teams of robots. At the core of the algorithm is a technique that combines fast maximum likelihood map growing with a Monte Carlo localizer that uses particle representations. The combination of both yields an o ..."
Abstract
-
Cited by 235 (14 self)
- Add to MetaCart
We propose a new probabilistic algorithm for online mapping of unknown environments with teams of robots. At the core of the algorithm is a technique that combines fast maximum likelihood map growing with a Monte Carlo localizer that uses particle representations. The combination of both yields an online algorithm that can cope with large odometric errors typically found when mapping an environment with cycles. The algorithm can be implemented distributedly on multiple robot platforms, enabling a team of robots to cooperatively generate a single map of their environment. Finally, an extension is described for acquiring three-dimensional maps, which capture the structure and visual appearance of indoor environments in 3D.
An Incremental Self-Deployment Algorithm for Mobile Sensor Networks
- AUTONOMOUS ROBOTS, SPECIAL ISSUE ON INTELLIGENT EMBEDDED SYSTEMS
, 2001
"... This paper describes an incremental deployment algorithm for mobile sensor networks. A mobile sensor network is a distributed collection of nodes, each of which has sensing, computation, communication and locomotion capabilities. The algorithm deploys nodes one-at-atime into an unknown environment, ..."
Abstract
-
Cited by 228 (9 self)
- Add to MetaCart
This paper describes an incremental deployment algorithm for mobile sensor networks. A mobile sensor network is a distributed collection of nodes, each of which has sensing, computation, communication and locomotion capabilities. The algorithm deploys nodes one-at-atime into an unknown environment, with each node making use of information gathered by previously deployed nodes to determine its target location. The algorithm is designed to maximize network `coverage' whilst simultaneously ensuring that nodes retain line-of-sight with one another (this latter constraint arises from the need to localize the nodes; in our previous work on mesh-based localization [12, 13] we have shown how nodes can localize themselves in a completely unknown environment by using other nodes as landmarks). This paper describes the incremental deployment algorithm and presents the results of an extensive series of simulation experiments. These experiments serve to both validate the algorithm and illuminate its empirical properties.
Probabilistic Algorithms in Robotics
- AI Magazine vol
"... This article describes a methodology for programming robots known as probabilistic robotics. The probabilistic paradigm pays tribute to the inherent uncertainty in robot perception, relying on explicit representations of uncertainty when determining what to do. This article surveys some of the progr ..."
Abstract
-
Cited by 199 (6 self)
- Add to MetaCart
(Show Context)
This article describes a methodology for programming robots known as probabilistic robotics. The probabilistic paradigm pays tribute to the inherent uncertainty in robot perception, relying on explicit representations of uncertainty when determining what to do. This article surveys some of the progress in the field, using in-depth examples to illustrate some of the nuts and bolts of the basic approach. Our central conjecture is that the probabilistic approach to robotics scales better to complex real-world applications than approaches that ignore a robot’s uncertainty. 1
Coordination for multi-robot exploration and mapping
- IN PROCEEDINGS OF THE AAAI NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE
, 2000
"... This paper addresses the problem of exploration and mapping of an unknown environment by multiple robots. The mapping algorithm is an on-line approach to likelihood maximization that uses hill climbing to find maps that are maximally consistent with sensor data and odometry. The exploration algorith ..."
Abstract
-
Cited by 169 (25 self)
- Add to MetaCart
(Show Context)
This paper addresses the problem of exploration and mapping of an unknown environment by multiple robots. The mapping algorithm is an on-line approach to likelihood maximization that uses hill climbing to find maps that are maximally consistent with sensor data and odometry. The exploration algorithm explicitly coordinates the robots. It tries to maximize overall utility by minimizing the potential for overlap in information gain amongst the various robots. For both the exploration and mapping algorithms, most of the computations are distributed. The techniques have been tested extensively in real-world trials and simulations. The results demonstrate the performance improvements and robustness that accrue from our multirobot approach to exploration.
Coordinated Multi-Robot Exploration
- IEEE Transactions on Robotics
, 2005
"... In this paper, we consider the problem of exploring an unknown environment with a team of robots. As in singlerobot exploration the goal is to minimize the overall exploration time. The key problem to be solved in the context of multiple robots is to choose appropriate target points for the individu ..."
Abstract
-
Cited by 158 (10 self)
- Add to MetaCart
(Show Context)
In this paper, we consider the problem of exploring an unknown environment with a team of robots. As in singlerobot exploration the goal is to minimize the overall exploration time. The key problem to be solved in the context of multiple robots is to choose appropriate target points for the individual robots so that they simultaneously explore different regions of the environment. We present an approach for the coordination of multiple robots, which simultaneously takes into account the cost of reaching a target point and its utility. Whenever a target point is assigned to a specific robot, the utility of the unexplored area visible from this target position is reduced. In this way, different target locations are assigned to the individual robots. We furthermore describe how our algorithm can be extended to situations in which the communication range of the robots is limited. Our technique has been implemented and tested extensively in real-world experiments and simulation runs. The results demonstrate that our technique effectively distributes the robots over the environment and allows them to quickly accomplish their mission.
Coverage, Exploration and Deployment by a Mobile Robot and Communication Network
- Telecommunication Systems Journal, Special Issue on Wireless Sensor Networks
, 2003
"... We consider the problem of coverage and exploration of an unknown dynamic environment using a mobile robot(s). The environment is assumed to be large enough such that constant motion by the robot(s) is needed to cover the environment. We present an e#cient minimalist algorithm which assumes that ..."
Abstract
-
Cited by 109 (12 self)
- Add to MetaCart
(Show Context)
We consider the problem of coverage and exploration of an unknown dynamic environment using a mobile robot(s). The environment is assumed to be large enough such that constant motion by the robot(s) is needed to cover the environment. We present an e#cient minimalist algorithm which assumes that global information is not available (neither a map, nor GPS). Our algorithm deploys a network of radio beacons which assists the robot(s) in coverage. This network is also used for navigation. The deployed network can also be used for applications other than coverage. Simulation experiments are presented which show the collaboration between the deployed network and mobile robot(s) for the tasks of coverage/exploration, network deployment and maintenance (repair), and mobile robot(s) recovery (homing behavior). We present a theoretical basis for our algorithm on graphs and show the results of the simulated scenario experiments.
Information gain-based exploration using Rao-Blackwellized particle filters
- In RSS
, 2005
"... Abstract — This paper presents an integrated approach to exploration, mapping, and localization. Our algorithm uses a highly efficient Rao-Blackwellized particle filter to represent the posterior about maps and poses. It applies a decision-theoretic framework which simultaneously considers the uncer ..."
Abstract
-
Cited by 103 (4 self)
- Add to MetaCart
Abstract — This paper presents an integrated approach to exploration, mapping, and localization. Our algorithm uses a highly efficient Rao-Blackwellized particle filter to represent the posterior about maps and poses. It applies a decision-theoretic framework which simultaneously considers the uncertainty in the map and in the pose of the vehicle to evaluate potential actions. Thereby, it trades off the cost of executing an action with the expected information gain and takes into account possible sensor measurements gathered along the path taken by the robot. We furthermore describe how to utilize the properties of the Rao-Blackwellization to efficiently compute the expected information gain. We present experimental results obtained in the real world and in simulation to demonstrate the effectiveness of our approach. I.
