\n
\n\n \n \n \n \n \n \n Monitoring Plan Optimality During Execution.\n \n \n \n \n\n\n \n Fritz, C.; and McIlraith, S. A.\n\n\n \n\n\n\n In
Proceedings of the 17th International Conference on Automated Planning and Scheduling (ICAPS), pages 144–151, Providence, Rhode Island, USA, September 22 - 26 2007. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n\n\n
\n
@InProceedings{ fri-mci-icaps07,\n author = \t {Christian Fritz and Sheila A. McIlraith},\n title = \t {Monitoring Plan Optimality During Execution},\n booktitle = {Proceedings of the 17th International Conference on Automated Planning and Scheduling (ICAPS)},\n year = \t 2007,\n urlPaper= {fri-mci-icaps07.pdf},\n address = \t {Providence, Rhode Island, USA},\n month = \t {September 22 - 26},\n pages = {144--151},\n keywords = {Execution Monitoring}\n}\n\n
\n
\n\n\n\n
\n
\n\n \n \n \n \n \n \n Exploiting Procedural Domain Control Knowledge in State-of-the-Art Planners.\n \n \n \n \n\n\n \n Baier, J. A.; Fritz, C.; and McIlraith, S. A.\n\n\n \n\n\n\n In
Proceedings of the 17th International Conference on Automated Planning and Scheduling (ICAPS), pages 26–33, Providence, Rhode Island, USA, September 22–26 2007. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n\n\n
\n
@InProceedings{ bai-fri-mci-icaps07,\n author = \t {Jorge A. Baier and Christian Fritz and Sheila A. McIlraith},\n title = \t {Exploiting Procedural Domain Control Knowledge in State-of-the-Art Planners},\n booktitle = {Proceedings of the 17th International Conference on Automated Planning and Scheduling (ICAPS)},\n year = \t 2007,\n urlPaper= {bai-fri-mci-icaps07.pdf},\n address = \t {Providence, Rhode Island, USA},\n month = \t {September 22--26},\n pages = {26--33},\n OPTnote = { <i>The proofs of the included theorems can be found in <a href="ftp://ftp.cs.toronto.edu/csrg-technical-reports/565/565.pdf">Technical Report CSRG-565</a>.</i>},\n abstract = {Domain control knowledge (DCK) has proven effective in improving\nthe efficiency of plan generation by reducing the search space\nfor a plan. Procedural DCK is a compelling type of DCK that\nsupports a natural specification of the skeleton of a plan.\nUnfortunately, most state-of-the-art planners do not have the\nmachinery necessary to exploit procedural DCK. To resolve this\ndeficiency, we propose to compile procedural DCK directly into\nPDDL2.1, thus enabling any PDDL2.1-compatible planner to exploit\nit. The contribution of this paper is threefold. First, we\npropose a PDDL-based semantics for an Algol-like, procedural\nlanguage that can be used to specify DCK in planning. Second, we\nprovide a polynomial algorithm that translates an ADL planning\ninstance and a DCK program, into an equivalent, program-free\nPDDL2.1 instance whose plans are only those that adhere to the\nprogram. Third, we argue that the resulting planning instance is\nwell-suited to being solved by domain-independent heuristic\nplanners. To this end, we propose three approaches to computing\ndomain-independent heuristics for our translated instances,\nsometimes leveraging properties of our translation to guide\nsearch. In our experiments on familiar PDDL planning benchmarks\nwe show that the proposed compilation of procedural DCK can\nsignificantly speed up the performance of a heuristic search\nplanner. Our translators are implemented and available on the\nweb.\n},\n keywords = {Golog}\n}\n\n
\n
\n\n\n
\n Domain control knowledge (DCK) has proven effective in improving the efficiency of plan generation by reducing the search space for a plan. Procedural DCK is a compelling type of DCK that supports a natural specification of the skeleton of a plan. Unfortunately, most state-of-the-art planners do not have the machinery necessary to exploit procedural DCK. To resolve this deficiency, we propose to compile procedural DCK directly into PDDL2.1, thus enabling any PDDL2.1-compatible planner to exploit it. The contribution of this paper is threefold. First, we propose a PDDL-based semantics for an Algol-like, procedural language that can be used to specify DCK in planning. Second, we provide a polynomial algorithm that translates an ADL planning instance and a DCK program, into an equivalent, program-free PDDL2.1 instance whose plans are only those that adhere to the program. Third, we argue that the resulting planning instance is well-suited to being solved by domain-independent heuristic planners. To this end, we propose three approaches to computing domain-independent heuristics for our translated instances, sometimes leveraging properties of our translation to guide search. In our experiments on familiar PDDL planning benchmarks we show that the proposed compilation of procedural DCK can significantly speed up the performance of a heuristic search planner. Our translators are implemented and available on the web. \n
\n\n\n
\n
\n\n \n \n \n \n \n \n Monitoring the Execution of Optimal Plans.\n \n \n \n \n\n\n \n Fritz, C.\n\n\n \n\n\n\n In
The 17th International Conference on Automated Planning and Scheduling (ICAPS) Doctoral Consortium, Providence, Rhode Island, USA, September 22 2007. \n
Best Paper\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n\n\n
\n
@InProceedings{ fri-icaps07DC,\n author = \t {Christian Fritz},\n title = \t {Monitoring the Execution of Optimal Plans},\n booktitle = {The 17th International Conference on Automated Planning and Scheduling (ICAPS) Doctoral Consortium},\n year = \t 2007,\n urlPaper= {fri-icaps07DC.pdf},\n address = \t {Providence, Rhode Island, USA},\n month = \t {September 22},\n note = {<b>Best Paper</b>},\n keywords = {Execution Monitoring}\n}\n\n
\n
\n\n\n\n
\n
\n\n \n \n \n \n \n \n Monitoring Policy Execution.\n \n \n \n \n\n\n \n Fritz, C.; and McIlraith, S. A.\n\n\n \n\n\n\n In
Proceedings of the 3rd Workshop on Planning and Plan Execution for Real-World Systems (at ICAPS07), Providence, Rhode Island, USA, September 22 2007. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n\n\n
\n
@InProceedings{fri-mci-icaps07ws,\n author = \t {Christian Fritz and Sheila A. McIlraith},\n title = \t {Monitoring Policy Execution},\n booktitle =\t {Proceedings of the 3rd Workshop on Planning and Plan Execution for Real-World Systems (at ICAPS07)},\n year =\t 2007,\n urlPaper= {fri-mci-icaps07WS.pdf},\n address =\t {Providence, Rhode Island, USA},\n month =\t {September 22},\n keywords = {Execution Monitoring}\n}\n\n\n
\n
\n\n\n\n
\n
\n\n \n \n \n \n \n \n Monitoring Plan Optimality during Execution: Theory and Implementation.\n \n \n \n \n\n\n \n Fritz, C.; and McIlraith, S.\n\n\n \n\n\n\n In
Proceedings of the 18th International Workshop on Principles of Diagnosis (DX), pages 298–305, Nashville, TN, USA, May 29–31 2007. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n\n\n
\n
@InProceedings{ fri-mci-dx07.pdf_200705141423,\n AUTHOR={Christian Fritz and Sheila McIlraith},\n TITLE={Monitoring Plan Optimality during Execution: Theory and Implementation},\n BOOKTITLE={Proceedings of the 18th International Workshop on Principles of Diagnosis (DX)},\n YEAR={2007},\n address={Nashville, TN, USA},\n month={May 29--31},\n pages={298--305},\n URLPaper={200705141423_fri-mci-dx07.pdf},\n keywords = {Execution Monitoring}\n}\n\n
\n
\n\n\n\n