Sciweavers

1941 search results - page 73 / 389
» The representation of planning strategies
Sort
View
AAAI
2006
13 years 11 months ago
Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes)
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
Héctor Palacios, Hector Geffner
AIPS
2010
13 years 10 months ago
Forward-Chaining Partial-Order Planning
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approach...
Amanda Jane Coles, Andrew Coles, Maria Fox, Derek ...
AUTOMATICA
2007
124views more  AUTOMATICA 2007»
13 years 10 months ago
Motion planning in uncertain environments with vision-like sensors
In this work we present a methodology for intelligent path planning in an uncertain environment using vision like sensors, i.e., sensors that allow the sensing of the environment ...
Suman Chakravorty, John L. Junkins
IMA
2001
Springer
91views Cryptology» more  IMA 2001»
14 years 2 months ago
The Wide Trail Design Strategy
n, important for interoperability only. We can make abstraction from the representation of the elements of GF(28 ) and consider a block cipher that operates on strings of elements ...
Joan Daemen, Vincent Rijmen
ROBOCUP
2001
Springer
126views Robotics» more  ROBOCUP 2001»
14 years 2 months ago
Recognizing Probabilistic Opponent Movement Models
In multiagent adversarial domains, team agents should adapt to the environment and opponent. We introduce a model representation as part of a planning process for a simulated socce...
Patrick Riley, Manuela M. Veloso