Sciweavers

179 search results - page 24 / 36
» Using Classical Planners to Solve Nondeterministic Planning ...
Sort
View
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
15 years 6 months ago
Trajectory Planning using Reachable-State Density Functions
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
Richard Mason, Joel W. Burdick
109
Voted
SARA
2005
Springer
15 years 7 months ago
Synthesizing Plans for Multiple Domains
Intelligent agents acting in real world environments need to synthesize their course of action based on multiple sources of knowledge. They also need to generate plans that smoothl...
Abdelbaki Bouguerra, Lars Karlsson
WSC
2000
15 years 3 months ago
Using simulation and critical points to define states in continuous search spaces
Many artificial intelligence techniques rely on the notion ate" as an abstraction of the actual state of the nd an "operator" as an abstraction of the actions that ...
Marc S. Atkin, Paul R. Cohen
LOGCOM
2011
14 years 4 months ago
Introducing Preferences in Planning as Satisfiability
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...
Enrico Giunchiglia, Marco Maratea
138
Voted
CI
2011
93views more  CI 2011»
14 years 9 months ago
Supporting clinical processes and decisions by hierarchical planning and scheduling
This paper is focused on how a general-purpose hierarchical planning representation, based on the HTN paradigm, can be used to support the representation of oncology treatment pro...
Juan Fernández-Olivares, Luis A. Castillo, ...