{"type":"ScholarlyArticle","title":"Theoretical Study on Multi-objective Heuristic Search","authors":[{"name":"Shawn Skyler","slug":"shawn-skyler","given":"Shawn","family":"Skyler","affiliation":"Ben-Gurion University of the Negev"},{"name":"Shahaf Shperberg","slug":"shahaf-shperberg","given":"Shahaf","family":"Shperberg","affiliation":"Ben-Gurion University of the Negev"},{"name":"Dor Atzmon","slug":"dor-atzmon","given":"Dor","family":"Atzmon","affiliation":"Bar-Ilan University"},{"name":"Ariel Felner","slug":"ariel-felner","given":"Ariel","family":"Felner","affiliation":"Ben-Gurion University of the Negev"},{"name":"Oren Salzman","slug":"oren-salzman","given":"Oren","family":"Salzman","affiliation":"Technion -Israel Institute of Technology"},{"name":"Shao-Hung Chan","slug":"shao-hung-chan","given":"Shao-Hung","family":"Chan","affiliation":"University of Southern California"},{"name":"Han Zhang","slug":"han-zhang","given":"Han","family":"Zhang","affiliation":"University of Southern California"},{"name":"Sven Koenig","slug":"sven-koenig","given":"Sven","family":"Koenig","affiliation":"University of Southern California"},{"name":"William Yeoh","slug":"william-yeoh","given":"William","family":"Yeoh","affiliation":"Washington University in St. Louis"},{"name":"Carlos Hernandez Ulloa","slug":"carlos-hernandez-ulloa","given":"Carlos","family":"Hernandez Ulloa","affiliation":"Universidad San Sebastián"}],"abstract":"This paper provides a theoretical study on Multi-Objective Heuristic Search. We first classify states in the state space into must-expand, maybe-expand, and never-expand states and then transfer these definitions to nodes in the search tree. We then formalize a framework that generalizes A* to Multi-Objective Search. We study different ways to order nodes under this framework and their relation to traditional tie-breaking policies and provide theoretical findings. Finally, we study and empirically compare different ordering functions.","doi":"10.24963/ijcai.2024/776","url":"https://ijcai.org/proceedings/2024/776","pdf":"https://ijcai.org/proceedings/2024/0776.pdf","markdown":"https://ijcai.org/proceedings/2024/776.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/776","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Search","track":"Main Track","number":776,"pages":{"first":7021,"last":7028},"keywords":["Search: S: Heuristic search","Search: S: Other","Search: General"],"videos":[],"references":[{"position":1,"raw":"[Ahmadi et al., 2021] Saman Ahmadi, Guido Tack, Daniel Harabor, and Philip Kilby. Bi-Objective Search with Bi- Directional A * . In Petra Mutzel, Rasmus Pagh, and Grze- gorz Herman, editors, 29th Annual European Symposium on Algorithms, volume 204 of LIPIcs, pages 3:1-3:15, 2021.","title":"Bi-Objective Search with Bi-Directional A","authors":"Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby","year":"2021","venue":"29th Annual European Symposium on Algorithms","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bachmann et al., 2018] Daniel Bachmann, Fritz Bökler, Jakob Kopec, Kira Popp, Björn Schwarze, and Frank We- ichert. Multi-Objective Optimisation Based Planning of Power-Line Grid Expansions. ISPRS International Jour- nal of Geo-Information, 7(7):258, 2018.","title":"Multi-Objective Optimisation Based Planning of Power-Line Grid Expansions","authors":"Daniel Bachmann, Fritz Bökler, Jakob Kopec, Kira Popp, Björn Schwarze, Frank Weichert","year":"2018","venue":"ISPRS International Journal of Geo-Information","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Clímaco and Pascoal, 2012] J. Clímaco and M. Pascoal. Multicriteria Path and Tree Problems: Discussion on Ex- act Algorithms and Applications. ITOR, 19(1-2):63-98, 2012.","title":"Multicriteria Path and Tree Problems: Discussion on Exact Algorithms and Applications","authors":"J Clímaco, M","year":"2012","venue":"ITOR","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"J. Current and M. Marsh. Mul- tiobjective Transportation Network Design and Routing Problems: Taxonomy and Annotation. EJOR, 65(1):4-19, 1993.","title":"Multiobjective Transportation Network Design and Routing Problems: Taxonomy and Annotation","authors":"J Current, M Marsh","year":"1993","venue":"EJOR","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Dechter and Pearl, 1985] Rina Dechter and Judea Pearl. Generalized Best-First Search Strategies and the Optimal- ity of A * . J. ACM, 32(3):505-536, 1985.","title":"Generalized Best-First Search Strategies and the Optimality of A","authors":"Rina Dechter, Judea Pearl","year":"1985","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[DIMACS, 2006] DIMACS. The 9th DIMACS Implementa- tion Challenge: Shortest Path, 2006.","title":"DIMACS. The 9th DIMACS Implementation Challenge: Shortest Path","authors":"Dimacs","year":"2006","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Eckerle et al., 2017] Jürgen Eckerle, Jingwei Chen, Nathan R. Sturtevant, Sandra Zilles, and Robert C. Holte. Sufficient Conditions for Node Expansion in Bidirectional Heuristic Search. In ICAPS, pages 79-87, 2017.","title":"Sufficient Conditions for Node Expansion in Bidirectional Heuristic Search","authors":"Jürgen Eckerle, Jingwei Chen, Nathan R Sturtevant, Sandra Zilles, Robert C Holte","year":"2017","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Fu et al., 2019] Mengyu Fu, Alan Kuntz, Oren Salzman, and Ron Alterovitz. Toward Asymptotically-Optimal Inspection Planning Via Efficient Near-Optimal Graph Search. In Robotics: Science and Systems, 2019.","title":"Toward Asymptotically-Optimal Inspection Planning Via Efficient Near-Optimal Graph Search","authors":"Fu","year":"2019","venue":"Robotics: Science and Systems","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Fu et al., 2021] Mengyu Fu, Oren Salzman, and Ron Al- terovitz. Computationally-Efficient Roadmap-based In- spection Planning via Incremental Lazy Search. In ICRA, pages 7449-7456, 2021.","title":"Computationally-Efficient Roadmap-based Inspection Planning via Incremental Lazy Search","authors":"Fu","year":"2021","venue":"ICRA","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Goldin and Salzman, 2021] Boris Goldin and Oren Salz- man. Approximate Bi-Criteria Search by Efficient Rep- resentation of Subsets of the Pareto-Optimal Frontier. In ICAPS, pages 149-158, 2021.","title":"Approximate Bi-Criteria Search by Efficient Representation of Subsets of the Pareto-Optimal Frontier","authors":"Salzman Goldin, Boris Goldin, Oren Salzman","year":"2021","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Hart et al., 1968] Peter E Hart, Nils J Nilsson, and Bertram Raphael. A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics, 4(2):100-107, 1968.","title":"A Formal Basis for the Heuristic Determination of Minimum Cost Paths","authors":"Nils J Peter E Hart, Bertram Nilsson, Raphael","year":"1968","venue":"IEEE Transactions on Systems Science and Cybernetics","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Hernández et al., 2023a] Carlos Hernández, William Yeoh, Jorge Baier, Ariel Felner, Oren Salzman, Han Zhang, Shao-Hung Chan, and Sven Koenig. Multi-objective search via lazy and efficient dominance checks. In IJCAI, 2023.","title":"Multi-objective search via lazy and efficient dominance checks","authors":"Hernández","year":"2023","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2023/850"},{"position":13,"raw":"[Hernández et al., 2023b] Carlos Hernández, William Yeoh, Jorge A. Baier, Han Zhang, Luis Suazo, Sven Koenig, and Oren Salzman. Simple and efficient bi-objective search algorithms via fast dominance checks. Artif. Intell., 314:103807, 2023.","title":"Simple and efficient bi-objective search algorithms via fast dominance checks","authors":"Hernández","year":"2023","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Mandow and De La Cruz, 2005] Lawrence Mandow and José Luis Pérez De La Cruz. A New Approach to Multi- Objective A * Search. In IJCAI, pages 218-223, 2005.","title":"Lawrence Mandow and José Luis Pérez De La Cruz. A New Approach to Multi-Objective A * Search","authors":"De Mandow, Cruz La","year":"2005","venue":"IJCAI","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Mandow and Pérez-de-la-Cruz, 2010] Lawrence Mandow and José-Luis Pérez-de-la-Cruz. Multiobjective A * search with consistent heuristics. J. ACM, 57(5):27:1-27:25, 2010.","title":"Lawrence Mandow and José-Luis Pérez-de-la-Cruz. Multiobjective A * search with consistent heuristics","authors":"Pérez-De-La-Cruz Mandow","year":"2010","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Pulido et al., 2015] Francisco-Javier Pulido, Lawrence Mandow, and José-Luis Pérez-de-la Cruz. Dimensionality Reduction in Multiobjective Shortest Path Search. CAR, 64:60-70, 2015.","title":"Francisco-Javier Pulido, Lawrence Mandow, and José-Luis Pérez-de-la Cruz. Dimensionality Reduction in Multiobjective Shortest Path Search","authors":"Pulido","year":"2015","venue":"CAR","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Salzman et al., 2023] Oren Salzman, Ariel Felner, Carlos Hernández, Han Zhang, Shao-Hung Chan, and Sven Koenig. Heuristic-search approaches for the multi- objective shortest-path problem: Progress and research op- portunities. In IJCAI, pages 6759-6768, 2023.","title":"Heuristic-search approaches for the multiobjective shortest-path problem: Progress and research opportunities","authors":"Oren Salzman, Ariel Felner, Carlos Hernández, Han Zhang, Shao-Hung Chan, Sven Koenig","year":"2023","venue":"IJCAI","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Skriver, 2000] A. J.V. Skriver. A Classification of Bicrite- rion Shortest Path (BSP) Algorithms. Asia Pacific J. of Oper. Res., 17(2):199-212, 2000.","title":"A Classification of Bicriterion Shortest Path (BSP) Algorithms","authors":"A J V Skriver","year":"2000","venue":"Asia Pacific J. of Oper. Res","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Skyler et al., 2022] S. Skyler, D. Atzmon, A. Felner, O. Salzman, H. Zhang, S. Koenig, W. Yeoh, and C. Hernández. Bounded-Cost Bi-Objective Heuristic Search. In SoCS22, pages 239-243, 2022.","title":"Bounded-Cost Bi-Objective Heuristic Search","authors":"S Skyler, D Atzmon, A Felner, O Salzman, H Zhang, S Koenig, W Yeoh, C Hernández","year":"2022","venue":"SoCS","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Stewart and White III, 1991] Bradley S Stewart and Chelsea C White III. Multiobjective A * . Journal of the ACM, 38(4):775-814, 1991.","title":"Multiobjective A *","authors":"S Bradley, Chelsea C Stewart, Iii White","year":"1991","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Tarapata, 2007] Z. M. Tarapata. Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Mod- els and Adaptation of Standard Algorithms. IJAM, 17(2), 2007.","title":"Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms","authors":"Z M Tarapata","year":"2007","venue":"IJAM","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Ulungu and Teghem, 1991] EL Ulungu and J Teghem. Multi-Objective Shortest Path Problem: A Survey. In Workshop on Multicriteria Decision Making, pages 176- 188, 1991.","title":"EL Ulungu and J Teghem. Multi-Objective Shortest Path Problem: A Survey","authors":"Teghem Ulungu","year":"1991","venue":"Workshop on Multicriteria Decision Making","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}