Sciweavers

173 search results - page 13 / 35
» Memetic Algorithm Based Path Planning for a Mobile Robot
Sort
View
CISS
2008
IEEE
14 years 3 months ago
Optimal path planning for mobile backbone networks
— Mobile Backbone Networks are heterogeneous wireless networks in which a subset of the nodes are more capable than others. The more capable nodes are referred to as Mobile Backb...
Anand Srinivas, Eytan Modiano
ICRA
1994
IEEE
137views Robotics» more  ICRA 1994»
14 years 21 days ago
Local Incremental Planning for Nonholonomic Mobile Robots
We present a simple approach for planning the motion of nonholonomic robots among obstacles. Existing methods lead to open-loop solutions which are either obtained in two stages, ...
Alessandro De Luca, Giuseppe Oriolo
ICRA
2002
IEEE
108views Robotics» more  ICRA 2002»
14 years 1 months ago
Towards Sensor Based Coverage with Robot Teams
We introduce a new algorithm to cover an unknown space with a homogeneous team of circular mobile robots. Our approach is based on a single robot coverage algorithm, a boustrophed...
DeWitt Latimer IV, Siddhartha S. Srinivasa, Vincen...
IROS
2009
IEEE
154views Robotics» more  IROS 2009»
14 years 3 months ago
A control-based approach to task-constrained motion planning
Abstract— We consider the problem of planning collisionfree motions for general (i.e., possibly nonholonomic) redundant robots subject to task space constraints. Previous approac...
Giuseppe Oriolo, Marilena Vendittelli
IJCGA
2010
155views more  IJCGA 2010»
13 years 7 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