Sciweavers

314 search results - page 29 / 63
» Goal Ordering in Partially Ordered Plans
Sort
View
PEPM
1992
ACM
13 years 11 months ago
Self-applicable C Program Specialization
A partial evaluator is an automatic program transformation tool. Given as input a general program and part of its input, it can produce a specialized version. If the partial evalu...
Lars Ole Andersen
FCS
2007
13 years 9 months ago
Coordinating Planning Agents for Moderately and Tightly-Coupled Tasks
In many task-planning domains, dynamic assemblies of autonomous agents are replacing hierarchical organisations because they promise more agility. In such assemblies, interdepende...
J. Renze Steenhuisen, Cees Witteveen
IGPL
2008
103views more  IGPL 2008»
13 years 7 months ago
Transition Logic Revisited
A new version of transition logic is presented. It integrates (dynamic) transitions, which change world states, and classical (static) reasoning, restricted in the paper to Horn l...
Wolfgang Bibel
AAMAS
2005
Springer
14 years 1 months ago
Experiments in Subsymbolic Action Planning with Mobile Robots
The ability to determine a sequence of actions in order to reach a particular goal is of utmost importance to mobile robots. One major problem with symbolic planning approaches re...
John Pisokas, Ulrich Nehmzow
IROS
2007
IEEE
160views Robotics» more  IROS 2007»
14 years 1 months ago
Task constrained motion planning in robot joint space
— We explore global randomized joint space path planning for articulated robots that are subject to task space constraints. This paper describes a representation of constrained m...
Mike Stilman