Sciweavers

448 search results - page 18 / 90
» Obstacle avoidance in formation
Sort
View
COMGEO
2000
ACM
13 years 7 months ago
Computing simple paths among obstacles
Given a set X of points in the plane, two distinguished points s,t X, and a set of obstacles represented by line segments, we wish to compute a simple polygonal path from s to t...
Qi Cheng, Marek Chrobak, Gopalakrishnan Sundaram
IROS
2009
IEEE
168views Robotics» more  IROS 2009»
14 years 2 months ago
On the generation of feasible paths for aerial robots in environments with obstacles
— This paper presents a methodology based on a variation of the Rapidly-exploring Random Trees (RRTs) that generates feasible trajectories for autonomous aerial vehicles with hol...
Douglas Guimarães Macharet, Armando Alves N...
ICRA
2010
IEEE
100views Robotics» more  ICRA 2010»
13 years 6 months ago
Robot limbo: Optimized planning and control for dynamically stable robots under vertical obstacles
Abstract— We present successful control strategies for dynamically stable robots that avoid low ceilings and other vertical obstacles in a manner similar to limbo dances. Given t...
Kasemsit Teeyapan, Jiuguang Wang, Tobias Kunz, Mik...
ICRA
2009
IEEE
125views Robotics» more  ICRA 2009»
13 years 5 months ago
Real-world robot navigation amongst deformable obstacles
Abstract-- In this paper, we consider the problem of mobile robots navigating in environments with non-rigid objects. Whereas robots can plan their paths more effectively when they...
Barbara Frank, Cyrill Stachniss, Ruediger Schmeddi...
IROS
2007
IEEE
152views Robotics» more  IROS 2007»
14 years 1 months ago
Kinodynamic motion planning on roadmaps in dynamic environments
— In this paper we present a new method for kinodynamic motion planning in environments that contain both static and moving obstacles. We present an efficient twostage approach:...
Jur P. van den Berg, Mark H. Overmars