This extended abstract presents new empirical results of recently introduced Critical Section Macro-operators (CSMs) whose design is inspired by using...
This extended abstract presents timely new empirical results concerning Critical Section Macro-operators (CSMs), a concept inspired by the use of lock...
The problem of traffic signal optimisation has been successfully tackled using the PDDL+ planning formalism, which also provides an ideal ground for s...
This extended abstract presents a timely and relevant exploration into the core dilemma faced when applying advanced AI planning techniques, specifica...
In this paper, we investigate the application of heuristics based on Graph Neural Networks (GNNs) to lifted numeric planning problems, an area that ha...
This extended abstract presents a timely investigation into the application of Graph Neural Networks (GNNs) for learning heuristic functions in the co...
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 p...
This extended abstract, titled "BLAST: Bit-Blasting Numbers for Classical Planning," tackles a crucial gap between theoretical tractability and practi...
Combinatorial problems abound in industry. A persistent issue encountered using search-based solutions is that evaluating particular nodes may be expe...
This extended abstract presents a compelling approach to tackling computationally expensive combinatorial optimization problems, specifically focusing...
BAE*, and the independently developed DIBBS, are state-of-the-art bidirectional heuristic search algorithms that exploit heuristic consistency to effi...
This position paper tackles a critical efficiency concern within state-of-the-art bidirectional heuristic search algorithms, particularly BAE* and DIB...
Encoding combinatorial problems in terms of propositional satisfiability (SAT) enables utilization of highly efficient SAT solvers for combinatorial s...
This position paper introduces a compelling and novel approach to enhance SAT local search through the specialized application of Large Language Model...
Multi-Agent Path Finding (MAPF) deals with finding conflict-free paths for a set of agents from an initial configuration to a given target configurati...
This position paper critically examines a fundamental inefficiency in current approaches to Lifelong Multi-Agent Path Finding (LMAPF), specifically th...
This paper provides a survey of recent literature on the use of multi-armed bandit algorithms to solve the Boolean satisfiability problem (SAT), a wel...
This survey paper addresses a highly relevant and impactful topic: the application of multi-armed bandit (MAB) algorithms to the Boolean Satisfiabilit...
Multi-Agent Path Finding (MAPF) aims to arrange collision-free goal-reaching paths for a group of agents. Anytime MAPF solvers based on large neighbor...
This paper presents a timely and critical reevaluation of Large Neighborhood Search (LNS) approaches for Multi-Agent Path Finding (MAPF). The authors...
Showing 4041 to 4050 of 9840 results
By Sciaria
By Sciaria
By Sciaria
By Sciaria
By Sciaria
By Sciaria