The 2nd International Workshop on Heuristic Search in Industry
In conjunction with the 31st International Joint Conference on Artificial Intelligence and the 25th European Conference on Artificial Intelligence (IJCAI-ECAI 2022)
Home Call For Papers Organizers Program
The 2nd International Workshop on Heuristic Search in Industry
In conjunction with the 31st International Joint Conference on Artificial Intelligence and the 25th European Conference on Artificial Intelligence (IJCAI-ECAI 2022)
Home Call For Papers Organizers Program
Program Schedule
July 24, 2022 (Time Zone: CEST)
09:20-09:30 Opening Remark
09:30-10:30 Invited Talk

  • Invited Presenter: Daniel Harabor


    Title: Practical Challenges in Multi-Agent Path Finding


    Abstract: A variety of recent and emerging industrial applications ask us to compute collision-free paths for a team of cooperative agents. To tackle these problems effectively practitioners must grapple with challenging issues such as operational constraints, execution-time uncertainty and the inevitable quality / performance tradeoffs that arise when planning for hundreds and sometimes thousands of simultaneous agents. The good news is that Heuristic Search methods are extremely well positioned to tackle these challenges. In this talk I explore recent progress in this area using examples from a variety of domains, such as warehouse fulfillment, rail planning and 3D pipe routing.
10:30-11:00 Coffe Break
11:00-12:00 Session "Industry Problems"
  • [11:00-11:20] Conflict- and Fairness-Directed Heuristic Search Scheduling for NASA's Oversubscribed Deep Space Network
  • [11:20-11:40] Adaptive Net and Path Weighting for Timing-Driven Placement
  • [11:40-12:00] Ranking Cost: Building An Efficient and Scalable Circuit Routing Planner with Evolution-Based Optimization [Video]
12:00-12:30 Discussion "Challenges for Heuristic Search in Industry"
14:00-15:00 Session "Path Finding"
  • [14:00-14:20] Deadline-Aware Multi-Agent Tour Planning [Video]
  • [14:20-14:40] A Practical Approach to Multi-Agent Path Finding in Robotic Warehouses
  • [14:40-15:00] CPDs path planning algorithms combined with improved proximity wildcards strategys [Video]
15:00-15:30 Discussion "Different communities in Heuristic Search Get Together"
15:30-16:00 Coffe Break
16:00-17:00 Session "Classic Combinatorial Optimization"
  • [16:00-16:20] Same-class Object Co-localization as Maximum Edge Weight Cliques [Video]
  • [16:20-16:40] Efficient discretization set for solving rectangular plate cutting problem
  • [16:40-17:00] A Self-stabilizing Memetic Algorithm for Minimum Weakly Connected Dominating Set Problems [Video]
Accepted Papers
Authors Title Download Link
Jonathan Morag, Ariel Felner, Roni Stern, Dor Atzmon, Eli Boyarski, Sria Louis, Meir Toledano A Practical Approach to Multi-Agent Path Finding in Robotic Warehouses PDF
Dangdang Niu, Minghao Yin A Self-stabilizing Memetic Algorithm for Minimum Weakly Connected Dominating Set Problems PDF
Shijian Chen, Ye Cai, Biwei Xie, Xingquan Li Adaptive Net and Path Weighting for Timing-Driven Placement PDF
Mark D. Johnston Conflict- and Fairness-Directed Heuristic Search Scheduling for NASA's Oversubscribed Deep Space Network PDF
Yue ZHANG, Yong-Gang ZHANG CPDs path planning algorithms combined with improved proximity wildcards strategys PDF
Taoan Huang, Vikas Shivashankar, Michael Caldara, Joseph Durham, Jiaoyang Li, Bistra Dilkina, Sven Koenig Deadline-Aware Multi-Agent Tour Planning PDF
Xie Tianlun, Hu Dongping, Yin Aihua, Wang Lei, Wang Jing Efficient discretization set for solving rectangular plate cutting problem PDF
Shiyu Huang, Bin Wang, Dong Li, Jianye Hao, Ting Chen, Jun Zhu Ranking Cost: Building An Efficient and Scalable Circuit Routing Planner with Evolution-Based Optimization PDF
Yi Fan, Longin Jan Latecki Same-class Object Co-localization as Maximum Edge Weight Cliques PDF