Sciweavers

565 search results - page 76 / 113
» Heuristics for Planning with SAT
Sort
View
AIPS
2011
12 years 11 months ago
Searching for Plans with Carefully Designed Probes
We define a probe to be a single action sequence computed greedily from a given state that either terminates in the goal or fails. We show that by designing these probes carefull...
Nir Lipovetzky, Hector Geffner
CISS
2008
IEEE
14 years 2 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
2003
IEEE
125views Robotics» more  ICRA 2003»
14 years 1 months ago
Online footstep planning for humanoid robots
We present an online algorithm for planning sequences of footstep locations that encode goal-directed navigation strategies for humanoid robots. Planning footsteps is more general...
James J. Kuffner Jr., Satoshi Kagami, Koichi Nishi...
AAAI
2006
13 years 9 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
RAS
2006
134views more  RAS 2006»
13 years 7 months ago
Simultaneous planning, localization, and mapping in a camera sensor network
In this paper we examine issues of localization, exploration, and planning in the context of a hybrid robot/camera-network system. We exploit the ubiquity of camera networks to us...
Ioannis M. Rekleitis, David Meger, Gregory Dudek