@inproceedings{atz04,
	author    = "Douglas Aberdeen and Sylvie Thi{\'e}baux and Lin Zhang",
	title     = "Decision-Theoretic Military Operations Planning",
	booktitle = "ICAPS",
	year      = "2004",
	pages     = "402-412",
}

@BOOK{b57,
	author = "R. Bellman",
	title = "Dynamic Programming",
	publisher = "Princeton University Press",
	year = "1957"
}

@book{b01, 
	title = "Dynamic Programming and Optimal Control",
	author = "Dimitri P. Bertsekas",
	edition = "2",
	publisher = "Athena Scientific",
	volume = "2",
	year = "2001",
}

@ARTICLE{bdh99,
	author = "Craig Boutilier and Thomas Dean and Steve Hanks",
	title = "Decision-Theoretic Planning: Structural Assumptions and Computational Leverage",
	journal = "J. of Artificial Intelligence Research",
	pages = "1-94",
	volume = "11",
	year="1999"
}
	
@InProceedings{bg00,
	author = "B. Bonet and H. Geffner",
	title = "Planning with Incomplete Information as Heuristic Search in Belief Space",
	pages = "52--61",
	booktitle = "ICAPS",
	year = "2000",
}

@book{bt96,
	author = "Dimitri P. Bertsekas and John N. Tsitsiklis",
	title = "Neuro-Dynamic Programming",
	year = "1996",
	publisher = "Athena Scientific"
}

@book{b00,
	author = "Dimitri P. Bertsekas",
	title = "Dynamic Programming and Optimal Control",
	year = "2000",
	volume = "2",
	publisher = "Athena Scientific",
}

@article{b07,
	author = "Blai Bonet",
	title = "On the Speed of Convergence of Value Iteration on Stochastic Shortest-Path Problems",
	journal = "Mathematics of Operations Research",
	volume = "32",
	number = "2",
	year = "2007",
	pages = "365-373",
}

@ARTICLE{bbs95,
	author= "A.G. Barto and S.J. Bradtke and S.P. Singh",
	title= "Learning to act using real-time dynamic programming",
	journal = "Artificial Intelligence J.",
	volume = "72",
	year = "1995",
	pages = "81-138"
}
	
@inproceedings{bdmrsw02,
	author    = "John L. Bresina and Richard Dearden and Nicolas Meuleau and Sailesh Ramkrishnan and David E. Smith and Richard Washington",
	title     = "Planning under Continuous Time and Resource Uncertainty: A Challenge for {AI}",
	booktitle = "UAI",
	year      = "2002",
	pages     = "77-84",
}

@inproceedings{ba07,
	author = "Oliver Buffet and Douglas Aberdeen",
	title = "{FF+FPG}: Guiding a Policy-Gradient Planner",
	booktitle = "ICAPS",
	year = "2007",
	pages = "42-48"
}

@inproceedings{bjmr05,
	author    = "John L. Bresina and Ari K. J{\'o}nsson and Paul H. Morris and Kanna Rajan",
	title     = "Activity Planning for the Mars Exploration Rovers",
	booktitle = "ICAPS",
	year      = "2005",
	pages     = "40-49",
}

@inproceedings{dg07,
	author = "Peng Dai and Judy Goldsmith",
	title = "Topological Value Iteration Algorithm for {M}arkov Decision Processes",
	booktitle = "IJCAI",
	pages = "1860-1865",
	year = "2007",
}

@techreport{bck07,
	author = "Daniel Bryce and William Cushing and and Subbarao Kambhampati",
	title = "Probabilistic Planning is Multiobjective!", 
	number = "ASU CSE TR-07-006", 
	month = "June",
	year = "2007",
}

@inproceedings{g95,
	author = "Geoff Gordon",
	title = "Stable Function Approximation in Dynamic Programming",
	booktitle = "ICML",
	year = "1995",
	pages = "261--268"
}

