{"type":"ScholarlyArticle","title":"Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research Opportunities","authors":[{"name":"Oren Salzman","slug":"oren-salzman","given":"Oren","family":"Salzman","affiliation":"Technion-Israel Institute of Technology"},{"name":"Ariel Felner","slug":"ariel-felner","given":"Ariel","family":"Felner","affiliation":"Ben-Gurion University of the Negev"},{"name":"Carlos Hernández","slug":"carlos-hernandez","given":"Carlos","family":"Hernandez","affiliation":"Facultad de Ingeniería , Arquitectura y Diseño , Universidad San Sebastián , Santiago , Chile"},{"name":"Han Zhang","slug":"han-zhang","given":"Han","family":"Zhang","affiliation":"University of Southern California"},{"name":"Shao-Hung Chan","slug":"shao-hung-chan","given":"Shao-Hung","family":"Chan","affiliation":"University of Southern California"},{"name":"Sven Koenig","slug":"sven-koenig","given":"Sven","family":"Koenig","affiliation":"University of Southern California"}],"abstract":"In the multi-objective shortest-path problem we are interested in computing a path, or a set of paths that simultaneously balance multiple cost functions. This problem is important for a diverse range of applications such as transporting hazardous materials considering travel distance and risk. This family of problems is not new with results dating back to the 1970's. Nevertheless, the significant progress made in the field of heuristic search  resulted in a new and growing interest in the sub-field of multi-objective search. Consequently, in this paper we review the fundamental problems and techniques common to most algorithms and provide a general overview of the field. We then continue to describe recent work  with an emphasis on new challenges that emerged and the resulting research opportunities.","doi":"10.24963/ijcai.2023/757","url":"https://ijcai.org/proceedings/2023/757","pdf":"https://ijcai.org/proceedings/2023/0757.pdf","markdown":"https://ijcai.org/proceedings/2023/757.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/757","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Survey Track","track":"Survey Track","number":757,"pages":{"first":6759,"last":6768},"keywords":["Survey: Search"],"videos":[],"references":[{"position":1,"raw":"[Ahmadi et al., 2021] S. Ahmadi, G. Tack, D. Harabor, and P. Kilby. Bi-objective search with bi-directional A*. In ESA, volume 204, pages 3:1-3:15, 2021.","title":"Bi-objective search with bi-directional A","authors":"S Ahmadi, G Tack, D Harabor, P Kilby","year":"2021","venue":"ESA","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Altwaijry and Menai, 2012] Najwa Altwaijry and Mo- hamed El-bachir Menai. Data structures in multi-objective evolutionary algorithms. J. Comput. Sci. Technol., 27(6):1197-1210, 2012.","title":"Najwa Altwaijry and Mohamed El-bachir Menai. Data structures in multi-objective evolutionary algorithms","authors":"Menai Altwaijry","year":"2012","venue":"J. Comput. Sci. Technol","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bachmann et al., 2018] D. Bachmann, F. Bökler, J. Kopec, K. Popp, B. Schwarze, and F. Weichert. Multi-objective optimisation based planning of power-line grid expan- sions. ISPRS I. J. of Geo-Inf., 7(7):258, 2018.","title":"Multi-objective optimisation based planning of power-line grid expansions","authors":"D Bachmann, F Bökler, J Kopec, K Popp, B Schwarze, F Weichert","year":"2018","venue":"ISPRS I. J. of Geo-Inf","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Breugem et al., 2017] T. Breugem, T. Dollevoet, and W. van den Heuvel. Analysis of FPTASes for the multi- objective shortest path problem. Comput. Oper. Res., 78:44-58, 2017.","title":"Analysis of FPTASes for the multiobjective shortest path problem","authors":"T Breugem, T Dollevoet, W Van Den, Heuvel","year":"2017","venue":"Comput. Oper. Res","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bronfman et al., 2015] A. Bronfman, V. Marianov, G. Paredes-Belmar, and A. Lüer-Villagra. The max- imin HAZMAT routing problem. Eur. J. Oper. Res., 241(1):15-27, 2015.","title":"The maximin HAZMAT routing problem","authors":"A Bronfman, V Marianov, G Paredes-Belmar, A Lüer-Villagra","year":"2015","venue":"Eur. J. Oper. Res","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Brumbaugh-Smith and Shier, 1989] J. Brumbaugh-Smith and D. Shier. An empirical investigation of some bi- criterion shortest path algorithms. Eur. J. Oper. Res., 43(2):216-224, 1989.","title":"An empirical investigation of some bicriterion shortest path algorithms","authors":"Brumbaugh-Smith Shier, ; ] J Brumbaugh-Smith, D Shier","year":"1989","venue":"Eur. J. Oper. Res","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Clímaco and Pascoal, 2012] J. Clímaco and M. Pascoal. Multicriteria path and tree problems: discussion on exact algorithms and applications. Int. Trans. Oper. Res., 19(1- 2):63-98, 2012.","title":"Multicriteria path and tree problems: discussion on exact algorithms and applications","authors":"Pascoal Clímaco, J Clímaco, M","year":"2012","venue":"Int. Trans. Oper. Res","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Coego et al., 2009] J. Coego, L. Mandow, and J. L. P. de la Cruz. A new approach to iterative deepening multiobjec- tive A*. In AI*IA, pages 264-273, 2009.","title":"A new approach to iterative deepening multiobjective A","authors":"J Coego, L Mandow, J L P De La, Cruz","year":"2009","venue":"AI*IA","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Coego et al., 2013] J. Coego, L. Mandow, and J. L. P. de la Cruz. A comparison of multiobjective depth-first algo- rithms. J. Intell. Manuf., 24:821-829, 2013.","title":"A comparison of multiobjective depth-first algorithms","authors":"J Coego, L Mandow, J L P De La, Cruz","year":"2013","venue":"J. Intell. Manuf","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"J. Current and M. Marsh. Multi- objective transportation network design and routing prob- lems: Taxonomy and annotation. Eur. J. Oper. Res., 65(1):4-19, 1993.","title":"Multiobjective transportation network design and routing problems: Taxonomy and annotation","authors":"J Current, M Marsh","year":"1993","venue":"Eur. J. Oper. Res","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[de las Casas et al., 2021a] P. Maristany de las Casas, R. Borndörfer, L. Kraus, and A. Sedeño-Noda. An FP- TAS for dynamic multiobjective shortest path problems. Algorithms, 14(2):43, 2021.","title":"An FP-TAS for dynamic multiobjective shortest path problems","authors":"Casas De Las","year":"2021","venue":"Algorithms","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[de las Casas et al., 2021b] P. Maristany de las Casas, L. Kraus, A. Sedeño-Noda, and R. Borndörfer. Targeted multiobjective dijkstra algorithm. CoRR, abs/2110.10978, 2021.","title":"Targeted multiobjective dijkstra algorithm","authors":"Casas De Las","year":"2021","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[de las Casas et al., 2021c] P. Maristany de las Casas, A. Sedeño-Noda, and R. Borndörfer. An improved multiobjective shortest path algorithm. Comput. Oper. Res., 135:105424, 2021.","title":"An improved multiobjective shortest path algorithm","authors":"Casas De Las","year":"2021","venue":"Comput. Oper. Res","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Ehrgott, 2005] M. Ehrgott. Multicriteria Optimization (2nd ed.). Springer, 2005.","title":"Multicriteria Optimization","authors":"M Ehrgott","year":"2005","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Emmerich and Deutz, 2018] M. Emmerich and A. Deutz. A tutorial on multiobjective optimization: fundamentals and evolutionary methods. Natural computing, 17(3):585-609, 2018.","title":"A tutorial on multiobjective optimization: fundamentals and evolutionary methods","authors":"M Emmerich, A Deutz","year":"2018","venue":"Natural computing","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Enriqueand and Lawrence, 2011] M. Enriqueand and M. Lawrence. Multiobjective route planning with pre- calculated heuristics. In Portuguese Conf. on AI, pages 98-107, 2011.","title":"Multiobjective route planning with precalculated heuristics","authors":"M Enriqueand, M Lawrence","year":"2011","venue":"Portuguese Conf. on AI","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Erb et al., 2014] S. Erb, M. Kobitzsch, and P. Sanders. Par- allel bi-objective shortest paths using weight-balanced b- trees with bulk updates. In SEA, pages 111-122, 2014.","title":"Parallel bi-objective shortest paths using weight-balanced btrees with bulk updates","authors":"S Erb, M Kobitzsch, P Sanders","year":"2014","venue":"SEA","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Fieldsend, 2020] Jonathan E. Fieldsend. Data structures for non-dominated sets: implementations and empirical as- sessment of two decades of advances. In Genetic and Evo- lutionary Computation Conference, pages 489-497. ACM, 2020.","title":"Data structures for non-dominated sets: implementations and empirical assessment of two decades of advances","authors":"Jonathan E Fieldsend","year":"2020","venue":"Genetic and Evolutionary Computation Conference","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Fu et al., 2019] M. Fu, A. Kuntz, O. Salzman, and R. Al- terovitz. Toward asymptotically-optimal inspection plan- ning via efficient near-optimal graph search. In RSS, 2019.","title":"Toward asymptotically-optimal inspection planning via efficient near-optimal graph search","authors":"M Fu, A Kuntz, O Salzman, R Alterovitz","year":"2019","venue":"RSS","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Fu et al., 2021] M. Fu, O. Salzman, and R. Alterovitz. Computationally-efficient roadmap-based inspection plan- ning via incremental lazy search. In ICRA, pages 7449- 7456, 2021.","title":"Computationally-efficient roadmap-based inspection planning via incremental lazy search","authors":"M Fu, O Salzman, R Alterovitz","year":"2021","venue":"ICRA","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Geißer et al., 2022] F. Geißer, P. Haslum, S. Thiébaux, and F. Trevizan. Admissible heuristics for multi-objective planning. In ICAPS, pages 100-109, 2022.","title":"Admissible heuristics for multi-objective planning","authors":"F Geißer, P Haslum, S Thiébaux, F Trevizan","year":"2022","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Goldin and Salzman, 2021] B. Goldin and O. Salzman. Ap- proximate bi-criteria search by efficient representation 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":"B Goldin, O Salzman","year":"2021","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Guerriero and Musmanno, 2001] F Guerriero and R Mus- manno. Label correcting methods to solve multicriteria shortest path problems. J. Opt. Theory App., 111(3):589- 613, 2001.","title":"Label correcting methods to solve multicriteria shortest path problems","authors":"F Guerriero, Musmanno","year":"2001","venue":"J. Opt. Theory App","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Halffmann et al., 2022] P. Halffmann, L. Schäfer, K. Dächert, K. Klamroth, and S. Ruzika. Exact al- gorithms for multiobjective linear optimization problems with integer variables: A state of the art survey. Journal of Multi-Criteria Decision Analysis, 29(5-6):341-363, 2022.","title":"Exact algorithms for multiobjective linear optimization problems with integer variables: A state of the art survey","authors":"P Halffmann, L Schäfer, K Dächert, K Klamroth, S Ruzika","year":"2022","venue":"Journal of Multi-Criteria Decision Analysis","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Hansen, 1980] P. Hansen. Bicriterion path problems. In Multiple criteria decision making theory and application, pages 109-127. Springer, 1980.","title":"Bicriterion path problems","authors":"P Hansen","year":"1980","venue":"Multiple criteria decision making theory and application","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Hart et al., 1968] P. E. Hart, N. J. Nilsson, and B. 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":"P E Hart, N J Nilsson, B Raphael","year":"1968","venue":"IEEE Transactions on Systems Science and Cybernetics","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Haslum and Geffner, 2000] P. Haslum and H. Geffner. Ad- missible heuristics for optimal planning. In International Conference on Artificial Intelligence Planning Systems, pages 140-149, 2000.","title":"Admissible heuristics for optimal planning","authors":"P Haslum, H Geffner","year":"2000","venue":"International Conference on Artificial Intelligence Planning Systems","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Hayes and others, 2022] C. F Hayes et al. A practical guide to multi-objective reinforcement learning and planning. Auton. Agent. Multi Agent Syst., 36(1):1-59, 2022.","title":"A practical guide to multi-objective reinforcement learning and planning","authors":"C F Hayes","year":"2022","venue":"Auton. Agent. Multi Agent Syst","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Hernández et al., 2023a] C. Hernández, W. Yeoh, J. A. Baier, H. Zhang, L. Suazo, S. Koenig, and O. 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":30,"raw":"[Hernandez et al., 2023b] C. U. Hernandez, H. Zhang, O. Salzman, J. A. Baier, W. Yeo, A. Felner, S. Kumar, and S. Koenig. Multi-objective search via lazy and efficient dominance checks. In IJCAI, 2023.","title":"Multi-objective search via lazy and efficient dominance checks","authors":"Hernandez","year":"2023","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2023/850"},{"position":31,"raw":"[Hwang and Masud, 2012] C-L Hwang and A. S. Masud. Multiple objective decision making-methods and appli- cations: a state-of-the-art survey, volume 164. Springer Science & Business Media, 2012.","title":"Multiple objective decision making-methods and applications: a state-of-the-art survey","authors":"C-L Hwang, A S Masud","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Jaszkiewicz and Lust, 2018] Andrzej Jaszkiewicz and Thibaut Lust. ND-tree-based update: A fast algorithm for the dynamic nondominance problem. IEEE Trans. Evol. Comput., 22(5):778-791, 2018.","title":"Andrzej Jaszkiewicz and Thibaut Lust. ND-tree-based update: A fast algorithm for the dynamic nondominance problem","authors":"Lust Jaszkiewicz","year":"2018","venue":"IEEE Trans. Evol. Comput","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Koenig and Likhachev, 2002] S. Koenig and M. Likhachev. D*-lite. In AAAI, pages 476-483, 2002.","title":"D*-lite","authors":"S Koenig, M Likhachev","year":"2002","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Kothare et al., 2022] V. Kothare, Z. Ren, S. Rathinam, and H. Choset. Enhanced multi-objective A* with partial ex- pansion. arXiv:2212.03712, 2022.","title":"Enhanced multi-objective A* with partial expansion","authors":"V Kothare, Z Ren, S Rathinam, H Choset","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Legriel et al., 2010] J. Legriel, C. Le Guernic, S. Cotton, and O. Maler. Approximating the Pareto front of multi- criteria optimization problems. In Tools and Algorithms for the Construction and Analysis of Systems, pages 69- 83, 2010.","title":"Approximating the Pareto front of multicriteria optimization problems","authors":"J Legriel, C Le Guernic, S Cotton, O Maler","year":"2010","venue":"Tools and Algorithms for the Construction and Analysis of Systems","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Li et al., 2015] B. Li, J. Li, K. Tang, and X. Yao. Many- objective evolutionary algorithms: A survey. ACM Com- puting Surveys (CSUR), 48(1):1-35, 2015.","title":"Manyobjective evolutionary algorithms: A survey","authors":"B Li, J Li, K Tang, X Yao","year":"2015","venue":"ACM Computing Surveys (CSUR)","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Mandow and De La Cruz, 2005] L. Mandow and J. L. P. De La Cruz. A new approach to multiobjective A* search. In IJCAI, pages 218-223, 2005.","title":"A new approach to multiobjective A* search","authors":"L Mandow, J L P De, La Cruz","year":"2005","venue":"IJCAI","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Mandow and De La Cruz, 2010] L. Mandow and J. L. P. De La Cruz. Multiobjective A* search with consistent heuristics. J. ACM, 57(5):1-25, 2010.","title":"Multiobjective A* search with consistent heuristics","authors":"L Mandow, J L P De, La Cruz","year":"2010","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Martins, 1984] E. Q. V. Martins. On a special class of bi- criterion path problems. Eur. J. Oper. Res., 17(1):85-94, 1984.","title":"On a special class of bicriterion path problems","authors":"E Q V Martins","year":"1984","venue":"Eur. J. Oper. Res","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Medrano and Church, 2015] F. A. Medrano and R. L. Church. A parallel computing framework for finding the supported solutions to a biobjective network optimization problem. J. Multi-Criteria Decis. Anal., 22(5-6):244-259, 2015.","title":"A parallel computing framework for finding the supported solutions to a biobjective network optimization problem","authors":"F A Medrano, R L Church","year":"2015","venue":"J. Multi-Criteria Decis. Anal","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Miettinen, 2012] K. Miettinen. Nonlinear multiobjective optimization, volume 12. Springer Science & Business Media, 2012.","title":"Nonlinear multiobjective optimization","authors":"K Miettinen","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Mote et al., 1991] J. Mote, I. Murthy, and D. L Olson. A parametric approach to solving bicriterion shortest path problems. Eur. J. Oper. Res., 53(1):81-92, 1991.","title":"A parametric approach to solving bicriterion shortest path problems","authors":"J Mote, I Murthy, D L Olson","year":"1991","venue":"Eur. J. Oper. Res","doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Müller-Hannemann and Weihe, 2006] M. Müller- Hannemann and K. Weihe. On the cardinality of the Pareto set in bicriteria shortest path problems. Ann. Oper. Res., 147(1):269-286, 2006.","title":"On the cardinality of the Pareto set in bicriteria shortest path problems","authors":"Müller-Hannemann, ; Weihe, M Müller-Hannemann, K Weihe","year":"2006","venue":"Ann. Oper. Res","doi":null,"url":null,"internal_url":null},{"position":44,"raw":"[Pangilinan and Janssens, 2007] J. M. Pangilinan and G. Janssens. Evolutionary algorithms for the multiobjec- tive shortest path problem. World Academy of Science, Engineering and Technology, 25:205-210, 2007.","title":"Evolutionary algorithms for the multiobjective shortest path problem","authors":"Janssens ; ] J M Pangilinan, G Pangilinan, Janssens","year":"2007","venue":"World Academy of Science, Engineering and Technology","doi":null,"url":null,"internal_url":null},{"position":45,"raw":"[Papadimitriou and Yannakakis, 2000] C. H Papadimitriou and M. Yannakakis. On the approximability of trade-offs and optimal access of web sources. In FoCS, pages 86-92, 2000.","title":"On the approximability of trade-offs and optimal access of web sources","authors":"C Papadimitriou, M Yannakakis","year":"2000","venue":"FoCS","doi":null,"url":null,"internal_url":null},{"position":46,"raw":"[Perny and Spanjaard, 2008] P. Perny and O. Spanjaard. Near admissible algorithms for multiobjective search. In ECAI, pages 490-494, 2008.","title":"Near admissible algorithms for multiobjective search","authors":"P Perny, O Spanjaard","year":"2008","venue":"ECAI","doi":null,"url":null,"internal_url":null},{"position":47,"raw":"[Pommerening et al., 2014] F. Pommerening, G. Röger, M. Helmert, and B. Bonet. LP-based heuristics for cost- optimal planning. In ICAPS, 2014.","title":"LP-based heuristics for costoptimal planning","authors":"F Pommerening, G Röger, M Helmert, B Bonet","year":"2014","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":48,"raw":"[Pulido et al., 2015] F. J. Pulido, L. Mandow, and J. L. P. De la Cruz. Dimensionality reduction in multiobjective shortest path search. Comput. Oper. Res., 64:60-70, 2015.","title":"Dimensionality reduction in multiobjective shortest path search","authors":"F J Pulido, L Mandow, J L P De La, Cruz","year":"2015","venue":"Comput. Oper. Res","doi":null,"url":null,"internal_url":null},{"position":49,"raw":"[Ren et al., 2021] Z. Ren, S. Rathinam, and H. Choset. Multi-objective conflict-based search for multi-agent path finding. In ICRA, pages 8786-8791. IEEE, 2021.","title":"Multi-objective conflict-based search for multi-agent path finding","authors":"Z Ren, S Rathinam, H Choset","year":"2021","venue":"ICRA","doi":null,"url":null,"internal_url":null},{"position":50,"raw":"[Ren et al., 2022a] Z. Ren, S. Rathinam, M. Likhachev, and H. Choset. Multi-objective path-based D* lite. IEEE Robotics Autom. Lett., 7(2):3318-3325, 2022.","title":"Multi-objective path-based D* lite","authors":"Ren","year":"2022","venue":"IEEE Robotics Autom. Lett","doi":null,"url":null,"internal_url":null},{"position":51,"raw":"[Ren et al., 2022b] Z. Ren, S. Rathinam, M. Likhachev, and H. Choset. Multi-objective safe-interval path planning with dynamic obstacles. IEEE Robotics Autom. Lett., 7(3):8154-8161, 2022.","title":"Multi-objective safe-interval path planning with dynamic obstacles","authors":"Ren","year":"2022","venue":"IEEE Robotics Autom. Lett","doi":null,"url":null,"internal_url":null},{"position":52,"raw":"[Ren et al., 2022c] Z. Ren, R. Zhan, S. Rathinam, M. Likhachev, and H. Choset. Enhanced multi-objective A* using balanced binary search trees. In SOCS, pages 162-170, 2022.","title":"Enhanced multi-objective A* using balanced binary search trees","authors":"Ren","year":"2022","venue":"SOCS","doi":null,"url":null,"internal_url":null},{"position":53,"raw":"[Rivera et al., 2020] N. Rivera, C. Hernández, N Hor- mazábal, and J Baier. The 2ˆk neighborhoods for grid path planning. J. Artif. Intell. Res., 67:81-113, 2020.","title":"The 2ˆk neighborhoods for grid path planning","authors":"N Rivera, C Hernández, Hormazábal, Baier","year":"2020","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":54,"raw":"[Rivera et al., 2022] N. Rivera, J. A. Baier, and C. Hernández. Subset approximation of Pareto re- gions with bi-objective A*. In AAAI, pages 10345-10352, 2022.","title":"Subset approximation of Pareto regions with bi-objective A","authors":"N Rivera, J A Baier, C Hernández","year":"2022","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":55,"raw":"[Roijers and Whiteson, 2017] D. M. Roijers and S. White- son. Multi-Objective Decision Making. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers, 2017.","title":"Multi-Objective Decision Making","authors":"D M Roijers, S Whiteson","year":"2017","venue":"Synthesis Lectures on Artificial Intelligence and Machine Learning","doi":null,"url":null,"internal_url":null},{"position":56,"raw":"[Roijers et al., 2013] D. M. Roijers, P. Vamplew, S. White- son, and R. Dazeley. A survey of multi-objective se- quential decision-making. J. Artif. Intell. Res., 48:67-113, 2013.","title":"A survey of multi-objective sequential decision-making","authors":"D M Roijers, P Vamplew, S Whiteson, R Dazeley","year":"2013","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":57,"raw":"[Salzman and Stern, 2020] O. Salzman and R. Stern. Re- search challenges and opportunities in multi-agent path finding and multi-agent pickup and delivery problems. In AAMAS, pages 1711-1715, 2020.","title":"Research challenges and opportunities in multi-agent path finding and multi-agent pickup and delivery problems","authors":"O Salzman, R Stern","year":"2020","venue":"AAMAS","doi":null,"url":null,"internal_url":null},{"position":58,"raw":"[Sanders and Mandow, 2013] P. Sanders and L. Mandow. Parallel label-setting multi-objective shortest path search. In Int. Symp. on Parallel and Distributed Processing, pages 215-224, 2013.","title":"Parallel label-setting multi-objective shortest path search","authors":"P Sanders, L Mandow","year":"2013","venue":"Int. Symp. on Parallel and Distributed Processing","doi":null,"url":null,"internal_url":null},{"position":59,"raw":"[Schulz et al., 2000] F. Schulz, D. Wagner, and K. Weihe. Dijkstra's algorithm on-line: An empirical case study from public railroad transport. J. Exp. Alg., 5:12-es, 2000.","title":"Dijkstra's algorithm on-line: An empirical case study from public railroad transport","authors":"F Schulz, D Wagner, K Weihe","year":"2000","venue":"J. Exp. Alg","doi":null,"url":null,"internal_url":null},{"position":60,"raw":"[Sedeño-Noda and Colebrook, 2019] A. Sedeño-Noda and M. Colebrook. A biobjective dijkstra algorithm. Eur. J. Oper. Res., 276(1):106-118, 2019.","title":"A biobjective dijkstra algorithm","authors":"Sedeño-Noda Colebrook, ; A Sedeño-Noda, M Colebrook","year":"2019","venue":"Eur. J. Oper. Res","doi":null,"url":null,"internal_url":null},{"position":61,"raw":"[Sedeño-Noda and Raith, 2015] A. Sedeño-Noda and A. Raith. A dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem. Comput. Oper. Res., 57:83-94, 2015.","title":"A dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem","authors":"Sedeño-Noda Raith, ; A Sedeño-Noda, A Raith","year":"2015","venue":"Comput. Oper. Res","doi":null,"url":null,"internal_url":null},{"position":62,"raw":"[Serafini, 1987] P. Serafini. Some considerations about com- putational complexity for multi objective combinatorial problems. In Recent advances and historical development of vector optimization, pages 222-232. Springer, 1987.","title":"Some considerations about computational complexity for multi objective combinatorial problems","authors":"P Serafini","year":"1987","venue":"Recent advances and historical development of vector optimization","doi":null,"url":null,"internal_url":null},{"position":63,"raw":"[Sievers and Helmert, 2021] S. Sievers and M. Helmert. Merge-and-shrink: A compositional theory of transforma- tions of factored transition systems. J. Artif. Intell. Res., 71:781-883, 2021.","title":"Merge-and-shrink: A compositional theory of transformations of factored transition systems","authors":"S Sievers, M Helmert","year":"2021","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":64,"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":65,"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 SOCS, 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":66,"raw":"[Stern et al., 2019] R. Stern, N. R. Sturtevant, A. Felner, S. Koenig, H. Ma, T. T. Walker, J. Li, D. Atzmon, L. Co- hen, T. K. S. Kumar, R. Barták, and E. Boyarski. Multi- agent pathfinding: Definitions, variants, and benchmarks. In SOCS, pages 151-159, 2019.","title":"Multiagent pathfinding: Definitions, variants, and benchmarks","authors":"R Stern, N R Sturtevant, A Felner, S Koenig, H Ma, T T Walker, J Li, D Atzmon, L Cohen, T K S Kumar, R Barták, E Boyarski","year":"2019","venue":"SOCS","doi":null,"url":null,"internal_url":null},{"position":67,"raw":"[Stewart and White III, 1991] B. Stewart and C. White III. Multiobjective A*. J. ACM, 38(4):775-814, 1991.","title":"Multiobjective A*","authors":"B Stewart, C White","year":"1991","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":68,"raw":"[Storandt, 2012] S. Storandt. Route planning for bicy- cles-exact constrained shortest paths made practical via contraction hierarchy. In ICAPS, pages 234-242, 2012.","title":"Route planning for bicycles-exact constrained shortest paths made practical via contraction hierarchy","authors":"S Storandt","year":"2012","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":69,"raw":"[Tarapata, 2007] Z. M. Tarapata. Selected multicriteria shortest path problems: An analysis of complexity, models and adaptation of standard algorithms. Int. J. Appl. Math, 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":"Int. J. Appl. Math","doi":null,"url":null,"internal_url":null},{"position":70,"raw":"[Tozer et al., 2017] B. Tozer, T. Mazzuchi, and S. Sarkani. Many-objective stochastic path finding using reinforce- ment learning. Expert Systems with Applications, 72:371- 382, 2017.","title":"Many-objective stochastic path finding using reinforcement learning","authors":"B Tozer, T Mazzuchi, S Sarkani","year":"2017","venue":"Expert Systems with Applications","doi":null,"url":null,"internal_url":null},{"position":71,"raw":"[Tsaggouris and Zaroliagis, 2009] G. Tsaggouris and C. D. Zaroliagis. Multiobjective optimization: Improved FPTAS for shortest paths and non-linear objectives with applica- tions. Theory of Com. Sys., 45(1):162-186, 2009.","title":"Multiobjective optimization: Improved FPTAS for shortest paths and non-linear objectives with applications","authors":"G Tsaggouris, C D Zaroliagis","year":"2009","venue":"Theory of Com. Sys","doi":null,"url":null,"internal_url":null},{"position":72,"raw":"[Ulungu and Teghem, 1991] EL Ulungu and J Teghem. Multi-objective shortest path problem: A survey. In Workshop on Multicriteria Decision Making: Methods- Algorithms-Applications, 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: Methods-Algorithms-Applications","doi":null,"url":null,"internal_url":null},{"position":73,"raw":"[Vallati and others, 2015] M. Vallati et al. The 2014 inter- national planning competition: Progress and trends. Ai Magazine, 36(3):90-98, 2015.","title":"The 2014 international planning competition: Progress and trends","authors":"M Vallati","year":"2015","venue":"Ai Magazine","doi":null,"url":null,"internal_url":null},{"position":74,"raw":"[Vazirani, 2001] V. V. Vazirani. Approximation algorithms. Springer, 2001.","title":"Approximation algorithms","authors":"V V Vazirani","year":"2001","venue":null,"doi":null,"url":null,"internal_url":null},{"position":75,"raw":"[Vincke, 1976] P. Vincke. A new approach to multiple crite- ria decision-making. In Multiple Criteria Decision Mak- ing, pages 341-350, 1976.","title":"A new approach to multiple criteria decision-making","authors":"P Vincke","year":"1976","venue":"Multiple Criteria Decision Making","doi":null,"url":null,"internal_url":null},{"position":76,"raw":"[Warburton, 1987] A. Warburton. Approximation of Pareto optima in multiple-objective, shortest-path problems. Oper. Res., 35(1):70-79, 1987.","title":"Approximation of Pareto optima in multiple-objective, shortest-path problems","authors":"A Warburton","year":"1987","venue":"Oper. Res","doi":null,"url":null,"internal_url":null},{"position":77,"raw":"[Weise and Mostaghim, 2022] J. Weise and S. Mostaghim. A scalable many-objective pathfinding benchmark suite. IEEE Trans. Evol. Comput., 26(1):188-194, 2022.","title":"A scalable many-objective pathfinding benchmark suite","authors":"J Weise, S Mostaghim","year":"2022","venue":"IEEE Trans. Evol. Comput","doi":null,"url":null,"internal_url":null},{"position":78,"raw":"[Yoshizumi et al., 2000] T. Yoshizumi, T. Miura, and T. Ishida. A* with partial expansion for large branching factor problems. In AAAI, pages 923-929, 2000.","title":"A* with partial expansion for large branching factor problems","authors":"T Yoshizumi, T Miura, T Ishida","year":"2000","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":79,"raw":"[Zhang et al., 2016] Y. Zhang, Z.-J M. Shen, and S. Song. Parametric search for the bi-attribute concave shortest path problem. Transportation Research Part B: Methodologi- cal, 94:150-168, 2016.","title":"Parametric search for the bi-attribute concave shortest path problem","authors":"Y Zhang, Z.-J M Shen, S Song","year":"2016","venue":"Transportation Research Part B: Methodological","doi":null,"url":null,"internal_url":null},{"position":80,"raw":"[Zhang et al., 2022a] H. Zhang, O. Salzman, T. K. S. Kumar, A. Felner, C. Hernández, and S. Koenig. Anytime approx- imate bi-objective search. In SOCS, pages 199-207, 2022.","title":"Anytime approximate bi-objective search","authors":"Zhang","year":"2022","venue":"SOCS","doi":null,"url":null,"internal_url":null},{"position":81,"raw":"[Zhang et al., 2022b] H. Zhang, O. Salzman, TK S. Kumar, A. Felner, C. Hernández, and S. Koenig. A*pex: Efficient approximate multi-objective search on graphs. In ICAPS, pages 394-403, 2022.","title":"A*pex: Efficient approximate multi-objective search on graphs","authors":"Zhang","year":"2022","venue":"ICAPS","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}