{"type":"ScholarlyArticle","title":"Domain-Dependent and Domain-Independent Problem Solving Techniques","authors":[{"name":"Roni Stern","slug":"roni-stern","given":"Roni","family":"Stern","affiliation":"University of the Negev"}],"abstract":"Heuristic search is a general problem-solving method. Some heuristic search algorithms, like the well-known A* algorithm, are domain-independent, in the sense that their knowledge of the problem at-hand is limited to the (1) initial state, (2) state transition operators and their costs, (3) goal-test function, \r\nand (4) black-box heuristic function that estimates the value of a state. \r\nProminent examples are A* and Weighted A*.  \r\nOther heuristic search algorithms are domain-dependent, that is, customized to solve problems from a specific domain. \r\nA well-known example is conflict-directed A*, which is specifically designed to solve model-based diagnosis problems. \r\nIn this paper, we review our recent advancements in both domain-independent and domain-dependent heuristic search, and outline several challenging open questions.","doi":"10.24963/ijcai.2019/898","url":"https://ijcai.org/proceedings/2019/898","pdf":"https://ijcai.org/proceedings/2019/0898.pdf","markdown":"https://ijcai.org/proceedings/2019/898.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/898","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Early Career","track":"Early Career","number":898,"pages":{"first":6411,"last":6415},"keywords":["Constraints and SAT: Modeling;Formulation","Heuristic Search and Game Playing: Heuristic Search"],"videos":[],"references":[{"position":1,"raw":"[Aine et al., 2007] Sandip Aine, PP Chakrabarti, and Rajeev Ku- mar. AWA*-a wind constrained anytime heuristic search algo- rithm. In IJCAI, 2007.","title":"AWA*-a wind constrained anytime heuristic search algorithm","authors":"Sandip Aine, Rajeev Chakrabarti, Kumar","year":"2007","venue":"IJCAI","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bonet and Geffner, 2001] Blai Bonet and Héctor Geffner. Plan- ning as heuristic search. Artificial Intelligence, 129(1-2), 2001.","title":"Planning as heuristic search","authors":"Geffner Bonet, Blai Bonet, Héctor Geffner","year":"2001","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[De Kleer and Williams, 1987] Johan De Kleer and Brian C Williams. Diagnosing multiple faults. Artificial intelligence, 32(1):97-130, 1987.","title":"Diagnosing multiple faults","authors":"De Kleer, ; ] Williams, De Johan, Brian C Kleer, Williams","year":"1987","venue":"Artificial intelligence","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Dechter and Pearl, 1985] Rina Dechter and Judea Pearl. General- ized best-first search strategies and the optimality of A * . Journal of the ACM (JACM), 32(3):505-536, 1985.","title":"Generalized best-first search strategies and the optimality of A","authors":"Rina Dechter, Judea Pearl","year":"1985","venue":"Journal of the ACM (JACM)","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Doran and Michie, 1966] James E Doran and Donald Michie. Ex- periments with the graph traverser program. Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 294(1437):235-259, 1966.","title":"Experiments with the graph traverser program","authors":"E James, Donald Doran, Michie","year":"1437","venue":"Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Ebendt and Drechsler, 2009] Rüdiger Ebendt and Rolf Drechsler. Weighted A* search -unifying view and application. Artif. Intell., 173(14):1310-1342, 2009.","title":"Weighted A* search -unifying view and application","authors":"Rüdiger Ebendt, Rolf Drechsler","year":"2009","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Felner et al., 2017] Ariel Felner, Roni Stern, Solomon Eyal Shi- mony, Eli Boyarski, Meir Goldenberg, Guni Sharon, Nathan R. Sturtevant, Glenn Wagner, and Pavel Surynek. Search-based op- timal solvers for the multi-agent pathfinding problem: Summary and challenges. In the International Symposium on Combinato- rial Search (SoCS), pages 29-37, 2017.","title":"Search-based optimal solvers for the multi-agent pathfinding problem: Summary and challenges","authors":"Ariel Felner, Roni Stern, Solomon Eyal Shimony, Eli Boyarski, Meir Goldenberg, Guni Sharon, Nathan R Sturtevant, Glenn Wagner, Pavel Surynek","year":"2017","venue":"the International Symposium on Combinatorial Search (SoCS)","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Fikes and Nilsson, 1971] Richard E Fikes and Nils J Nilsson. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial intelligence, 2(3-4):189-208, 1971.","title":"STRIPS: A new approach to the application of theorem proving to problem solving","authors":"E Richard, Nils J Fikes, Nilsson","year":"1971","venue":"Artificial intelligence","doi":null,"url":null,"internal_url":"/proceedings/1971/63"},{"position":9,"raw":"[Furcy and Koenig, 2005] David Furcy and Sven Koenig. Limited discrepancy beam search. In IJCAI, pages 125-131, 2005.","title":"Limited discrepancy beam search","authors":"Koenig Furcy, David Furcy, Sven Koenig","year":"2005","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2005/50"},{"position":10,"raw":"[Gilon et al., 2016] D. Gilon, A. Felner, and R. Stern. Dynamic po- tential search -A new bounded suboptimal search. In Symposium on Combinatorial Search (SOCS), pages 36-44, 2016.","title":"Dynamic potential search -A new bounded suboptimal search","authors":"D Gilon, A Felner, R Stern","year":"2016","venue":"Symposium on Combinatorial Search (SOCS)","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Goldenberg et al., 2014] Meir Goldenberg, Ariel Felner, Roni Stern, Guni Sharon, Nathan Sturtevant, Robert C Holte, and Jonathan Schaeffer. Enhanced partial expansion A * . Journal of Artificial Intelligence Research, 50:141-187, 2014.","title":"Enhanced partial expansion A *","authors":"Meir Goldenberg, Ariel Felner, Roni Stern, Guni Sharon, Nathan Sturtevant, Robert C Holte, Jonathan Schaeffer","year":"2014","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Hansen and Zhou, 2007] Eric A Hansen and Rong Zhou. Any- time heuristic search. Journal of Artificial Intelligence Research, 28:267-297, 2007.","title":"Anytime heuristic search","authors":"Eric A Hansen, Rong Zhou","year":"2007","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Hart et al., 1968] Peter E. Hart, Nils J. Nilsson, and Bertram Raphael. A formal basis for the heuristic determination of min- imum cost paths. IEEE Transactions on Systems Science and Cybernetics, SSC-4(2):100-107, 1968.","title":"A formal basis for the heuristic determination of minimum cost paths","authors":"Peter E Hart, Nils J Nilsson, Bertram Raphael","year":"1968","venue":"IEEE Transactions on Systems Science and Cybernetics, SSC","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Hatem and Ruml, 2014] Matthew Hatem and Wheeler Ruml. Bounded suboptimal search in linear space: New results. In Sev- enth Annual Symposium on Combinatorial Search, 2014.","title":"Bounded suboptimal search in linear space: New results","authors":"Ruml Hatem, Matthew Hatem, Wheeler Ruml","year":"2014","venue":"Seventh Annual Symposium on Combinatorial Search","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Hatem et al., 2013] Matthew Hatem, Roni Stern, and Wheeler Ruml. Bounded suboptimal heuristic search in linear space. In Sixth Annual Symposium on Combinatorial Search, 2013.","title":"Bounded suboptimal heuristic search in linear space","authors":"Matthew Hatem, Roni Stern, Wheeler Ruml","year":"2013","venue":"Sixth Annual Symposium on Combinatorial Search","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Helmert et al., 2008] Malte Helmert, Gabriele Röger, et al. How good is almost perfect?. In AAAI, volume 8, 2008.","title":"How good is almost perfect?","authors":"Malte Helmert, Gabriele Röger","year":"2008","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Heusner et al., 2018] Manuel Heusner, Thomas Keller, and Malte Helmert. Best-case and worst-case behavior of greedy best-first search. In IJCAI, 2018.","title":"Best-case and worst-case behavior of greedy best-first search","authors":"Manuel Heusner, Thomas Keller, Malte Helmert","year":"2018","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2018/203"},{"position":18,"raw":"[Holland, 1992] John H Holland. Genetic algorithms. Scientific american, 267(1):66-73, 1992.","title":"Genetic algorithms","authors":"H John, Holland","year":"1992","venue":"Scientific american","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Holte and Zilles, 2019] Robert C Holte and Sandra Zilles. On the optimal efficiency of cost-algebraic A * . In AAAI, 2019.","title":"On the optimal efficiency of cost-algebraic A","authors":"C Robert, Sandra Holte, Zilles","year":"2019","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Korf, 1985] Richard E Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial intelligence, 27(1):97- 109, 1985.","title":"Depth-first iterative-deepening: An optimal admissible tree search","authors":"Richard E Korf","year":"1985","venue":"Artificial intelligence","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Korf, 1992] Richard E. Korf. Linear-space best-first search: Sum- mary of results. In Proceedings of the tenth national conference on Artificial intelligence, AAAI, pages 533-538, 1992.","title":"Linear-space best-first search: Summary of results","authors":"Richard E Korf","year":"1992","venue":"Proceedings of the tenth national conference on Artificial intelligence, AAAI","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Likhachev et al., 2004] Maxim Likhachev, Geoffrey J. Gordon, and Sebastian Thrun. ARA*: Anytime A* with provable bounds on sub-optimality. In NIPS, 2004.","title":"ARA*: Anytime A* with provable bounds on sub-optimality","authors":"Likhachev","year":"2004","venue":"NIPS","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[López et al., 2013] Carlos Linares López, Roni Stern, and Ariel Felner. Target-value search revisited. In IJCAI, 2013.","title":"Target-value search revisited","authors":"Carlos Linares López, Roni Stern, Ariel Felner","year":"2013","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2013/96"},{"position":24,"raw":"[Ma et al., 2017] H. Ma, J. Yang, L. Cohen, T. K. S. Kumar, and S. Koenig. Feasibility study: Moving non-homogeneous teams in congested video game environments. In AIIDE, 2017.","title":"Feasibility study: Moving non-homogeneous teams in congested video game environments","authors":"H Ma, J Yang, L Cohen, T K S Kumar, S Koenig","year":"2017","venue":"AIIDE","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Morris et al., 2016] R. Morris, C. S. Pasareanu, K. S. Luckow, W. Malik, H. Ma, TK S. Kumar, and S. Koenig. Planning, scheduling and monitoring for airport surface operations. In AAAI Workshop, 2016.","title":"Planning, scheduling and monitoring for airport surface operations","authors":"R Morris, C S Pasareanu, K S Luckow, W Malik, H Ma, Tk S Kumar, S Koenig","year":"2016","venue":"AAAI Workshop","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Newell et al., 1959] Allen Newell, John C Shaw, and Herbert A Simon. Report on a general problem solving program. In Inter- national Conference on Information Processing, 1959.","title":"Report on a general problem solving program","authors":"Allen Newell, John C Shaw, Herbert A Simon","year":"1959","venue":"International Conference on Information Processing","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Palombo et al., 2015] Alon Palombo, Roni Stern, Rami Puzis, Ariel Felner, Scott Kiesel, and Wheeler Ruml. Solving the snake in the box problem with heuristic search: First results. In Sympo- sium on Combinatorial Search (SoCS), 2015.","title":"Solving the snake in the box problem with heuristic search: First results","authors":"Alon Palombo, Roni Stern, Rami Puzis, Ariel Felner, Scott Kiesel, Wheeler Ruml","year":"2015","venue":"Symposium on Combinatorial Search","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Pearl and Kim, 1982] Judea Pearl and Jin H. Kim. Studies in semi- admissible heuristics. IEEE Trans. Pattern Anal. Mach. Intell., 4(4):392-399, 1982.","title":"Judea Pearl and Jin H. Kim. Studies in semiadmissible heuristics","authors":"Kim Pearl","year":"1982","venue":"IEEE Trans. Pattern Anal. Mach. Intell","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Pohl, 1970] Ira Pohl. Heuristic search viewed as path finding in a graph. Artificial Intelligence, 1(3-4), 1970.","title":"Heuristic search viewed as path finding in a graph","authors":"Ira Pohl","year":"1970","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Reiter, 1987] Raymond Reiter. A theory of diagnosis from first principles. Artificial intelligence, 32(1):57-95, 1987.","title":"A theory of diagnosis from first principles","authors":"Raymond Reiter","year":"1987","venue":"Artificial intelligence","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Richter et al., 2010] Silvia Richter, Jordan Tyler Thayer, and Wheeler Ruml. The joy of forgetting: Faster anytime search via restarting. In ICAPS, pages 137-144, 2010.","title":"The joy of forgetting: Faster anytime search via restarting","authors":"Richter","year":"2010","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Sabuncuoglu and Bayiz, 1999] Ihsan Sabuncuoglu and M Bayiz. Job shop scheduling with beam search. European Journal of Op- erational Research, 118(2):390-412, 1999.","title":"Job shop scheduling with beam search","authors":"Ihsan Sabuncuoglu, M Bayiz","year":"1999","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Sharon et al., 2013] G. Sharon, R. Stern, M. Goldenberg, and A. Felner. The increasing cost tree search for optimal multi-agent pathfinding. Artificial Intelligence, 2013.","title":"The increasing cost tree search for optimal multi-agent pathfinding","authors":"G Sharon, R Stern, M Goldenberg, A Felner","year":"2013","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Stern et al., 2011] Roni Stern, Rami Puzis, and Ariel Felner. Po- tential search: a bounded-cost search algorithm. In ICAPS, 2011.","title":"Potential search: a bounded-cost search algorithm","authors":"Roni Stern, Rami Puzis, Ariel Felner","year":"2011","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Stern et al., 2012] Roni Stern, Meir Kalech, Alexander Feldman, and Gregory Provan. Exploring the duality in conflict-directed model-based diagnosis. In AAAI, 2012.","title":"Exploring the duality in conflict-directed model-based diagnosis","authors":"Roni Stern, Meir Kalech, Alexander Feldman, Gregory Provan","year":"2012","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Stern et al., 2014] Roni Stern, Ariel Felner, Jur van den Berg, Rami Puzis, Rajat Shah, and Ken Goldberg. Potential-based bounded-cost search and anytime non-parametric A * . Artificial Intelligence, 214:1-25, 2014.","title":"Potential-based bounded-cost search and anytime non-parametric A","authors":"Roni Stern, Ariel Felner, Jur Van Den, Rami Berg, Rajat Puzis, Ken Shah, Goldberg","year":"2014","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Stern et al., 2019] Roni Stern, Gal Dreiman, and Richard Valen- zano. Probably bounded suboptimal heuristic search. Artificial Intelligence, 267:39-57, 2019.","title":"Probably bounded suboptimal heuristic search","authors":"Roni Stern, Gal Dreiman, Richard Valenzano","year":"2019","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Surynek, 2010] Pavel Surynek. An optimization variant of multi- robot path planning is intractable. In AAAI, 2010.","title":"Pavel Surynek. An optimization variant of multirobot path planning is intractable","authors":"Surynek","year":"2010","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Thayer and Ruml, 2011] Jordan Tyler Thayer and Wheeler Ruml. Bounded suboptimal search: A direct approach using inadmissi- ble estimates. In IJCAI, 2011.","title":"Bounded suboptimal search: A direct approach using inadmissible estimates","authors":"Ruml ; Thayer, Tyler Jordan, Wheeler Thayer, Ruml","year":"2011","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2011/119"},{"position":40,"raw":"[Thayer et al., 2012] Jordan Tyler Thayer, Roni Stern, Ariel Felner, and Wheeler Ruml. Faster bounded-cost search using inadmissi- ble estimates. In ICAPS, 2012.","title":"Faster bounded-cost search using inadmissible estimates","authors":"Thayer","year":"2012","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Valenzano et al., 2013] Richard Anthony Valenzano, Shahab Jab- bari Arfaee, Jordan Tyler Thayer, Roni Stern, and Nathan R Sturtevant. Using alternative suboptimality bounds in heuristic search. In ICAPS, 2013.","title":"Using alternative suboptimality bounds in heuristic search","authors":"Richard Anthony Valenzano, Shahab Jabbari Arfaee, Jordan Tyler Thayer, Roni Stern, Nathan R Sturtevant","year":"2013","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Van Den Berg et al., 2011] Jur Van Den Berg, Rajat Shah, Arthur Huang, and Ken Goldberg. Anytime nonparametric A * . In AAAI, 2011.","title":"Anytime nonparametric A *","authors":"Van Den, Berg","year":"2011","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Veloso et al., 2015] M. Veloso, J. Biswas, B. Coltin, and S. Rosen- thal. Cobots: Robust symbiotic autonomous mobile service robots. In IJCAI, page 4423, 2015.","title":"Cobots: Robust symbiotic autonomous mobile service robots","authors":"M Veloso, J Biswas, B Coltin, S Rosenthal","year":"2015","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2015/656"},{"position":44,"raw":"[Williams and Ragno, 2007] Brian C Williams and Robert J Ragno. Conflict-directed A * and its role in model-based embedded sys- tems. Discrete Applied Mathematics, 155(12):1562-1595, 2007.","title":"Conflict-directed A * and its role in model-based embedded systems","authors":"C Brian, Robert J Williams, Ragno","year":"2007","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":45,"raw":"[Wilt and Ruml, 2016] Christopher Wilt and Wheeler Ruml. Effec- tive heuristics for suboptimal best-first search. Journal of Artifi- cial Intelligence Research, 57:273-306, 2016.","title":"Christopher Wilt and Wheeler Ruml. Effective heuristics for suboptimal best-first search","authors":"Ruml Wilt","year":"2016","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":46,"raw":"[Wurman et al., 2008] P. R. Wurman, R. D'Andrea, and M. Mountz. Coordinating hundreds of cooperative, autonomous vehicles in warehouses. AI magazine, 2008.","title":"Coordinating hundreds of cooperative, autonomous vehicles in warehouses","authors":"P R Wurman, R D'andrea, M Mountz","year":"2008","venue":"AI magazine","doi":null,"url":null,"internal_url":null},{"position":47,"raw":"[Yu and LaValle, 2013] Jingjin Yu and Steven M. LaValle. Struc- ture and intractability of optimal multi-robot path planning on graphs. In AAAI, 2013.","title":"Structure and intractability of optimal multi-robot path planning on graphs","authors":"Lavalle ; Yu, Jingjin Yu, Steven M Lavalle","year":"2013","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":48,"raw":"[Zhou and Hansen, 2005] Rong Zhou and Eric A Hansen. Beam- stack search: Integrating backtracking with beam search. In ICAPS, pages 90-98, 2005.","title":"Beamstack search: Integrating backtracking with beam search","authors":"Rong Zhou, Eric A Hansen","year":"2005","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":49,"raw":"[Zilberstein, 1996] Shlomo Zilberstein. Using anytime algorithms in intelligent systems. AI magazine, 17(3):73-73, 1996.","title":"Shlomo Zilberstein. Using anytime algorithms in intelligent systems","authors":"Zilberstein","year":"1996","venue":"AI magazine","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}