Sciweavers

638 search results - page 21 / 128
» A New Approach to Tractable Planning
Sort
View
LPNMR
2009
Springer
14 years 2 months ago
Belief Revision with Bounded Treewidth
Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, w...
Reinhard Pichler, Stefan Rümmele, Stefan Wolt...
JAIR
2000
96views more  JAIR 2000»
13 years 7 months ago
OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains
Recently model checking representation and search techniques were shown to be efciently applicable to planning, in particular to non-deterministic planning. Such planning approach...
Rune M. Jensen, Manuela M. Veloso
ICML
2005
IEEE
14 years 8 months ago
Coarticulation: an approach for generating concurrent plans in Markov decision processes
We study an approach for performing concurrent activities in Markov decision processes (MDPs) based on the coarticulation framework. We assume that the agent has multiple degrees ...
Khashayar Rohanimanesh, Sridhar Mahadevan
ECP
1997
Springer
128views Robotics» more  ECP 1997»
13 years 11 months ago
SINERGY: A Linear Planner Based on Genetic Programming
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
Ion Muslea
EJC
2008
13 years 7 months ago
On digraph coloring problems and treewidth duality
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
Albert Atserias