AIPS 2006 - PDF Preprint Papers

AIPS 2006

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed AIPS-2006 Paper

click to vote

AIPS
2006

211views Artificial Intelligence» more AIPS 2006»

Solving Factored MDPs with Exponential-Family Transition Models

13 years 6 months ago

Download www.cs.pitt.edu

Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...

Branislav Kveton, Milos Hauskrecht

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	211	Solving Factored MDPs with Exponential-Family Transition Models	claim
2	171	Goal Achievement in Partially Known, Partially Observable Domains	claim
3	167	Planning with Temporally Extended Goals Using Heuristic Search	claim
4	161	Automated Planning Using Quantum Computation	claim
5	160	Run-Time Monitoring of the Execution of Plans for Web Service Composition	claim
6	150	Concurrent Probabilistic Planning in the Graphplan Framework	claim
7	145	Reconfigurable Path Planning for an Autonomous Unmanned Aerial Vehicle	claim
8	143	Incremental Maintenance of Double Precedence Graphs: A Constraint-Based Approach	claim
9	141	Combining Stochastic Task Models with Reinforcement Learning for Dynamic Scheduling	claim
10	140	Towards Strong Cyclic Planning under Partial Observability	claim
11	137	Challenges for Temporal Planning with Uncertain Durations	claim
12	137	Predictive Planning for Supply Chain Management	claim
13	137	Bringing Users and Planning Technology Together. Experiences in SIADEX	claim
14	135	Scalable Planning for Distributed Stream Processing Systems	claim
15	133	Combining Knowledge Compilation and Search for Conformant Probabilistic Planning	claim
16	133	Automated Web Service Composition by On-the-Fly Belief Space Search	claim
17	130	Probabilistic Planning with Nonlinear Utility Functions	claim
18	130	Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics	claim
19	129	Reusing and Building a Policy Library	claim
20	126	Bounded Branching and Modalities in Non-Deterministic Planning	claim
21	125	Tractable Optimal Competitive Scheduling	claim
22	123	Durative Planning in HTNs	claim
23	123	Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling	claim
24	120	A New Principle for Incremental Heuristic Search: Theoretical Results	claim
25	119	Evaluating Mixed-Initiative Systems: An Experimental Approach	claim
26	118	Optimal STRIPS Planning by Maximum Satisfiability and Accumulative Learning	claim
27	116	Lessons Learned in Applying Domain-Independent Planning to High-Speed Manufacturing	claim
28	114	Planning for PDDL3 - An OCSP Based Approach	claim
29	114	RRT-Plan: A Randomized Algorithm for STRIPS Planning	claim
30	113	Resource Contention Metrics for Oversubscribed Scheduling Problems	claim
31	112	Friends or Foes? An AI Planning Perspective on Abstraction and Search	claim
32	112	An Empirical Study of Multi-Point Constructive Search for Constraint-Based Scheduling	claim
33	111	On the Use of UML.P for Modeling a Real Application as a Planning Problem	claim
34	110	Optimal Rectangle Packing: A Meta-CSP Approach	claim
35	110	On Some Tractable Cases of Logical Filtering	claim
36	109	Fast Probabilistic Planning through Weighted Model Counting	claim
37	108	On the Compilation of Plan Constraints and Preferences	claim
38	107	Explanation-Based Acquisition of Planning Operators	claim
39	107	Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems	claim
40	105	New Complexity Results for Classical Planning Benchmarks	claim
41	105	Learning to Do HTN Planning	claim
42	101	Lemma Reusing for SAT based Planning and Scheduling	claim
43	97	Memory-Efficient Symbolic Heuristic Search	claim
44	97	An Affectively Driven Planner for Synthetic Characters	claim
45	96	Optimal Route Planning under Uncertainty	claim
46	94	Metatheoretic Plan Summarization and Comparison	claim
47	92	Incremental Scheduling to Maximize Quality in a Dynamic Environment	claim
48	90	Plan Stability: Replanning versus Plan Repair	claim
49	90	Knowledge-based Middleware as an Architecture for Planning and Scheduling Systems	claim
50	88	Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning	claim
51	88	Safe LTL Assumption-Based Planning	claim
52	79	Learning Heuristic Functions from Relaxed Plans	claim
53	77	Stochastic Over-Subscription Planning Using Hierarchies of MDPs	claim
54	72	Spacetrack: Trading off Quality and Utilization in Oversubscribed Schedules	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers