[PDF][PDF] Knowledge Graph Embedding: An Overview

X Ge, YC Wang, B Wang, CCJ Kuo - APSIPA Transactions on …, 2024 - nowpublishers.com
Many mathematical models have been leveraged to design embeddings for representing
Knowledge Graph (KG) entities and relations for link prediction and many downstream tasks …

Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution

Y Su, R Veerapaneni, J Li - Proceedings of the AAAI Conference on …, 2024 - ojs.aaai.org
The Multi-Agent Path Finding (MAPF) problem involves planning collision-free paths for
multiple agents in a shared environment. The majority of MAPF solvers rely on the …

A Comprehensive Review on Leveraging Machine Learning for Multi-Agent Path Finding

JM Alkazzi, K Okumura - IEEE Access, 2024 - ieeexplore.ieee.org
This review paper provides an in-depth analysis of the latest advancements in applying
Machine Learning (ML) to solve the Multi-Agent Path Finding (MAPF) problem. The MAPF …

Introducing Delays in Multi Agent Path Finding

J Kottinger, T Geft, S Almagor, O Salzman… - Proceedings of the …, 2024 - ojs.aaai.org
Abstract We consider a Multi-Agent Path Finding (MAPF) setting where agents have been
assigned a plan, but during its execution some agents are delayed. Instead of replanning …

[HTML][HTML] Using dynamic knowledge graphs to detect emerging communities of knowledge

JT Aparicio, E Arsenio, F Santos… - Knowledge-Based Systems, 2024 - Elsevier
Abstract Knowledge graphs represent relationships between entities. These graphs can take
dynamic forms to trace changes along time through text models and further used by …

A priority-based hierarchical framework for k-robust multi-agent path finding

K Zhang, J Mao, S Zhang… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
Multi-agent path finding is one of the key problems in the topic of multi-agent system. While
some inevitable execution delays resulting from the realistic factors, such as robot faults or …

Improving the Efficiency and Efficacy of Multi-Agent Reinforcement Learning on Complex Railway Networks with a Local-Critic Approach

Y Zhang, U Deekshith, J Wang… - Proceedings of the …, 2024 - ojs.aaai.org
The complex railway network is a challenging real-world multi-agent system usually
involving thousands of agents. Current planning methods heavily depend on expert …

Integration of Efficient Techniques Based on Endpoints in Solution Method for Lifelong Multiagent Pickup and Delivery Problem

T Matsui - Systems, 2024 - mdpi.com
We investigate the integration of several additional efficient techniques that improve a
solution method for the lifelong multiagent pickup-and-delivery (MAPD) problem to reduce …

A Framework for Simultaneous Task Allocation and Planning under Uncertainty

F Faruq, B Lacerda, N Hawes, D Parker - ACM Transactions on …, 2024 - dl.acm.org
We present novel techniques for simultaneous task allocation and planning in multi-robot
systems operating under uncertainty. By performing task allocation and planning …

Robust Multi-Agent Pathfinding with Continuous Time

WJ Tan, X Tang, W Cai - … of the International Conference on Automated …, 2024 - ojs.aaai.org
Abstract Multi-Agent Pathfinding (MAPF) is the problem of finding plans for multiple agents
such that every agent moves from its start location to its goal location without collisions. If …