Sciweavers

170 search results - page 13 / 34
» Solving Simple Planning Problems with More Inference and No ...
Sort
View
JAIR
2010
167views more  JAIR 2010»
13 years 6 months ago
The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
LAMA is a classical planning system based on heuristic forward search. Its core feature is the use of a pseudo-heuristic derived from landmarks, propositional formulas that must b...
Silvia Richter, Matthias Westphal
CI
2011
93views more  CI 2011»
13 years 2 months ago
Supporting clinical processes and decisions by hierarchical planning and scheduling
This paper is focused on how a general-purpose hierarchical planning representation, based on the HTN paradigm, can be used to support the representation of oncology treatment pro...
Juan Fernández-Olivares, Luis A. Castillo, ...
IROS
2007
IEEE
110views Robotics» more  IROS 2007»
14 years 1 months ago
Multi-agent search with interim positive information
– A problem of searching with multiple searchers and scouts is presented. Unlike most search problems that terminate as soon as the target is found, successful detections by scou...
Haye Lau, Shoudong Huang, Gamini Dissanayake
CDC
2010
IEEE
170views Control Systems» more  CDC 2010»
13 years 2 months ago
Motion planning with hybrid dynamics and temporal goals
In this paper, we consider the problem of motion planning for mobile robots with nonlinear hybrid dynamics, and high-level temporal goals. We use a multi-layered synergistic framew...
Amit Bhatia, Lydia E. Kavraki, Moshe Y. Vardi
ICTAI
2007
IEEE
14 years 1 months ago
On Portfolios for Backtracking Search in the Presence of Deadlines
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...
Huayue Wu, Peter van Beek