Proceedings of the International Symposium on Combinatorial Search
Informatics
Explore the latest research and advancements in combinatorial search algorithms and techniques. Discover cutting-edge solutions from the International Symposium proceedings.
Articles in this Journal
LSRP*: Scalable and Anytime Planning for Multi-Agent Path Finding with Asynchronous Actions (Extended Abstract)
Multi-Agent Path Finding (MAPF) seeks collision-free paths for multiple agents from their respective starting locations to their respective goal locations while minimizing path costs. Although many MAPF algorithms were developed, most of them rely on...
View Full Research
RAILGUN: A Unified Convolutional Policy for Multi-Agent Path Finding Across Different Environments and Tasks (Extended Abstract)
Multi-Agent Path Finding (MAPF), which focuses on finding collision-free paths for multiple robots, is crucial for applications ranging from aerial swarms to warehouse automation. Solving MAPF is NP-hard so learning-based approaches for MAPF have gai...
View Full Research
Object Packing and Scheduling for Sequential 3D Printing: A Linear Arithmetic Model and a CEGAR-Inspired Optimal Solver (Extended Abstract)
We address the problem of object arrangement and scheduling for sequential 3D printing. Unlike the standard 3D printing, where all objects are printed slice by slice, in sequential 3D printing, objects are completed one after another. In the sequenti...
View Full Research
Uncertainty in Real-World Vehicle Routing (Extended Abstract)
In our paper, we aim to address common sources of uncertainty in real-world industrial vehicle routing problems. By extending traditional deterministic heuristic solvers with easy-to-integrate, reusable, and computationally efficient mechanisms, we i...
View Full Research
Bidirectional Heuristic Search in Longest Path Problems (Extended Abstract)
Bidirectional heuristic search has the potential to decrease search time in combinatorial search problems amenable to backward search. To date, bidirectional search has been limited to minimization or shortest path problems. This paper extends the no...
View Full Research
Bidirectional Bounded-Suboptimal Heuristic Search with Consistent Heuristics (Extended Abstract)
Recent advancements in bidirectional heuristic search have yielded significant theoretical insights and novel algorithms. While most previous work has concentrated on optimal search methods, this paper focuses on bounded-suboptimal bidirectional sear...
View Full Research
You May Split but You Might Work It Out Later: First Steps Toward Merging Nodes in MAPF (Extended Abstract)
CBS is a state-of-the-art MAPF algorithm whose performance has been enhanced over the years by the introduction of heuristics that focus the search and reasoning techniques that identify specific types of conflicts that can be resolved faster. To fur...
View Full Research
Hierarchical Seating Allocation (Extended Abstract)
The Hierarchical Seating Allocation Problem (HSAP) is the problem to allocate an organizational hierarchy of teams to a set of seats on a floor plan. This problem is driven by the necessity for large organizations with large hierarchies to ensure tha...
View Full Research
Suboptimal Search with Dynamic Distribution of Suboptimality (Extended Abstract)
In bounded-suboptimal heuristic search, the aim is to find a solution path within a given bound as quickly as possible, which is crucial when computational resources are limited. Recent research has demonstrated Weighted A* variants such as XDP that...
View Full Research
Multi-Agent Path Finding for Schedule Constrained Automation (Extended Abstract)
In modern automation settings, jobs are processed across machines with interdependencies and are subject to limited equipment availability. When transportation between machines is considered, the problem evolves into a complex multi-agent routing tas...
View Full Research
Critical Section Macros - New Results (Extended Abstract)
This extended abstract presents new empirical results of recently introduced Critical Section Macro-operators (CSMs) whose design is inspired by using lockable resources in critical sections in parallel computing. In particular, we provide results on...
View Full Research
Exploring the Trade-off Between Flexible and Deployable Models for PDDL+ Urban Traffic Control (Extended Abstract)
The problem of traffic signal optimisation has been successfully tackled using the PDDL+ planning formalism, which also provides an ideal ground for simulating traffic behaviour and performing what-if analysis to assess and compare alternative scenar...
View Full Research
Learning Heuristic Functions with Graph Neural Networks for Numeric Planning (Extended Abstract)
In this paper, we investigate the application of heuristics based on Graph Neural Networks (GNNs) to lifted numeric planning problems, an area that has been relatively unexplored. Building upon the GNN approach for learning general policies proposed...
View Full Research
BLAST: Bit-Blasting Numbers for Classical Planning (Extended Abstract)
It is well known that numeric planning can be made decidable if the domain of all numeric state variables is finite. This bounded formulation can be polynomially compiled into classical planning with Boolean conditions and conditional effects preserv...
View Full Research
Surrogate-Assisted Monte-Carlo Tree Search in Facility Location and Beyond (Extended Abstract)
Combinatorial problems abound in industry. A persistent issue encountered using search-based solutions is that evaluating particular nodes may be expensive. As an example, organisations frequently adjust their facilities network by opening new branch...
View Full Research
Showing 1 to 15 of 47 results
Top Blogs by Rating
The Dark Matter of Big Data: U...
By Sciaria
Beyond the Vitals: Reading the...
By Sciaria
Whispers from the Ages: When L...
By Sciaria
Favorite Blog
Embrace the Uncomfortable Mirr...
By Sciaria
The Average Trap: Why Means Ca...
By Sciaria
The Compass You Didn't Know Yo...
By Sciaria
Sciaria Research