818 search results - page 87 / 164 » Mobile Robot Localization based on a Polynomial Approach |
205
click to vote
CRV
2011
IEEE
14 years 1 months ago
2011
IEEE
—We consider the problem of exploring an unknown environment with a pair of mobile robots. The goal is to make the robots meet (or rendezvous) in minimum time such that there is ...
100
click to vote
IROS
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract— We present an efficient algorithm for complete motion planning that combines approximate cell decomposition (ACD) with probabilistic roadmaps (PRM). Our approach uses ...
ICRA
2000
IEEE
15 years 5 months ago
2000
IEEE
Mobile robots require the ability to build their own maps to operate in unknown environments. A fundamental problem is that odometry-based dead reckoning cannot be used to assign ...
115
click to vote
FAABS
2004
Springer
15 years 6 months ago
2004
Springer
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...
106
click to vote
IJNSEC
2006
15 years 1 months ago
2006
The increasing importance of the Internet has motivated the exploration of new execution models based on mobile and dynamic entities to overcome the limits of the client/server mo...