Sciweavers

25 search results - page 4 / 5
» Accelerated A* path planning
Sort
View
AIPS
2009
13 years 7 months ago
Inference and Decomposition in Planning Using Causal Consistent Chains
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
Nir Lipovetzky, Hector Geffner
IROS
2007
IEEE
152views Robotics» more  IROS 2007»
14 years 17 days 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
IROS
2008
IEEE
169views Robotics» more  IROS 2008»
14 years 20 days ago
On-line planning of time-optimal, jerk-limited trajectories
Abstract— Service robots which directly interact with humans in highly unstructured, unpredictable and dynamic environments must be able to flexibly adapt their motion in reacti...
Robert Haschke, Erik Weitnauer, Helge Ritter
IROS
2007
IEEE
127views Robotics» more  IROS 2007»
14 years 17 days ago
Goal directed navigation with uncertainty in adversary locations
— This paper addresses the problem of planning for goal directed navigation in the environment that contains a number of possible adversary locations. It first shows that common...
Maxim Likhachev, Anthony Stentz
JIRS
2010
104views more  JIRS 2010»
13 years 4 months ago
On the Generation of Trajectories for Multiple UAVs in Environments with Obstacles
Abstract This paper presents a methodology based on a variation of the Rapidlyexploring Random Trees (RRTs) that generates feasible trajectories for a team of autonomous aerial veh...
Armando Alves Neto, Douglas Guimarães Macha...