Sciweavers

170 search results - page 15 / 34
» Solving Simple Planning Problems with More Inference and No ...
Sort
View
ECML
1991
Springer
13 years 11 months ago
Learning by Analogical Replay in PRODIGY: First Results
Robust reasoning requires learning from problem solving episodes. Past experience must be compiled to provide adaptation to new contingencies and intelligent modification of solut...
Manuela M. Veloso, Jaime G. Carbonell
KER
2007
90views more  KER 2007»
13 years 7 months ago
PLTOOL: A knowledge engineering tool for planning and learning
AI planning solves the problem of generating a correct and efficient ordered set of instantiated activities, from a knowledge base of generic actions, which when executed will tra...
Susana Fernández, Daniel Borrajo, Raquel Fu...
CRV
2011
IEEE
352views Robotics» more  CRV 2011»
12 years 7 months ago
Conformative Filter: A Probabilistic Framework for Localization in Reduced Space
— Algorithmic problem reduction is a fundamental approach to problem solving in many fields, including robotics. To solve a problem using this scheme, we must reduce the problem...
Chatavut Viriyasuthee, Gregory Dudek
AIPS
2000
13 years 9 months ago
New Results about LCGP, a Least Committed GraphPlan
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
Michel Cayrol, Pierre Régnier, Vincent Vida...
AAAI
2010
13 years 9 months ago
Finding Optimal Solutions to Cooperative Pathfinding Problems
In cooperative pathfinding problems, non-interfering paths that bring each agent from its current state to its goal state must be planned for multiple agents. We present the first...
Trevor Scott Standley