TIT
2008
13 years 10 months ago
2008
Abstract--The problem of state estimation with initial state uncertainty is approached from a statistical decision theory point of view. The initial state is regarded as determinis...
AAAI
2000
14 years 7 days ago
2000
We present a general algorithm for synthesizing state invariants that speed up automated planners and have other applications in reasoning about change. Invariants are facts that ...
AAAI
1998
14 years 7 days ago
1998
Wedescribe somenewpreprocessing techniques that enable faster domain-independentplanning. Thefirst set of techniquesis aimedat inferring state constraints from the structure of pl...
LANMR
2007
14 years 9 days ago
2007
This paper presents a system that controls the behavior of a mobile robot. The system is based on situation calculus, the initial state is described and a goal is given, Prolog pro...
ICTAI
2000
IEEE
14 years 2 months ago
2000
IEEE
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
ICCAD
1997
IEEE
14 years 3 months ago
1997
IEEE
Traditional minimum area retiming algorithms attempt to achieve their prescribed objective with no regard to maintaining the initial state of the system. This issue is important f...
VLSID
1999
IEEE
14 years 3 months ago
1999
IEEE
Retiming is a transformation that optimizes a sequential circuit by relocating the registers. When the circuit has an initial state, one must compute an equivalent initial state f...
AUSAI
2004
Springer
14 years 4 months ago
2004
Springer
We present a time and energy optimal controller for a two-wheeled differentially driven robot. We call a mission the task of bringing the robot from an initial state to a desired f...
CAEPIA
2005
Springer
14 years 4 months ago
2005
Springer
Conformant planning is a variation of classical AI planning where the initial state is partially known and actions can have nondeterministic effects. While a classical plan must a...
IPPS
2005
IEEE
14 years 4 months ago
2005
IEEE
We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n4 ) time...