Sciweavers

60 search results - page 3 / 12
» Randomized Kinodynamic Motion Planning with Moving Obstacles
Sort
View
IROS
2008
IEEE
165views Robotics» more  IROS 2008»
14 years 21 days ago
Probabilistic navigation in dynamic environment using Rapidly-exploring Random Trees and Gaussian processes
— The paper describes a navigation algorithm for dynamic, uncertain environment. Moving obstacles are supposed to move on typical patterns which are pre-learned and are represent...
Chiara Fulgenzi, Christopher Tay, Anne Spalanzani,...
IROS
2007
IEEE
143views Robotics» more  IROS 2007»
14 years 17 days ago
A framework for planning motion in environments with moving obstacles
— In this paper we present a heuristic approach to planning in an environment with moving obstacles. Our approach assumes that the robot has no knowledge of the future trajectory...
Samuel Rodríguez, Jyh-Ming Lien, Nancy M. A...
IROS
2008
IEEE
141views Robotics» more  IROS 2008»
14 years 21 days ago
Kinodynamic gait planning for full-body humanoid robots
Abstract— This paper proposes the kinodynamic gait planning for humanoid robots where both kinematics and dynamics of the system are considered. We can simultaneously plan both t...
Kensuke Harada, Mitsuharu Morisawa, Kanako Miura, ...
AROBOTS
2005
100views more  AROBOTS 2005»
13 years 6 months ago
A Sampling-Based Motion Planning Approach to Maintain Visibility of Unpredictable Targets
This paper deals with the surveillance problem of computing the motions of one or more robot observers in order to maintain visibility of one or several moving targets. The target...
Rafael Murrieta-Cid, Benjamín Tovar, Seth H...
ICRA
2007
IEEE
156views Robotics» more  ICRA 2007»
14 years 18 days ago
Multipartite RRTs for Rapid Replanning in Dynamic Environments
Abstract— The Rapidly-exploring Random Tree (RRT) algorithm has found widespread use in the field of robot motion planning because it provides a single-shot, probabilistically c...
Matthew Zucker, James J. Kuffner, Michael S. Brani...