Sciweavers

810 search results - page 29 / 162
» Solving Time-Dependent Planning Problems
Sort
View
ICTAI
2002
IEEE
14 years 1 months ago
On Temporal Planning as CSP
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
Amol Dattatraya Mali
BIRTHDAY
2005
Springer
14 years 1 months ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau
IJCAI
2001
13 years 9 months ago
Planning with Resources and Concurrency: A Forward Chaining Approach
Recently tremendous advances have been made in the performance of AI planning systems. However increased performance is only one of the prerequisites for bringing planning into th...
Fahiem Bacchus, Michael Ady
CPAIOR
2006
Springer
13 years 12 months ago
An Efficient Hybrid Strategy for Temporal Planning
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
Zhao Xing, Yixin Chen, Weixiong Zhang
GIS
2007
ACM
14 years 2 days ago
Optimal traversal planning in road networks with navigational constraints
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
Leyla Kazemi, Cyrus Shahabi, Mehdi Sharifzadeh, Lu...