Portfolio item number 1
Short description of portfolio item number 1
Posts by Collection
portfolio
Portfolio item number 2
Short description of portfolio item number 2
publications
Departure scheduling and taxiway path planning under uncertainty
Published in In the proceedings of AIAA Aviation 2019 Forum, 2019
Use Google Scholar for full citation
Recommended citation: Jiaoyang Li, Mimi Gong, Zi Liang, Weizi Liu, Zhongyi Tong, Liangchen Yi, Robert Morris, Corina Pasearanu, Sven Koenig, "Departure scheduling and taxiway path planning under uncertainty." In the proceedings of AIAA Aviation 2019 Forum, 2019.
A simple and fast bi-objective search algorithm
Published in In the proceedings of Proceedings of the International Conference on Automated Planning and Scheduling, 2020
Use Google Scholar for full citation
Recommended citation: Carlos Ulloa, William Yeoh, Jorge Baier, Han Zhang, Luis Suazo, Sven Koenig, "A simple and fast bi-objective search algorithm." In the proceedings of Proceedings of the International Conference on Automated Planning and Scheduling, 2020.
A hierarchical approach to multi-agent path finding
Published in In the proceedings of Proceedings of the International symposium on Combinatorial search, 2021
Use Google Scholar for full citation
Recommended citation: Han Zhang, Mingze Yao, Ziang Liu, Jiaoyang Li, Lucas Terr, Shao-Hung Chan, TK Kumar, Sven Koenig, "A hierarchical approach to multi-agent path finding." In the proceedings of Proceedings of the International symposium on Combinatorial search, 2021.
Conflict-based increasing cost search
Published in In the proceedings of Proceedings of the International Conference on Automated Planning and Scheduling, 2021
Use Google Scholar for full citation
Recommended citation: Thayne Walker, Nathan Sturtevant, Ariel Felner, Han Zhang, Jiaoyang Li, TK Kumar, "Conflict-based increasing cost search." In the proceedings of Proceedings of the International Conference on Automated Planning and Scheduling, 2021.
Mutex propagation for SAT-based multi-agent path finding
Published in In the proceedings of PRIMA 2020: Principles and Practice of Multi-Agent Systems: 23rd International Conference, Nagoya, Japan, November 18--20, 2020, Proceedings 23, 2021
Use Google Scholar for full citation
Recommended citation: Pavel Surynek, Jiaoyang Li, Han Zhang, TK Satish, Sven Koenig, "Mutex propagation for SAT-based multi-agent path finding." In the proceedings of PRIMA 2020: Principles and Practice of Multi-Agent Systems: 23rd International Conference, Nagoya, Japan, November 18--20, 2020, Proceedings 23, 2021.
Temporal reasoning with kinodynamic networks
Published in In the proceedings of Proceedings of the International Conference on Automated Planning and Scheduling, 2021
Use Google Scholar for full citation
Recommended citation: Han Zhang, Neelesh Tiruviluamala, Sven Koenig, TK Kumar, "Temporal reasoning with kinodynamic networks." In the proceedings of Proceedings of the International Conference on Automated Planning and Scheduling, 2021.
A* pex: Efficient approximate multi-objective search on graphs
Published in In the proceedings of Proceedings of the International Conference on Automated Planning and Scheduling, 2022
Use Google Scholar for full citation
Recommended citation: Han Zhang, Oren Salzman, TK Kumar, Ariel Felner, Carlos Ulloa, Sven Koenig, "A* pex: Efficient approximate multi-objective search on graphs." In the proceedings of Proceedings of the International Conference on Automated Planning and Scheduling, 2022.
Anytime approximate bi-objective search
Published in In the proceedings of Proceedings of the International Symposium on Combinatorial Search, 2022
Use Google Scholar for full citation
Recommended citation: Han Zhang, Oren Salzman, TK Kumar, Ariel Felner, Carlos Ulloa, Sven Koenig, "Anytime approximate bi-objective search." In the proceedings of Proceedings of the International Symposium on Combinatorial Search, 2022.
Bounded-cost bi-objective heuristic search
Published in In the proceedings of Proceedings of the International Symposium on Combinatorial Search, 2022
Use Google Scholar for full citation
Recommended citation: Shawn Skyler, Dor Atzmon, Ariel Felner, Oren Salzman, Han Zhang, Sven Koenig, William Yeoh, Carlos Ulloa, "Bounded-cost bi-objective heuristic search." In the proceedings of Proceedings of the International Symposium on Combinatorial Search, 2022.
Multi-agent path finding for precedence-constrained goal sequences
Published in In the proceedings of International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2022
Use Google Scholar for full citation
Recommended citation: Han Zhang, Jingkai Chen, Jiaoyang Li, Brian Williams, Sven Koenig, "Multi-agent path finding for precedence-constrained goal sequences." In the proceedings of International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2022.
Mutex Propagation in Multi-Agent Path Finding for Large Agents
Published in In the proceedings of Proceedings of the International Symposium on Combinatorial Search, 2022
Use Google Scholar for full citation
Recommended citation: Han Zhang, Yutong Li, Jiaoyang Li, TK Kumar, Sven Koenig, "Mutex Propagation in Multi-Agent Path Finding for Large Agents." In the proceedings of Proceedings of the International Symposium on Combinatorial Search, 2022.
Towards effective multi-valued heuristics for bi-objective shortest-path algorithms via differential heuristics
Published in In the proceedings of Proceedings of the International Symposium on Combinatorial Search, 2023
Use Google Scholar for full citation
Recommended citation: Han Zhang, Oren Salzman, Ariel Felner, TK Satish Kumar, Shawn Skyler, Carlos Hernández Ulloa, Sven Koenig, " Towards effective multi-valued heuristics for bi-objective shortest-path algorithms via differential heuristics." In the proceedings of Proceedings of the International Symposium on Combinatorial Search, 2023.
Binary branching multi-objective conflict-based search for multi-agent path finding
Published in In the proceedings of Proceedings of the International Conference on Automated Planning and Scheduling, 2023
Use Google Scholar for full citation
Recommended citation: Zhongqiang Ren, Jiaoyang Li, Han Zhang, Sven Koenig, Sivakumar Rathinam, Howie Choset, "Binary branching multi-objective conflict-based search for multi-agent path finding." In the proceedings of Proceedings of the International Conference on Automated Planning and Scheduling, 2023.
Cost splitting for multi-objective conflict-based search
Published in In the proceedings of Proceedings of the International Conference on Automated Planning and Scheduling, 2023
Use Google Scholar for full citation
Recommended citation: Cheng Ge, Han Zhang, Jiaoyang Li, Sven Koenig, "Cost splitting for multi-objective conflict-based search." In the proceedings of Proceedings of the International Conference on Automated Planning and Scheduling, 2023.
Efficient multi-query bi-objective search via contraction hierarchies
Published in In the proceedings of Proceedings of the International Conference on Automated Planning and Scheduling, 2023
Use Google Scholar for full citation
Recommended citation: Han Zhang, Oren Salzman, Ariel Felner, TK Kumar, Carlos Ulloa, Sven Koenig, "Efficient multi-query bi-objective search via contraction hierarchies." In the proceedings of Proceedings of the International Conference on Automated Planning and Scheduling, 2023.
Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research Opportunities [Survey Track]
Published in In the proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 2023
Use Google Scholar for full citation
Recommended citation: Oren Salzman, Ariel Felner, H Zhang, S-H Chan, S Koenig, "Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research Opportunities [Survey Track]." In the proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 2023.
Multi-objective search via lazy and efficient dominance checks
Published in In the proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 2023
Use Google Scholar for full citation
Recommended citation: Carlos Hern{\'a}ndez, William Yeoh, Jorge Baier, Ariel Felner, Oren Salzman, Han Zhang, S-H Chan, Sven Koenig, "Multi-objective search via lazy and efficient dominance checks." In the proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 2023.
Must-Expand Nodes in Multi-Objective Search
Published in In the proceedings of Proceedings of the International Symposium on Combinatorial Search, 2023
Use Google Scholar for full citation
Recommended citation: Shawn Skyler, Shahaf Shperberg, Dor Atzmon, Ariel Felner, Oren Salzman, Shao-Hung Chan, Han Zhang, Sven Koenig, William Yeoh, Carlos Ulloa, "Must-Expand Nodes in Multi-Objective Search." In the proceedings of Proceedings of the International Symposium on Combinatorial Search, 2023.
AA* pex: Efficient Anytime Approximate Multi-Objective Search
Published in In the proceedings of Proceedings of the International Symposium on Combinatorial Search, 2024
Use Google Scholar for full citation
Recommended citation: Han Zhang, Oren Salzman, Ariel Felner, Carlos Ulloa, Sven Koenig, "AA* pex: Efficient Anytime Approximate Multi-Objective Search." In the proceedings of Proceedings of the International Symposium on Combinatorial Search, 2024.
Bounded-Suboptimal Weight-Constrained Shortest-Path Search via Efficient Representation of Paths
Published in In the proceedings of Proceedings of the International Conference on Automated Planning and Scheduling, 2024
Use Google Scholar for full citation
Recommended citation: Han Zhang, Oren Salzman, Ariel Felner, TK Kumar, Sven Koenig, "Bounded-Suboptimal Weight-Constrained Shortest-Path Search via Efficient Representation of Paths." In the proceedings of Proceedings of the International Conference on Automated Planning and Scheduling, 2024.
Efficient Approximate Search for Multi-Objective Multi-Agent Path Finding
Published in In the proceedings of Proceedings of the International Conference on Automated Planning and Scheduling, 2024
Use Google Scholar for full citation
Recommended citation: Fangji Wang, Han Zhang, Sven Koenig, Jiaoyang Li, "Efficient Approximate Search for Multi-Objective Multi-Agent Path Finding." In the proceedings of Proceedings of the International Conference on Automated Planning and Scheduling, 2024.
Efficient Set Dominance Checks in Multi-Objective Shortest-Path Algorithms via Vectorized Operations
Published in In the proceedings of Proceedings of the International Symposium on Combinatorial Search, 2024
Use Google Scholar for full citation
Recommended citation: Carlos Ulloa, Han Zhang, Sven Koenig, Ariel Felner, Oren Salzman, "Efficient Set Dominance Checks in Multi-Objective Shortest-Path Algorithms via Vectorized Operations." In the proceedings of Proceedings of the International Symposium on Combinatorial Search, 2024.
Speeding Up Dominance Checks in Multi-Objective Search: New Techniques and Data Structures
Published in In the proceedings of Proceedings of the International Symposium on Combinatorial Search, 2024
Use Google Scholar for full citation
Recommended citation: Han Zhang, Oren Salzman, Ariel Felner, TK Kumar, Carlos Ulloa, Sven Koenig, "Speeding Up Dominance Checks in Multi-Objective Search: New Techniques and Data Structures." In the proceedings of Proceedings of the International Symposium on Combinatorial Search, 2024.
talks
Talk 1 on Relevant Topic in Your Field
Published:
This is a description of your talk, which is a markdown files that can be all markdown-ified like any other post. Yay markdown!
Conference Proceeding talk 3 on Relevant Topic in Your Field
Published:
This is a description of your conference proceedings talk, note the different field in type. You can put anything in this field.
teaching
Teaching experience 1
Undergraduate course, University 1, Department, 2014
This is a description of a teaching experience. You can use markdown like any other post.
Teaching experience 2
Workshop, University 1, Department, 2015
This is a description of a teaching experience. You can use markdown like any other post.