paper-with-me

홈 › Papers

Speedup Techniques for Switchable Temporal Plan Graph Optimization

2024-12-20 · He Jiang, MuHan Lin, Jiaoyang Li

Multi-Agent Path Finding (MAPF) focuses on planning collision-free paths for multiple agents. However, during the execution of a MAPF plan, agents may encounter unexpected delays, which can lead to inefficiencies, deadlocks, or even collisions. To address these issues, the Switchable Temporal Plan Graph provides a framework for finding an acyclic Temporal Plan Graph with the minimum execution cost under delays, ensuring deadlock- and collision-free execution. Unfortunately, existing optimal algorithms, such as Mixed Integer Linear Programming and Graph-Based Switchable Edge Search (GSES), are often too slow for practical use. This paper introduces Improved GSES, which significantly accelerates GSES through four speedup techniques: stronger admissible heuristics, edge grouping, prioritized branching, and incremental implementation. Experiments conducted on four different map types with varying numbers of agents demonstrate that Improved GSES consistently achieves over twice the success rate of GSES and delivers up to a 30-fold speedup on instances where both methods successfully find solutions.

📄 PDF Abstract BibTeX arXiv:2412.15908

Code (0)

등록된 구현이 없습니다.

Tasks

Multi-Agent Path Finding

Similar Papers 제목 키워드 기반

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

2023-12-30 · Yifan Su, Rishi Veerapaneni, Jiaoyang Li

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 assumption that an agent can arrive at a specific l…

Multi-Agent Path Finding

Switchable K-Class Hyperplanes for Noise-Robust Representation Learning

2021-01-01 · ICCV 2021 10 · Boxiao Liu, Guanglu Song, Manyuan Zhang, Haihang You 외

Optimizing the K-class hyperplanes in the latent space has become the standard paradigm for efficient representation learning. However, it's almost impossible to find an optimal K-class hyperplane to accurately descr…

Model OptimizationRepresentation Learningvalid

Tunable Image Quality Control of 3-D Ultrasound using Switchable CycleGAN

2021-12-06 · Jaeyoung Huh, Shujaat Khan, Sungjin Choi, Dongkuk Shin 외

In contrast to 2-D ultrasound (US) for uniaxial plane imaging, a 3-D US imaging system can visualize a volume along three axial planes. This allows for a full view of the anatomy, which is useful for gynecological (GYN) …

AnatomyImage Enhancement

Evaluating Temporal Semantic Caching and Workflow Optimization in Agentic Plan-Execute Pipelines

2026-05-20 · Alimurtaza Mustafa Merchant, Krish Veera, Sajal Kumar Goyla, Shambhawi Bhure 외 arxiv

Industrial asset operations workflows are latency-sensitive because a single user query may require coordination over sensor data, work orders, failure modes, forecasting tools, and domain-specific agents. We evaluate th…

Switchable Temporal Propagation Network

2018-04-23 · ECCV 2018 9 · Sifei Liu, Guangyu Zhong, Shalini De Mello, Jinwei Gu 외

Videos contain highly redundant information between frames. Such redundancy has been extensively studied in video compression and encoding, but is less explored for more advanced video processing. In this paper, we propo…

Video Compression