43 search results - page 3 / 9 » A Framework for Automatic Problem Decomposition in Planning |
109
click to vote
INFORMATICALT
2007
14 years 11 months ago
2007
A modified version of the Bellare and Rogaway (1993) adversarial model is encoded using Asynchronous Product Automata (APA). A model checker tool, Simple Homomorphism Verificatio...
100
click to vote
IROS
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract— We present a computational framework for automatic deployment of robots in 2D and 3D rectangular environments with polytopal obstacles. The results are derived for poly...
111
click to vote
CONSTRAINTS
2011
14 years 6 months ago
2011
Abstract The G12 project is developing a software environment for stating and solving combinatorial problems by mapping a high-level model of the problem to an efficient combinatio...
129
click to vote
ICCV
2011
IEEE
13 years 11 months ago
2011
IEEE
This paper proposes a very general max-margin learning framework for distance-based clustering. To this end, it formulates clustering as a high order energy minimization problem w...
EPIA
2005
Springer
15 years 4 months ago
2005
Springer
We present a general-purpose framework for updating a robot’s observation model within the context of planning and execution. Traditional plan execution relies on monitoring plan...