Sciweavers

9 search results - page 1 / 2
» Competitive Complexity of Mobile Robot on-Line Motion Planni...
Sort
View
IJCGA
2010
155views more  IJCGA 2010»
13 years 3 months ago
Competitive Complexity of Mobile Robot on-Line Motion Planning Problems
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
Yoav Gabriely, Elon Rimon
CDC
2008
IEEE
168views Control Systems» more  CDC 2008»
13 years 11 months ago
An information-driven framework for motion planning in robotic sensor networks: Complexity and experiments
Abstract— A geometric optimization based approach to deploy a mobile sensor network for the purpose of detecting and capturing mobile targets in the plane is presented in [1]. Th...
Rafael Fierro, Silvia Ferrari, Chenghui Cai
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
13 years 9 months ago
Trajectory Planning using Reachable-State Density Functions
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
Richard Mason, Joel W. Burdick
ICRA
2006
IEEE
99views Robotics» more  ICRA 2006»
13 years 11 months ago
MRSAM: a Quadratically Competitive Multi-robot Online Navigation Algorithm
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
Shahar Sarid, Amir Shapiro, Yoav Gabriely
ICRA
2009
IEEE
248views Robotics» more  ICRA 2009»
13 years 11 months ago
Moving obstacle detection in highly dynamic scenes
Abstract— We address the problem of vision-based multiperson tracking in busy pedestrian zones using a stereo rig mounted on a mobile platform. Specifically, we are interested i...
Andreas Ess, Bastian Leibe, Konrad Schindler, Luc ...