Sciweavers

1713 search results - page 59 / 343
» Planning for Performance
Sort
View
IROS
2007
IEEE
131views Robotics» more  IROS 2007»
15 years 4 months ago
A hybrid approach for complete motion planning
Abstract— We present an efficient algorithm for complete motion planning that combines approximate cell decomposition (ACD) with probabilistic roadmaps (PRM). Our approach uses ...
Liangjun Zhang, Young J. Kim, Dinesh Manocha
HAIS
2010
Springer
15 years 2 months ago
Incorporating Temporal Constraints in the Planning Task of a Hybrid Intelligent IDS
Abstract. Accurate and swift responses are crucial to Intrusion Detection Systems (IDSs), especially if automatic abortion mechanisms are running. In keeping with this idea, this w...
Álvaro Herrero, Martí Navarro, Vicen...
CI
2000
134views more  CI 2000»
14 years 9 months ago
Choosing Rhetorical Structures to Plan Instructional Texts
This paper discusses a fundamental problem in natural language generation: how to organize the content of a text in a coherent and natural way. In this research, we set out to det...
Leila Kosseim, Guy Lapalme
AI
2008
Springer
14 years 10 months ago
Speculative plan execution for information gathering
The execution performance of an information gathering plan can suffer significantly due to remote I/O latencies. A streaming dataflow model of execution addresses the problem to s...
Greg Barish, Craig A. Knoblock
AIPS
2004
14 years 11 months ago
Guiding Planner Backjumping Using Verifier Traces
In this paper, we show how a planner can use a modelchecking verifier to guide state space search. In our work on hard real-time, closed-loop planning, we use a modelchecker'...
Robert P. Goldman, Michael J. S. Pelican, David J....