810 search results - page 32 / 162 » Solving Time-Dependent Planning Problems |
KES
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. This paper presents a hybrid architecture that facilitates the incurporation of a case-based planning system as the reasoning motor for a deliberative agent. This archite...
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
Multiagent environments are often highly dynamic and only partially observable which makes deliberative action planning computationally hard. In many such environments, however, a...
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— Robotic manipulation is important for real, physical world applications. General Purpose manipulation with a robot (eg. delivering dishes, opening doors with a key, etc...
AIPS
2006
13 years 9 months 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...
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
Planning is an artificial intelligence problem with a wide range of real-world applications. Genetic algorithms, neural networks, and simulated annealing are heuristic search met...