Sciweavers

TIT
2008
102views more  TIT 2008»
13 years 11 months ago
State Estimation With Initial State Uncertainty
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...
Yoav Levinbook, Tan F. Wong
AAAI
2000
14 years 26 days ago
An Iterative Algorithm for Synthesizing Invariants
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 ...
Jussi Rintanen
AAAI
1998
14 years 26 days ago
Inferring State Constraints for Domain-Independent Planning
Wedescribe somenewpreprocessing techniques that enable faster domain-independentplanning. Thefirst set of techniquesis aimedat inferring state constraints from the structure of pl...
Alfonso Gerevini, Lenhart K. Schubert
LANMR
2007
14 years 28 days ago
Planning using situation calculus, prolog and a mobile robot
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...
Pilar Pozos Parra, Edgardo Yescas, Jacob Vá...
ICTAI
2000
IEEE
14 years 3 months ago
Building efficient partial plans using Markov decision processes
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...
Pierre Laroche
ICCAD
1997
IEEE
101views Hardware» more  ICCAD 1997»
14 years 3 months ago
Minimum area retiming with equivalent initial states
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...
Naresh Maheshwari, Sachin S. Sapatnekar
VLSID
1999
IEEE
87views VLSI» more  VLSID 1999»
14 years 3 months ago
Optimal Retiming for Initial State Computation
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...
Peichen Pan, Guohua Chen
AUSAI
2004
Springer
14 years 4 months ago
A Time and Energy Optimal Controller for Mobile Robots
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...
Sebastien Ancenay, Frédéric Maire
CAEPIA
2005
Springer
14 years 5 months ago
Mapping Conformant Planning into SAT Through Compilation and Projection
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...
Héctor Palacios, Hector Geffner
IPPS
2005
IEEE
14 years 5 months ago
Self-Stabilizing Anonymous Leader Election in a Tree
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...
Zhenyu Xu, Pradip K. Srimani