Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Using classical planners to solve nondeterministic planning problems
Researchers have developed a huge number of algorithms to solve classical planning
problems. We provide a way to use these algorithms, unmodified, to generate strong-cyclic …
problems. We provide a way to use these algorithms, unmodified, to generate strong-cyclic …
[HTML][HTML] Plan aggregation for strong cyclic planning in nondeterministic domains
We describe a planning algorithm, NDP2, that finds strong-cyclic solutions to
nondeterministic planning problems by using a classical planner to solve a sequence of …
nondeterministic planning problems by using a classical planner to solve a sequence of …
Plan execution in dynamic environments
This paper deals with plan execution on agents/robots in highly dynamic environments.
Besides a formal semantics of plan execution and a representation of plans as programs, we …
Besides a formal semantics of plan execution and a representation of plans as programs, we …
[کتاب][B] Abstraction, Reformulation, and Approximation: 5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2-4, 2002, Proceedings
It has been recognized since the inception of Artificial Intelligence (AI) that abstractions,
problem reformulations, and approximations (AR&A) are central to human common sense …
problem reformulations, and approximations (AR&A) are central to human common sense …
[PDF][PDF] Learning Rules for Adaptive Planning.
This paper presents a novel idea, which combines Planning, Machine Learning and
Knowledge-Based techniques. It is concerned with the development of an adaptive planning …
Knowledge-Based techniques. It is concerned with the development of an adaptive planning …
Reformulation in planning
Reformulation of a problem is intended to make the problem more amenable to efficient
solution. This is equally true in the special case of reformulating a planning problem. This …
solution. This is equally true in the special case of reformulating a planning problem. This …
[کتاب][B] TM-LPSAT: Encoding temporal metric planning in continuous time
JA Shin - 2004 - search.proquest.com
In any domain with change, the dimension of time is inherently involved. Whether the
domain should be modeled in discrete time or continuous time depends on aspects of the …
domain should be modeled in discrete time or continuous time depends on aspects of the …
[PDF][PDF] Towards adaptive heuristic planning through machine learning
In domain independent heuristic planning there is a number of planning systems with very
good performance on some problems and very poor on others. Few attempts have been …
good performance on some problems and very poor on others. Few attempts have been …
[کتاب][B] Intelligent and robust control of autonomous mobile robots
G Steinbauer - 2006 - neuro.bstu.by
This thesis presents a framework for the intelligent robust control of autonomous mobile
robots which carry out various tasks in real-world environments. The framework has been …
robots which carry out various tasks in real-world environments. The framework has been …
[PDF][PDF] Using Classical Planners to Solve Nondeterministic Planning Problems
UKDNE Reisner, RP Goldman - 2008 - cdn.aaai.org
Researchers have developed a huge number of algorithms to solve classical planning
problems. We provide a way to use these algorithms, unmodified, to generate strong-cyclic …
problems. We provide a way to use these algorithms, unmodified, to generate strong-cyclic …