{"type":"ScholarlyArticle","title":"Solving Time-Dependent Planning Problems","authors":[{"name":"Mark S. Boddy","slug":"mark-s-boddy","given":"Mark S.","family":"Boddy","affiliation":""},{"name":"Thomas L. Dean","slug":"thomas-l-dean","given":"Thomas L.","family":"Dean","affiliation":""}],"abstract":"A planning problem is time-dependent, if the time spent planning affects the utility of the system's performance . In [Dean and Boddy, 1988], we define a framework 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 . The fact that we construct a solution to the proposed problem without appealing to luck or extraordinary inspiration provides evidence that expectation-driven iterative refinement is an appropriate framework for solving time-dependent planning problems.","doi":null,"url":"https://ijcai.org/proceedings/1989/157","pdf":"https://ijcai.org/proceedings/1989/0157.pdf","markdown":"https://ijcai.org/proceedings/1989/157.md","bibtex":"https://ijcai.org/proceedings/1989/bibtex/157","volume":{"slug":"1989","title":"Proceedings of the Eleventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1989","url":"https://ijcai.org/proceedings/1989/","year":1989,"location":"Detroit, Michigan, USA","dates":"August 20-25 1989","editors":"N. S. Sridharan","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Planning, Scheduling, Reasoning About Actions","track":"Planning, Scheduling, Reasoning About Actions","number":157,"pages":{"first":979,"last":983},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}