@inproceedings{gp06,
	author    = "Lucie Galand and Patrice Perny",
	title     = "Search for Compromise Solutions in Multiobjective State Space Graphs",
	booktitle = "ECAI",
	year      = "2006",
	pages     = "93-97",
}

@BOOK{h60,
	author = "R.A. Howard",
	title = "Dynamic Programming and {M}arkov Processes",
	publisher = "MIT Press",
	address = "Cambridge, Massachusetts",
	year = "1960"
}

@misc{ipc5,
	note = "http://www.ldc.usb.ve/~bonet/ipc5/",
	year = "2006",
}

@inproceedings{ldk95,
	author    = "Michael L. Littman and Thomas Dean and Leslie Pack Kaelbling",
	title     = "On the Complexity of Solving {M}arkov Decision Problems",
	booktitle = "UAI",
	year      = "1995",
	pages     = "394-402",
}

@inproceedings{mcgdb07,
	author    = "D. J. Musliner and J. Carciofini and R. P. Goldman and E. H. Durfee, J. Wu and M. S. Boddy",
	title     = "Flexibly Integrating Deliberation and Execution in Decision-Theoretic Agents",
	booktitle = "ICAPS Workshop on Planning and Plan-Execution for Real-World Systems",
	year      = "2007"
}

@book{p94,
	author = "M.L. Puterman",
	title = "{M}arkov Decision Processes: Discrete Stochastic Dynamic Programming",
	publisher = "John Wiley, New York",
	year = "1994",
}

@inproceedings{sngkds07,
	author    = "Biplav Srivastava and Tuan A. Nguyen and Alfonso Gerevini and Subbarao Kambhampati and Minh Binh Do and Ivan Serina",
	title = "Domain Independent Approaches for Finding Diverse Plans",
	booktitle = "IJCAI",
	year = "2007",
	pages     = "2016-2022",
}

@article{ws05,
	author = "David Wingate and Kevin D. Seppi",
	title = "Prioritization Methods for Accelerating {MDP} Solvers",
	journal = "JMLR",
	volume = "6",
	year = "2005",
	pages = "851-881",
	publisher = "MIT Press",
}

@misc{turk,
	title = "Amazon Mechanical Turk",
	note = "http://en.wikipedia.org/wiki/Amazon\_Mechanical\_Turk",
}

@article{mm02,
	author = "R\'{e}mi Munos and Andrew Moore",
	title = "Variable Resolution Discretization in Optimal Control",
	journal = "Machine Learning",
	volume = "49",
	number = "2-3",
	year = "2002",
	pages = "291-323",
}

@inproceedings{mm99,
	Author = " Remi Munos and Andrew Moore ",
	Title = "Influence and Variance of a {M}arkov Chain: Application to adaptive discretization in optimal control",
	Booktitle = "CDC",
	year = "1999",
}

@article{bertsekas:mor:91,
journal = {Mathematics of Operations Research},
volume = {16},
number = {3},
year = {1991},
pages = { 580--595},
doi = {10.1287/moor.16.3.580},
title = {An Analysis of Stochastic Shortest Path Problems},
author = {Dimitri P.~Bertsekas and  John N.~Tsitsiklis }
}

@article{neilsen:ejor:06,
author = {Lars Relund Nielsen and  Anders Ringgaard Kristensen}, 
title = {Finding the K best policies in finite-horizon MDPs},
journal = {European Journal of Operational Research},
volume = {175},
number = {2},
pages = {1164--1179},
year= {2006}
}

@article{neilsen:orl:06,
author = {Lars Relund Nielsen and  Daniele Pretolani and  Kim Allan Andersen}, 
title = {Finding the K shortest hyperpaths using reoptimization},
journal = { Oper. Res. Lett.},
volume = {34},
number = {2},
pages = {155--164},
year= {2006}
}

@article{neilsen:cor:05,
author = {Lars Relund Nielsen and  Kim Allan Andersen and  Daniele Pretolani}, 
title = {Finding the K shortest hyperpaths},
journal = {Computers \& OR},
volume = {32},
pages = {1477--1497},
year= {2005}
}


