{"type":"ScholarlyArticle","title":"Operator Counting Heuristics for Probabilistic Planning","authors":[{"name":"Felipe Trevizan","slug":"felipe-trevizan","given":"Felipe","family":"Trevizan","affiliation":"Research School of Computer Science , Australian National University Data61 , CSIRO"},{"name":"Sylvie Thiébaux","slug":"sylvie-thiebaux","given":"Sylvie","family":"Thiébaux","affiliation":"Research School of Computer Science , Australian National University Data61 , CSIRO"},{"name":"Patrik Haslum","slug":"patrik-haslum","given":"Patrik","family":"Haslum","affiliation":"Research School of Computer Science , Australian National University Data61 , CSIRO"}],"abstract":"For the past 25 years, heuristic search has been used to solve domain-independent probabilistic planning problems, but with heuristics that determinise the problem and ignore precious probabilistic information. In this paper, we present a generalization of the operator-counting family of heuristics to Stochastic Shortest Path problems (SSPs) that is able to represent the probability of the actions outcomes. Our experiments show that the equivalent of the net change heuristic in this generalized framework obtains significant run time and coverage improvements over other state-of-the-art heuristics in different planners.","doi":"10.24963/ijcai.2018/758","url":"https://ijcai.org/proceedings/2018/758","pdf":"https://ijcai.org/proceedings/2018/0758.pdf","markdown":"https://ijcai.org/proceedings/2018/758.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/758","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Sister Conferences Best Papers","track":"Best Sister Conferences","number":758,"pages":{"first":5384,"last":5388},"keywords":["Planning and Scheduling: Markov Decisions Processes","Planning and Scheduling: Planning under Uncertainty"],"videos":[],"references":[{"position":1,"raw":"[Altman, 1999] Eitan Altman. Constrained Markov Deci- sion Processes, volume 7. CRC Press, 1999.","title":"Constrained Markov Decision Processes","authors":"Eitan Altman","year":"1999","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Backström, 1992] Christer Backström. Equivalence and tractability results for SAS + planning. In Proc. 3rd Int. Conf. on Principles of Knowledge Representation and Reasoning (KR), 1992.","title":"Equivalence and tractability results for SAS + planning","authors":"Christer Backström","year":"1992","venue":"Proc. 3rd Int. Conf. on Principles of Knowledge Representation and Reasoning (KR)","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Barto et al., 1995] Andrew G. Barto, Steven J. Bradtke, and Satinder P. Singh. Learning to act using real-time dynamic programming. Artif. Intell., 72(1-2):81-138, 1995.","title":"Learning to act using real-time dynamic programming","authors":"Andrew G Barto, Steven J Bradtke, Satinder P Singh","year":"1995","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bertsekas and Tsitsiklis, 1991] D.P. Bertsekas and J.N. Tsitsiklis. An Analysis of Stochastic Shortest Path Prob- lems. Mathematics of Operations Research, 16(3):580- 595, 1991.","title":"An Analysis of Stochastic Shortest Path Problems","authors":"D P Bertsekas, J N Tsitsiklis","year":"1991","venue":"Mathematics of Operations Research","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bonet and Geffner, 2001] Blai Bonet and Hector Geffner. Planning as heuristic search. Artif. Intell., 129(1-2):5-33, 2001.","title":"Planning as heuristic search","authors":"Geffner Bonet, Blai Bonet, Hector Geffner","year":"2001","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bonet and Geffner, 2003] Blai Bonet and Hector Geffner. Labeled RTDP: improving the convergence of real-time dynamic programming. In Proc. Int. Conf. on Automated Planning and Scheduling, 2003.","title":"Labeled RTDP: improving the convergence of real-time dynamic programming","authors":"Geffner ; ] Blai Bonet, Hector Bonet, Geffner","year":"2003","venue":"Proc. Int. Conf. on Automated Planning and Scheduling","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bonet and van den Briel, 2014] Blai Bonet and Menkes van den Briel. Flow-based heuristics for optimal planning: Landmarks and merges. In Proc. Int. Conf. on Automated Planning and Scheduling, 2014.","title":"Flow-based heuristics for optimal planning: Landmarks and merges","authors":"Van Bonet, Blai Den Briel ;, Menkes Bonet, Van Den, Briel","year":"2014","venue":"Proc. Int. Conf. on Automated Planning and Scheduling","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[D'Epenoux, 1963] F. D'Epenoux. A probabilistic produc- tion and inventory problem. Management Science, 10:98- 108, 1963.","title":"A probabilistic production and inventory problem","authors":"F D Epenoux","year":"1963","venue":"Management Science","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Dolgov and Durfee, 2005] Dmitri A. Dolgov and Ed- mund H. Durfee. Stationary deterministic policies for con- strained mdps with multiple rewards, costs, and discount factors. In Proc. Int. Joint Conf. on Artificial Intelligence, 2005.","title":"Stationary deterministic policies for constrained mdps with multiple rewards, costs, and discount factors","authors":"Dmitri A Dolgov, Edmund H Durfee","year":"2005","venue":"Proc. Int. Joint Conf. on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2005/236"},{"position":10,"raw":"[Hansen and Zilberstein, 2001] Eric A Hansen and Shlomo Zilberstein. LAO*: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence, 129(1):35-62, 2001.","title":"LAO*: A heuristic search algorithm that finds solutions with loops","authors":"Zilberstein Hansen, Eric A Hansen, Shlomo Zilberstein","year":"2001","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Haslum and Geffner, 2000] Patrik Haslum and Hector Geffner. Admissible heuristics for optimal planning. In Proc. Int. Conf. of Artificial Intelligence Planning Systems, pages 140-149, 2000.","title":"Admissible heuristics for optimal planning","authors":"Geffner Haslum, Patrik Haslum, Hector Geffner","year":"2000","venue":"Proc. Int. Conf. of Artificial Intelligence Planning Systems","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Helmert and Domshlak, 2009] Malte Helmert and Carmel Domshlak. Landmarks, critical paths and abstractions: What's the difference anyway? In Proc. Int. Conf. on Au- tomated Planning and Scheduling, 2009.","title":"Landmarks, critical paths and abstractions: What's the difference anyway?","authors":"Domshlak Helmert, Malte Helmert, Carmel Domshlak","year":"2009","venue":"Proc. Int. Conf. on Automated Planning and Scheduling","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Helmert et al., 2007] Malte Helmert, Patrik Haslum, and Jörg Hoffmann. Flexible abstraction heuristics for opti- mal sequential planning. In Proc. Int. Conf. on Automated Planning and Scheduling, pages 176-183, 2007.","title":"Flexible abstraction heuristics for optimal sequential planning","authors":"Malte Helmert, Patrik Haslum, Jörg Hoffmann","year":"2007","venue":"Proc. Int. Conf. on Automated Planning and Scheduling","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Jimenez et al., 2006] Sergio Jimenez, Andrew Coles, and Amanda Smith. Planning in probabilistic domains using a deterministic numeric planner. In Proc. Workshop of the UK Planning and Scheduling Special Interest Group, 2006. Kolobov et al., 2011]","title":"Planning in probabilistic domains using a deterministic numeric planner","authors":"Sergio Jimenez, Andrew Coles, Amanda Smith","year":"2006","venue":"Proc. Workshop of the UK Planning and Scheduling Special Interest Group","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"Andrey Kolobov, Mausam, Daniel S. Weld, and Hector Geffner. Heuristic search for general- ized stochastic shortest path mdps. In Proc. Int. Conf. on Automated Planning and Scheduling, 2011.","title":"Heuristic search for generalized stochastic shortest path mdps","authors":"Andrey Kolobov, Daniel S Mausam, Hector Weld, Geffner","year":"2011","venue":"Proc. Int. Conf. on Automated Planning and Scheduling","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Kolobov et al., 2012] Andrey Kolobov, Mausam, and Daniel S. Weld. A theory of goal-oriented mdps with dead ends. In Proc. Conf. on Uncertainty in Artificial Intelligence (UAI), 2012.","title":"A theory of goal-oriented mdps with dead ends","authors":"Andrey Kolobov, Daniel S Mausam, Weld","year":"2012","venue":"Proc. Conf. on Uncertainty in Artificial Intelligence (UAI)","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Little and Thiébaux, 2006] Iain Little and Sylvie Thiébaux. Concurrent probabilistic planning in the graphplan frame- work. In Proc. Int. Conf. on Automated Planning and Scheduling, 2006.","title":"Concurrent probabilistic planning in the graphplan framework","authors":"Iain Little, Sylvie Thiébaux","year":"2006","venue":"Proc. Int. Conf. on Automated Planning and Scheduling","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Pommerening et al., 2014] Florian Pommerening, Gabriele Röger, Malte Helmert, and Blai Bonet. Lp-based heuris- tics for cost-optimal planning. In Proc. Int. Conf. on Auto- mated Planning and Scheduling, 2014.","title":"Lp-based heuristics for cost-optimal planning","authors":"Florian Pommerening, Gabriele Röger, Malte Helmert, Blai Bonet","year":"2014","venue":"Proc. Int. Conf. on Automated Planning and Scheduling","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Pommerening et al., 2015] Florian Pommerening, Malte Helmert, Gabriele Röger, and Jendrik Seipp. From non- negative to general operator cost partitioning. In Proc. of National Conference on Artificial Intelligence (AAAI), pages 3335-3341, 2015.","title":"From nonnegative to general operator cost partitioning","authors":"Florian Pommerening, Malte Helmert, Gabriele Röger, Jendrik Seipp","year":"2015","venue":"Proc. of National Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Steinmetz et al., 2016] Marcel Steinmetz, Joerg Hoffmann, and Olivier Buffet. Revisiting goal probability analysis in probabilistic planning. In Proc. Int. Conf. on Automated Planning and Scheduling, 2016.","title":"Revisiting goal probability analysis in probabilistic planning","authors":"Steinmetz","year":"2016","venue":"Proc. Int. Conf. on Automated Planning and Scheduling","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Trevizan et al., 2016] Felipe W. Trevizan, Sylvie Thiébaux, Pedro Henrique Santana, and Brian C. Williams. Heuris- tic search in dual space for constrained stochastic shortest path problems. In Proc. Int. Conf. on Automated Planning and Scheduling, 2016.","title":"Heuristic search in dual space for constrained stochastic shortest path problems","authors":"Felipe W Trevizan, Sylvie Thiébaux, Pedro Henrique Santana, Brian C Williams","year":"2016","venue":"Proc. Int. Conf. on Automated Planning and Scheduling","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Trevizan et al., 2017a] Felipe W. Trevizan, Florent Teichteil-Kœnigsbuch, and Sylvie Thiébaux. Effi- cient solutions for stochastic shortest path problems with dead ends. In Proc. 33rd Conf. on Uncertainty in Artificial Intelligence (UAI), 2017.","title":"Efficient solutions for stochastic shortest path problems with dead ends","authors":"Trevizan","year":"2017","venue":"Proc. 33rd Conf. on Uncertainty in Artificial Intelligence (UAI)","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Trevizan et al., 2017b] Felipe W. Trevizan, Sylvie Thiébaux, and Patrik Haslum. Occupation measure heuristics for probabilistic planning. In Proc. Int. Conf. on Automated Planning and Scheduling, 2017.","title":"Occupation measure heuristics for probabilistic planning","authors":"Trevizan","year":"2017","venue":"Proc. Int. Conf. on Automated Planning and Scheduling","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[van den Briel et al., 2007] Menkes van den Briel, J. Ben- ton, Subbarao Kambhampati, and Thomas Vossen. An lp- based heuristic for optimal planning. In Int. Conf. on Prin- ciples and Practice of Constraint Programming, 2007.","title":"An lpbased heuristic for optimal planning","authors":"Van Den Briel","year":"2007","venue":"Int. Conf. on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}