AIPS 2009 - PDF Preprint Papers

AIPS 2009

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed AIPS-2009 Paper

click to vote

AIPS
2009

189views Artificial Intelligence» more AIPS 2009»

Computing Robust Plans in Continuous Domains

14 years 16 days ago

Download www.cs.toronto.edu

We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...

Christian Fritz, Sheila A. McIlraith

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	189	Computing Robust Plans in Continuous Domains	claim
2	169	Semantic Attachments for Domain-Independent Planning Systems	claim
3	161	Navigation Planning in Probabilistic Roadmaps with Uncertainty	claim
4	151	Information-Theoretic Approach to Efficient Adaptive Path Planning for Mobile Robotic Environmental Sensing	claim
5	144	Efficient Solutions to Factored MDPs with Imprecise Transition Probabilities	claim
6	144	Flexible Execution of Plans with Choice	claim
7	142	Ant Search Strategies For Planning Optimization	claim
8	139	Multi-Agent Online Planning with Communication	claim
9	139	A Human-Aware Robot Task Planner	claim
10	132	Extended Goals for Composing Services	claim
11	127	A Semantics for HTN Methods	claim
12	127	An Optimal Temporally Expressive Planner: Initial Results and Application to P2P Network Optimization	claim
13	126	Automatic Derivation of Memoryless Policies and Finite-State Controllers Using Classical Planners	claim
14	124	A Decision-Theoretic Approach to Dynamic Sensor Selection in Camera Networks	claim
15	122	Structural-Pattern Databases	claim
16	122	Suboptimal and Anytime Heuristic Search on Multi-Core Machines	claim
17	121	The Influence of k-Dependence on the Complexity of Planning	claim
18	120	Optimality Properties of Planning Via Petri Net Unfolding: A Formal Analysis	claim
19	118	Exploiting Coordination Locales in Distributed POMDPs via Social Model Shaping	claim
20	118	Using the Context-enhanced Additive Heuristic for Temporal and Numeric Planning	claim
21	112	Scalable, Parallel Best-First Search for Optimal Sequential Planning	claim
22	112	Inference and Decomposition in Planning Using Causal Consistent Chains	claim
23	109	A Conformant Planner with Explicit Disjunctive Representation of Belief States	claim
24	108	Learning User Plan Preferences Obfuscated by Feasibility Constraints	claim
25	108	Enhancing the Context-Enhanced Additive Heuristic with Precedence Constraints	claim
26	104	Incremental Policy Generation for Finite-Horizon DEC-POMDPs	claim
27	104	Extending the Use of Inference in Temporal Planning as Forwards Search	claim
28	103	Just-In-Time Scheduling with Constraint Programming	claim
29	102	Using Distance Estimates in Heuristic Search	claim
30	100	Lower Bounding Klondike Solitaire with Monte-Carlo Planning	claim
31	99	Preferred Operators and Deferred Evaluation in Satisficing Planning	claim
32	99	Dynamic Controllability of Temporally-flexible Reactive Programs	claim
33	97	Minimal Sufficient Explanations for Factored Markov Decision Processes	claim
34	94	Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?	claim
35	92	SAT-Based Parallel Planning Using a Split Representation of Actions	claim
36	92	Path-Adaptive A* for Incremental Heuristic Search in Unknown Terrain	claim
37	91	An Automatically Configurable Portfolio-based Planner with Macro-actions: PbP	claim
38	84	Improving Planning Performance Using Low-Conflict Relaxed Plans	claim
39	84	Integrating Planning and Scheduling in a CP Framework: A Transition-Based Approach	claim
40	83	Composition of Partially Observable Services Exporting their Behaviour	claim
41	79	Focused Topological Value Iteration	claim
42	76	Thinking Ahead in Real-Time Search	claim
43	65	Exploiting N-Gram Analysis to Predict Operator Sequences	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers