Sciweavers

348 search results - page 15 / 70
» Evaluating Temporal Planning Domains
Sort
View
CORR
1998
Springer
135views Education» more  CORR 1998»
13 years 7 months ago
The Computational Complexity of Probabilistic Planning
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
Michael L. Littman, Judy Goldsmith, Martin Mundhen...
ROBOCUP
2000
Springer
145views Robotics» more  ROBOCUP 2000»
13 years 11 months ago
Adaptive Path Planner for Highly Dynamic Environments
Abstract. This paper describes adaptive path planning, a novel approach to path planning for car-like mobile robots. Instead of creating a new plan from scratch, whenever changes i...
Jacky Baltes, Nicholas Hildreth
IROS
2007
IEEE
112views Robotics» more  IROS 2007»
14 years 2 months ago
From structured english to robot motion
— Recently, Linear Temporal Logic (LTL) has been successfully applied to high-level task and motion planning problems for mobile robots. One of the main attributes of LTL is its ...
Hadas Kress-Gazit, Georgios E. Fainekos, George J....
FLAIRS
2009
13 years 5 months ago
Memory Based Goal Schema Recognition
We propose a memory-based approach to the problem of goal-schema recognition. We use a generic episodic memory module to perform incremental goal schema recognition and to build t...
Dan Tecuci, Bruce W. Porter
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