238 search results - page 17 / 48 » Planning as Satisfiability |
IJCGA
2010
13 years 9 months ago
2010
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
SWAT
1998
Springer
14 years 3 months ago
1998
Springer
We study the complexity of the motion planning problem for a bounded-reach robot in the situation where the n obstacles in its workspace satisfy two of the realistic models propos...
AIPS
2000
14 years 8 days ago
2000
The paradigm of advisable planning, in which a user provides guidance to influence the content of solutions produced by an underlying planning system, holds much promise for impro...
AIPS
2004
14 years 9 days ago
2004
We address the issue of incorporating domain-specific preferences in planning systems, where a preference may be seen as a "soft" constraint that it is desirable, but no...
AIPS
2006
14 years 9 days ago
2006
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...