Exploration problem

In robotics, the exploration problem deals with the use of a robot to maximize the knowledge over a particular area. The exploration problem arises… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1989-2018
0102019892018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Achieving efficient and scalable exploration in complex domains poses a major challenge in reinforcement learning. While Bayesian… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
Is this relevant?
2015
2015
In this paper, we propose a novel and computationally efficient algorithm for simultaneous exploration and coverage with a vision… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
This paper presents an efficient approach for solving economic dispatch (ED) problems with nonconvex cost functions using an… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • table II
Is this relevant?
Highly Cited
2008
Highly Cited
2008
The exploration problem is a central issue in mobile robotics. A complete terrain coverage is not practical if the environment is… (More)
  • figure 1
  • table 1
Is this relevant?
2008
2008
This article investigates the scenario where a small team of robots needs to explore a hypothetical disaster site. The challenge… (More)
  • figure 1.1
  • figure 1.2
  • figure 1.3
Is this relevant?
2006
2006
The mapping and localization problems have received considerable attention in robotics recently. The exploration problem that… (More)
  • figure 1
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
2005
2005
Single auction-based methods are known to be efficient for multi-robot problem solving. In this work, we investigate performance… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
2004
2004
We improve the best known lower bound for the polygon exploration problem from 1.2071 to 1.2825. 
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We present an on-line strategy that enables a mobile robot with vision to explore an unknown simple polygon. We prove that the… (More)
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • figure 2.5
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We address the problem of robotic exploration of a graphlike world, where no distance or orientation metric is assumed of the… (More)
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?