565 search results - page 74 / 113 » Heuristics for Planning with SAT |
ICRA
2000
IEEE
13 years 11 months ago
2000
IEEE
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...
AAAI
2010
13 years 9 months ago
2010
Goal-directed path planning is one of the basic and widely studied problems in the field of mobile robotics. Homotopy classes of trajectories, arising due to the presence of obsta...
JAIR
2008
13 years 8 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
INFORMATICALT
2007
13 years 7 months ago
2007
A modified version of the Bellare and Rogaway (1993) adversarial model is encoded using Asynchronous Product Automata (APA). A model checker tool, Simple Homomorphism Verificatio...
RTCSA
2009
IEEE
14 years 2 months ago
2009
IEEE
Mobile elements, which can traverse the deployment area and convey the observed data from static sensor nodes to a base station, have been introduced for energy efficient data co...