Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292)
DOI: 10.1109/robot.2002.1014800
|View full text |Cite
|
Sign up to set email alerts
|

Visually built task models for robot teams in unstructured environments

Abstract: In field environments it is not usually possible to provide robotic systems with valid geometric models of the task and environment. The robot or robot teams will need to create these models by performing appropriate sensor actions. Here, an algorithm based on iterative sensor planning and sensor redundancy is proposed to enable them to efficiently build 3D models of the environment and task. The method assumes stationary robotic vehicles with cameras carried by articulated mounts.The algorithm uses the measur… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 12 publications
(7 citation statements)
references
References 19 publications
0
7
0
Order By: Relevance
“…We show that, using this criterion, the robot can efficiently recover its location when the localization system is in the initial stages or when a failure forces the robot to re-localize. The active localization problem has been addressed by some authors before (Kaelbling et al, 1996;Kleinberg, 1994;Kröse and Bunschoten, 1999) and different entropy-based criteria for action selection similar to the one we describe can be found in the literature for object recognition (Arbel and Ferrie, 1999), environment modeling (Sujan and Dubowsky, 2002) or even for robot localization (Burgard et al, 1997;Fox et al, 1998a;Davison, 1999;Maeda et al, 1997). The difference is that, in our case, the entropy-based evaluation can be computed more efficiently than in existing approaches.…”
Section: Introductionmentioning
confidence: 94%
See 1 more Smart Citation
“…We show that, using this criterion, the robot can efficiently recover its location when the localization system is in the initial stages or when a failure forces the robot to re-localize. The active localization problem has been addressed by some authors before (Kaelbling et al, 1996;Kleinberg, 1994;Kröse and Bunschoten, 1999) and different entropy-based criteria for action selection similar to the one we describe can be found in the literature for object recognition (Arbel and Ferrie, 1999), environment modeling (Sujan and Dubowsky, 2002) or even for robot localization (Burgard et al, 1997;Fox et al, 1998a;Davison, 1999;Maeda et al, 1997). The difference is that, in our case, the entropy-based evaluation can be computed more efficiently than in existing approaches.…”
Section: Introductionmentioning
confidence: 94%
“…(8) can be fully precomputed and the cost reduces to O(U I 2 ). In any case, the use of the particles to approximate the entropy provides a lower cost than other approaches that discretize the whole configuration space of the robot (Fox et al, 1998a) or the whole field of view of the cameras (Sujan and Dubowsky, 2002).…”
Section: Inputmentioning
confidence: 99%
“…Other researchers assume a circle shaped local observation around each agent's current position. We find many examples in map building [66,69,73,75] and search problems [65]. In [52], the authors use a scheme whereby each agent observes the state of the agents located within a certain radius R, and prove stability in the sense that all agents reach a consensus on the heading to adopt.…”
Section: Local Observationmentioning
confidence: 99%
“…Since the environment (target) motions are known with respect to the sensors, pixel-level data can be fused into a probabilistic map of the target's shape using appropriate sensor noise models. Numerous methods can be used to do this [16,17]. One simplistic approach will be illustrated here.…”
Section: Shape Estimationmentioning
confidence: 99%