Sciweavers

381 search results - page 31 / 77
» A computational framework for package planning
Sort
View
FLAIRS
2007
13 years 10 months ago
Dynamic DDN Construction for Lightweight Planning Architectures
POMDPs are a popular framework for representing decision making problems that contain uncertainty. The high computational complexity of finding exact solutions to POMDPs has spaw...
William H. Turkett
VTC
2007
IEEE
111views Communications» more  VTC 2007»
14 years 2 months ago
Analysis of a Spline Based, Obstacle Avoiding Path Planning Algorithm
—The Overbot is one of the original DARPA Grand Challenge vehicles now being used as a platform for autonomous vehicle research. The vehicle, equipped with a complete actuator an...
John Connors, Gabriel Elkaim
FUIN
2007
130views more  FUIN 2007»
13 years 8 months ago
A Logic-Based Approach to Finding Explanations for Discrepancies in Optimistic Plan Execution
Abstract. Consider an agent executing a plan with nondeterministic actions, in a dynamic environment, which might fail. Suppose that she is given a description of this action domai...
Thomas Eiter, Esra Erdem, Wolfgang Faber, Já...
ICPR
2008
IEEE
14 years 9 months ago
Sensor planning for PTZ cameras using the probability of camera overload
Most existing sensor planning algorithms find it difficult to tackle the discrepancy between a PTZ camera's limited instant field of view (FOV) and panoramic achievable FOV. ...
Andreas Koschan, Besma R. Abidi, Chung-Hao Chen, D...
ATAL
2010
Springer
13 years 9 months ago
Risk-sensitive planning in partially observable environments
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...
Janusz Marecki, Pradeep Varakantham