Sciweavers

JAIR
2000
96views more  JAIR 2000»
13 years 11 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
IJCAI
2001
14 years 25 days ago
Planning as Model Checking for Extended Goals in Non-deterministic Domains
Recent research has addressed the problem of planning in non-deterministic domains. Classical planning has also been extended to the case of goals that can express temporal proper...
Marco Pistore, Paolo Traverso
IJCAI
2001
14 years 25 days ago
Total-Order Planning with Partially Ordered Subtasks
One of the more controversial recent planning algorithms is the SHOP algorithm, an HTN planning algorithm that plans for tasks in the same order that they are to be executed. SHOP...
Dana S. Nau, Héctor Muñoz-Avila, Yue...
IJCAI
2007
14 years 26 days ago
A Heuristic Search Approach to Planning with Temporally Extended Preferences
In this paper we propose a suite of techniques for planning with temporally extended preferences (TEPs). To this end, we propose a method for compiling TEP planning problems into ...
Jorge A. Baier, Fahiem Bacchus, Sheila A. McIlrait...
ICCAD
2005
IEEE
118views Hardware» more  ICCAD 2005»
14 years 8 months ago
Thermal via planning for 3-D ICs
Heat dissipation is one of the most serious challenges in 3D IC designs. One effective way of reducing circuit temperature is to introduce thermal through-the-silicon (TTS) vias....
Jason Cong, Yan Zhang