Sciweavers

622 search results - page 5 / 125
» Solving the Robots Gathering Problem
Sort
View
IJCAI
1989
13 years 9 months ago
Solving Time-Dependent Planning Problems
A planning problem is time-dependent, if the time spent planning affects the utility of the system's performance. In [Dean and Boddy, 1988], we define a framework for constru...
Mark S. Boddy, Thomas Dean
EXPERT
2007
109views more  EXPERT 2007»
13 years 7 months ago
Mexar2: AI Solves Mission Planner Problems
s planners work at a higher abstraction level while it performs low-level, often-repetitive tasks. It also helps them produce a plan rapidly, explore alternative solutions, and cho...
Amedeo Cesta, Gabriella Cortellessa, Michel Denis,...
GECCO
2000
Springer
109views Optimization» more  GECCO 2000»
13 years 11 months ago
GP+Echo+Subsumption = Improved Problem Solving
Real-time, adaptive control is a difficult problem that can be addressed by EC architectures. We are interested in incorporating into an EC architecture some of the features that ...
William F. Punch, W. M. Rand
ECTEL
2008
Springer
13 years 9 months ago
Evaluating Spatial Knowledge through Problem-Solving in Virtual Learning Environments
Modeling the cognitive processes of learners is fundamental to build educational software that are autonomous and that can provide highly tailored assistance during learning [3]. F...
Philippe Fournier-Viger, Roger Nkambou, Andr&eacut...
AIPS
1998
13 years 9 months ago
Solving Stochastic Planning Problems with Large State and Action Spaces
Planning methods for deterministic planning problems traditionally exploit factored representations to encode the dynamics of problems in terms of a set of parameters, e.g., the l...
Thomas Dean, Robert Givan, Kee-Eung Kim