See this document in CiteSeerX!

Exploiting Structure for Planning and Control (1997)  (Make Corrections)  (1 citation)
Shieu-Hong Lin



  Home/Search   Context   Related

Links:   ACM

 
View or download:
brown.edu/pub/techreport...cs9714.ps.Z
brown.edu/pub/techreport...cs9714.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  brown.edu (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: of " Exploiting Structure for Planning and Control " by Shieu-Hong Lin, Ph.D., Brown University, May 1997. Thesis advisor Thomas L. Dean. Discrete dynamical systems in the form of finite automata or Markov decision processes have been used as a representational and computational foundation for planning under uncertainty. Many AI planning problems can be conveniently viewed as control problems over the underlying discrete dynamical systems. Using AI-style representation, the features of... (Update)

Context of citations to this paper:   More

.... progress has been made on understanding some very special cases where MDPs may be decomposed into independent subproblems (Singh, 1992; Lin, 1997), much of the effort has focused on methods that decompose MDPs into communicating subproblems (Bertsekas Tsitsiklis, 1989; Dean...

Cited by:   More
Flexible Decomposition Algorithms for Weakly Coupled Markov.. - Parr (1998)   (Correct)

Similar documents (at the sentence level):
21.8%:   Decomposition Techniques for Planning in Stochastic Domains - Dean, Lin (1995)   (Correct)
15.5%:   Localized Temporal Reasoning Using Subgoals And Computational.. - Lin, Dean (1996)   (Correct)

Active bibliography (related documents):   More   All
1.6:   Decision Theoretic Planning: Structural Assumptions and.. - Boutilier, Dean, Hanks (1999)   (Correct)
1.3:   Decision-Theoretic Planning and Markov Decision Processes - Dean (1994)   (Correct)
0.7:   Predicting Real-Time Planner Preformance By Domain Charactorization - Kirman (1994)   (Correct)

Similar documents based on text:   More   All
0.4:   Fault-Tolerant and Efficient Parallel Computation - Shvartsman (1992)   (Correct)
0.3:   Three-Dimensional Shape Representation via Shock Flows - Leymarie (2003)   (Correct)
0.3:   A Computational Theory of Decision Networks - Zhang, Qi, Poole (1994)   (Correct)

BibTeX entry:   (Update)

Lin, S.-H. (1997). Exploiting Structure for Planning and Control. Ph.D. thesis, Computer Science Department, Brown University, Providence, Rhode Island. http://citeseer.ist.psu.edu/lin97exploiting.html   More

@techreport{ lin97exploiting,
    author = "Shieu-Hong Lin and Thesis",
    title = "Exploiting Structure for Planning and Control",
    number = "CS-97-14",
    year = "1997",
    url = "citeseer.ist.psu.edu/lin97exploiting.html" }
Citations (may not include all citations):
1911   Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
1543   Probabilistic Reasoning in Intelligent Systems: Networks of .. (context) - Pearl - 1988  ACM
1044   Maintaining knowledge about temporal intervals (context) - Allen - 1983  ACM   DBLP
981   Principles of Database and Knowledge Base Systems (context) - Ullman - 1988
891   Strips: A new approach to the application of theorem proving.. (context) - Fikes, Nilsson - 1971  DBLP
891   Strips: A new approach to the application of theorem proving.. (context) - Fikes, Nilsson - 1971  DBLP
582   Local computations with probabilities on graphical structure.. (context) - Lauritzen, Spiegelhalter - 1988  ACM
451   Planning for conjunctive goals (context) - Chapman - 1987  ACM   DBLP
411   Random Graphs (context) - Bollob'as - 1985  ACM
324   A logic-based calculus of events (context) - Kowalski, Sergot - 1986  ACM   DBLP
308   The control of discrete event systems (context) - Ramadge, Wonham - 1989
308   The control of discrete event systems (context) - Ramadge, Wonham - 1989
288   Planning in a hierarchy of abstraction spaces (context) - Sacerdoti - 1974  DBLP
288   Planning in a hierarchy of abstraction spaces (context) - Sacerdoti - 1974  DBLP
284   The computational complexity of probabilistic inference usin.. (context) - Cooper - 1990  DBLP
268   Dynamic Programming and Markov Processes (context) - Howard - 1960
263   Database System Concepts (context) - Korth, Silberschatz - 1991  ACM
259   Elements of the Theory of Computation (context) - Lewis, Papadimitriou - 1981  ACM
246   Markov Decision Processes (context) - Puterman - 1994  ACM
242   Planning and Control (context) - Dean, Wellman - 1991  ACM
199   A model for reasoning about persistence and causation (context) - Dean, Kanazawa - 1989  ACM
186   partial order planner for ADL (context) - Penberthy, Weld et al. - 1992
178   Symbolic model checking for sequential circuit verification - Burch, Clarke et al. - 1994  ACM
166   Evaluating influence diagrams (context) - Shachter - 1986  ACM
148   Acting optimally in partially observable stochastic domains - Cassandra, Kaelbling et al. - 1994  ACM   DBLP
147   The computational complexity of propositional STRIPS plannin.. - Bylander - 1994  ACM   DBLP
146   Computers and Intractibility: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
146   An algorithm for probabilistic planning - Kushmerick, Hanks et al. - 1994  ACM   DBLP
140   Probabilistic planning with information gathering and contin.. - Draper, Hanks et al. - 1994  DBLP
139   Planning as search: A quantitative approach (context) - Korf - 1987  ACM   DBLP
137   Randomized preprocessing of configuration space for fast pat.. - Kavraki, Latombe - 1994  DBLP
136   Exploiting structure in policy construction - Boutilier, Dearden et al. - 1995  ACM   DBLP
120   Planning with deadlines in stochastic domains - Dean, Kaelbling et al. - 1993  DBLP
115   The parti-game algorithm for variable resolution reinforceme.. - Moore, Atkeson - 1995
114   Partial order planning: Evaluating possible efficiency gains - Barrett, Weld - 1993
108   Approximating probabilistic inference in Bayesian belief net.. (context) - Dagum, Luby - 1993  ACM   DBLP
101   Adaptive Control Processes (context) - Bellman - 1961
90   Planning under time constraints in stochastic domains - Dean, Kaelbling et al. - 1995  ACM   DBLP
84   Bayesian updating in recursive graphical models by local com.. (context) - Jensen, Lauritzen et al. - 1990
82   Reasoning about partially ordered events (context) - Dean, Boddy - 1988  ACM   DBLP
82   Systematic nonlinear planning - McAllester, Rosenblitt - 1991  DBLP
82   Finite State Markovian Decision Processes (context) - Derman - 1970  ACM
82   Reasoning about partially ordered events (context) - Dean, Boddy - 1988  ACM   DBLP
81   Critical behavior in the satisfiability of random boolean fo.. - Kirkpatrick, Selman - 1994
75   Linear Programming and Network Flows (context) - Sherali, Bazaraa et al. - 1990
73   Introduction to Probabilistic Automata (context) - Paz - 1971
72   Using abstractions for decision theoretic planning with time.. - Boutilier, Dearden - 1994
71   Macro-operators: A weak method for learning (context) - Korf - 1985  DBLP
71   Kluwer Academic Publishers (context) - Latombe, Planning - 1990
64   Planning under uncertainty: Structural assumptions and compu.. - Boutilier, Dean et al. - 1995
63   Decomposition techniques for planning in stochastic domains - Dean, Lin - 1995  ACM   DBLP
59   Feature-based methods for large scale dynamic programming - Tsitsiklis, Van Roy - 1996  ACM   DBLP
59   the complexity of solving Markov decision problems - Littman, Dean et al. - 1995
58   Dynamic Programming (context) - Bertsekas - 1987  ACM
58   Online minimization of transition systems (context) - Lee, Yannakakis - 1992
55   Optimization Theory for Large Systems (context) - Lasdon - 1970
51   Model minimization in Markov decision processes - Dean, Givan - 1997  DBLP
50   Freeman and Company (context) - Chvatal - 1980
49   Munin: A causal probabilistic network for interpretion of el.. (context) - Andreassen, Woldbye et al. - 1987
49   Abtweak: Abstracting a nonlinear (context) - Yang, Tenenberg - 1990
47   Search reduction in hierarchical problem solving - Knoblock - 1991  DBLP
47   Search reduction in hierarchical problem solving - Knoblock - 1991  DBLP
44   Localized event-based reasoning for multiagent domains (context) - Lansky - 1988  DBLP
44   Relational Database Theory (context) - Atzeni, De Antonellis - 1993  ACM
38   Publications of the Mathematical Institute of the Hungarian .. (context) - Erdos, R'enyi et al. - 1960
37   Symbolic probabilistic inference in belief networks (context) - Shachter, D'Ambrosio et al. - 1990  DBLP
34   A system for reasoning about time (context) - Vilain - 1982  DBLP
32   the computational complexity of temporal projection planning.. - Nebel, Backstrom - 1994
32   the computational complexity of temporal projection and plan.. - Nebel, Backstrom - 1992
31   Dealing with time granularity in the event calculus (context) - Montanari - 1992  DBLP
31   and Austin Tate (context) - Allen, Hendler - 1990
28   IEEE Transactions on Systems (context) - Tatman, Shachter et al. - 1990
28   the consistency of hierarchical supervision in discrete-even.. (context) - Zhong, Wonham - 1990
27   Skeptical and credulous event calculi for supporting modal q.. (context) - Chittaro - 1994  DBLP
27   Abstraction in planning (context) - Tenenberg - 1991  ACM
26   Stochastic Optimal Control: The Discrete Time Case (context) - Bertsekas, Shreve - 1978
24   Efficient temporal reasoning through timegraphs (context) - Gerevini, Schubert - 1993
23   Robot Motion Planning (context) - Latombe - 1990  ACM
22   Mechanizing temporal knowledge (context) - Kahn, Gorry - 1977  DBLP
22   Reasoning in time and space (context) - Malik, Binford - 1983  DBLP
22   Adaptive aggregation for infinite horizon dynamic programmin.. (context) - Bertsekas, non - 1989
20   Aggregation methods for large Markov chains (context) - Schweitzer - 1984  ACM   DBLP
18   Solving time-critical decisionmaking problems with predictab.. - Greenwald, Dean - 1994
18   The macro-event calculus: Representing temporal granularity (context) - Evans - 1990
15   A decision-theoretic approach to planning (context) - Basye, Dean et al. - 1992
15   Toward approximate planning in very large stochastic domains - Nicholson, Kaelbling - 1994
14   Hierarchical learning in stochastic domains: A preliminary r.. - Kaelbling - 1993
13   Exploiting locality in temporal reasoning (context) - Lin, Dean - 1994  ACM
13   Exploiting locality in temporal reasoning (context) - Lin, Dean - 1993  ACM
13   Deliberation scheduling for time-critical sequential decisio.. - Dean, Kaelbling et al. - 1993  DBLP
13   COCOLOG: A conditional observer and controller logic for fin.. - Caines, Wang - 1990
13   Exploiting locality in temporal reasoning (context) - Lin, Dean - 1995  ACM
12   Representation and evaluation of plans with loops (context) - Smith, Williamson - 1995
11   Mathematical programming and the control of Markov chains (context) - Kushner, Kleinman - 1971
11   Decomposition of systems governed by Markov chains (context) - Kushner, Chen - 1974
11   Mathematical programming and the control of markov chains (context) - Kushner, Kleinman - 1971
11   Testing finite state machines: State identification and veri.. (context) - Lee, Yannakakis - 1994
11   Predicting Real-Time Planner Performance by Domain Character.. (context) - Jak - 1994  ACM
11   Decomposition of systems governed by markov chains (context) - Kushner, Chen - 1974
10   Howard and James E (context) - Howard, Matheson et al. - 1984
8   Anticipating computational demands when solving time-critica.. - Greenwald, Dean - 1995  ACM
8   A hierarchical planner that generates its own abstraction hi.. (context) - Christensen - 1990
7   Papadimitriou and Kenneth Steiglitz (context) - Christos - 1982
7   Decomposition principle for dynamic programs (context) - Dantzig, Wolfe - 1960
7   Generating optimal policies for high-level plans with condit.. (context) - Lin, Dean - 1995  ACM
6   An introduction to partial-order planning (context) - Weld - 1994
5   Decision-theoretic control of problem solving: Principles an.. (context) - Breese, Fehling - 1988
4   The complexity of Markov chain decision processes (context) - Papadimitriou, Tsitsiklis - 1987
4   Sur un probl'eme de production et de stockage dans l'aleatoi.. (context) - D'Epenoux - 1963
4   an introduction to the special issue on planning and schedul.. (context) - McDermott, Hendler et al. - 1995
4   The complexity of markov chain decision processes (context) - Papadimitriou, Tsitsiklis - 1987
4   and control (context) - Dean, execution - 1987
2   Decision-theoretic planning using inheritance abstraction (context) - Haddawy, Suwandi - 1994
2   A probabilistic analysis of STRIPS planning (context) - Bylander - 1996
2   Managing time maps (context) - Dean - 1984
2   Planning paradigms (context) - Dean - 1988
1   Localized temporal projection using subgoals and abstraction (context) - Lin, Dean - 1996

Documents on the same site (http://www.math.jussieu.fr/~fermigie/fermivista/ftp/ftp.cs.brown.edu.html):   More
Indexing for Data Models with Constraints and Classes - Kanellakis, Ramaswamy.. (1993)   (Correct)
Reinforcement Learning for Planning and Control - Dean, Basye, Shewchuk (1993)   (Correct)
An Interactive 3D Toolkit for Constructing 3D Widgets - Zeleznik, Herndon..   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC