Sciweavers

696 search results - page 48 / 140
» Planning for Network-Aware Paths
Sort
View
CDC
2008
IEEE
107views Control Systems» more  CDC 2008»
14 years 2 months ago
Locally optimal decomposition for autonomous obstacle avoidance with the Tunnel-MILP algorithm
— The Tunnel-MILP algorithm is a three stage path planning method for 2-D environments that relies on the identification of a sequence of convex polygons to form an obstacle fre...
Michael P. Vitus, Steven Lake Waslander, Claire J....
VC
2008
85views more  VC 2008»
13 years 7 months ago
Real-time crowd motion planning
Real-time crowd motion planning requires fast, realistic methods for path planning as well as obstacle avoidance. In a previous work (Morini et al. in Cyberworlds International Con...
Barbara Yersin, Jonathan Maïm, Fiorenzo Morin...
ICTAI
2000
IEEE
13 years 11 months ago
Building efficient partial plans using Markov decision processes
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
Pierre Laroche
ICRA
2009
IEEE
150views Robotics» more  ICRA 2009»
14 years 2 months ago
Analytic error variance predictions for planar vehicles
— Path planning algorithms that incorporate risk and uncertainty need to be able to predict the evolution of pathfollowing error statistics for each candidate plan. We present an...
Matthew Greytak, Franz Hover
IJRR
2010
173views more  IJRR 2010»
13 years 6 months ago
Planning and Implementing Trajectories for Autonomous Underwater Vehicles to Track Evolving Ocean Processes Based on Predictions
Path planning and trajectory design for autonomous underwater vehicles (AUVs) is of great importance to the oceanographic research community because automated data collection is b...
Ryan N. Smith, Yi Chao, Peggy Li, David A. Caron, ...