Sciweavers

226 search results - page 18 / 46
» Heuristic Search Planning with BDDs
Sort
View
AIPS
2003
15 years 1 months ago
Guided Symbolic Universal Planning
Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To d...
Rune M. Jensen, Manuela M. Veloso, Randal E. Bryan...
88
Voted
JOLLI
2007
128views more  JOLLI 2007»
14 years 11 months ago
Linear temporal logic as an executable semantics for planning languages
This paper presents an approach to artificial intelligence planning based on linear temporal logic (LTL). A simple and easy-to-use planning language is described, PDDL-K (Planning...
Marta Cialdea Mayer, Carla Limongelli, Andrea Orla...
JAIR
2010
167views more  JAIR 2010»
14 years 10 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
JAIR
2006
111views more  JAIR 2006»
14 years 11 months ago
Learning in Real-Time Search: A Unifying Framework
Real-time search methods are suited for tasks in which the agent is interacting with an initially unknown environment in real time. In such simultaneous planning and learning prob...
Vadim Bulitko, Greg Lee
AI
2011
Springer
14 years 6 months ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...