3 research outputs found
Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering
We introduce multi-goal multi agent path finding (MAPF) which
generalizes the standard discrete multi-agent path finding (MAPF) problem.
While the task in MAPF is to navigate agents in an undirected graph from their
starting vertices to one individual goal vertex per agent, MAPF assigns
each agent multiple goal vertices and the task is to visit each of them at
least once. Solving MAPF not only requires finding collision free paths
for individual agents but also determining the order of visiting agent's goal
vertices so that common objectives like the sum-of-costs are optimized. We
suggest two novel algorithms using different paradigms to address MAPF:
a heuristic search-based search algorithm called Hamiltonian-CBS (HCBS) and a
compilation-based algorithm built using the SMT paradigm, called
SMT-Hamiltonian-CBS (SMT-HCBS). Experimental comparison suggests limitations of
compilation-based approach
Pseudo-contractions as Gentle Repairs
Updating a knowledge base to remove an unwanted consequence is a challenging task. Some of the original sentences must be either deleted or weakened in such a way that the sentence to be removed is no longer entailed by the resulting set. On the other hand, it is desirable that the existing knowledge be preserved as much as possible, minimising the loss of information. Several approaches to this problem can be found in the literature. In particular, when the knowledge is represented by an ontology, two different families of frameworks have been developed in the literature in the past decades with numerous ideas in common but with little interaction between the communities: applications of AGM-like Belief Change and justification-based Ontology Repair. In this paper, we investigate the relationship between pseudo-contraction operations and gentle repairs. Both aim to avoid the complete deletion of sentences when replacing them with weaker versions is enough to prevent the entailment of the unwanted formula. We show the correspondence between concepts on both sides and investigate under which conditions they are equivalent. Furthermore, we propose a unified notation for the two approaches, which might contribute to the integration of the two areas