Solving Time-Dependent Planning Problems Export

@techreport{BOD89, abstract = {We are interested in constructing solutions to time-dependent planning problems: problems in which time spent planning affects the utility of the system''s performance. In a previous paper, we define a fraomework for constructing solutions to time-dependent planning problems called expectation-driven iterative refinement. In this paper, we analyze and solve a moderately complex time-dependent planning problem involving path planning for a mobile robot, as a way of exploring a methodology for applying expectation-driven iterative refinement.}, address = {Providence, RI, USA}, author = {Boddy, Mark and Dean, Thomas}, citeulike-article-id = {4193713}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=864778}, keywords = {anytime, planning, robotics}, posted-at = {2009-03-19 01:14:58}, priority = {0}, publisher = {Brown University}, title = {Solving Time-Dependent Planning Problems}, url = {http://portal.acm.org/citation.cfm?id=864778}, year = {1989} }

TY - RPRT ID - BOD89 L3 - citeulike-article-id:4193713 N2 - We are interested in constructing solutions to time-dependent planning problems: problems in which time spent planning affects the utility of the system''s performance. In a previous paper, we define a fraomework for constructing solutions to time-dependent planning problems called expectation-driven iterative refinement. In this paper, we analyze and solve a moderately complex time-dependent planning problem involving path planning for a mobile robot, as a way of exploring a methodology for applying expectation-driven iterative refinement. AD - Providence, RI, USA TI - Solving Time-Dependent Planning Problems PB - Brown University KW - anytime KW - planning KW - robotics AU - Boddy, Mark AU - Dean, Thomas PY - 1989/// UR - http://portal.acm.org/citation.cfm?id=864778 ER -