Tootfinder

MAPF-World: Action World Model for Multi-Agent Path Finding
Zhanjiang Yang, Meng Li, Yang Shen, Yueming Li, Lijun Sun
https://arxiv.org/abs/2508.12087 https://

MAPF-World: Action World Model for Multi-Agent Path Finding
Multi-agent path finding (MAPF) is the problem of planning conflict-free paths from the designated start locations to goal positions for multiple agents. It underlies a variety of real-world tasks, including multi-robot coordination, robot-assisted logistics, and social navigation. Recent decentralized learnable solvers have shown great promise for large-scale MAPF, especially when leveraging foundation models and large datasets. However, these agents are reactive policy models and exhibit limi…

This https://arxiv.org/abs/2501.13862 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Efficient Fermi-Hubbard model ground-state preparation by coupling to a classical reservoir in the instantaneous-response limit
Preparing the ground state of the Fermi-Hubbard model is challenging, in part due to the exponentially large Hilbert space, which complicates efficiently finding a path from an initial state to the ground state using the variational principle. In this work, we propose an approach for ground state preparation of interacting models by involving a classical reservoir, simplified to the instantaneous-response limit, which can be described using a Hamiltonian formalism. The resulting time evolution …

Path Planning using a One-shot-sampling Skeleton Map
Gabriel O. Flores-Aquino, Octavio Gutierrez-Frias, Juan Irving Vasquez
https://arxiv.org/abs/2507.02328

Path Planning using a One-shot-sampling Skeleton Map
Path planning algorithms aim to compute a collision-free path, and many works focus on finding the optimal distance path. However, for some applications, a more suitable approach is to balance response time, safety of the paths, and path length. In this context, a skeleton map is a useful tool in graph-based schemes, as it provides an intrinsic representation of free configuration space. However, skeletonization algorithms are very resource-intensive, being primarily oriented towards image proc…

Navigating Phase Transitions with Path-Finding Algorithms: A Strategic Approach to Replica Exchange Monte Carlo
Akie Kowaguchi, Katsuhiro Endo, Kentaro Nomura, Shuichi Kurabayashi, Paul E. Brumby, Kenji Yasuoka
https://arxiv.org/abs/2506.02549

Navigating Phase Transitions with Path-Finding Algorithms: A Strategic Approach to Replica Exchange Monte Carlo
The replica exchange method is a powerful tool for overcoming slow relaxation in molecular simulations, but its efficiency depends strongly on the choice of the number and interval of replicas and their exchange probabilities. Here, we propose a new optimization scheme based on the Dijkstra algorithm that constructs an optimal exchange path by representing replicas and their exchange probabilities as a graph. Inspired by path-finding techniques widely used in computer science, including applica…

Parameterized Restless Temporal Path
Justine Cauvi (DI-ENS, ARGO, ENS de Lyon), Laurent Viennot (DI-ENS, ARGO)
https://arxiv.org/abs/2507.05760 https://

Parameterized Restless Temporal Path
Recently, Bumpus and Meeks introduced a purely temporal parameter, called vertex-interval-membership-width, which is promising for the design of fixed-parameter tractable (FPT) algorithms for vertex reachability problems in temporal graphs. We study this newly introduced parameter for the problem of restless temporal paths, in which the waiting time at each node is restricted. In this article, we prove that, in the interval model, where arcs are present for entire time intervals, finding a rest…

I bought Rosemary's Baby (eBook). I've always wondered 🤷‍♂️ I've never seen the movie either. The funny thing is, it came as a connection after browsing through the Beastie Boys Wikipedia page, following the path:
Beasty Boys -> Ad-Rock -> Molly Ringwald -> Tempest (1982 film) -> John Cassavetes (1929 - 1989) -> Rosemary's Baby (1968 film) -> Ira Levin (1929 - 2007).
...and then finding out there's a pricier, DRM-ed EPUB2 (2011) vs a little b…

Thermodynamics of a Spherically Symmetric Causal Diamond in Minkowski Spacetime
Kwinten Fransen, Temple He, Kathryn M. Zurek
https://arxiv.org/abs/2507.22977 https://

Thermodynamics of a Spherically Symmetric Causal Diamond in Minkowski Spacetime
We compute a gravitational on-shell action of a finite, spherically symmetric causal diamond in $(d+2)$-dimensional Minkowski spacetime, finding it is proportional to the area of the bifurcate horizon $A_{\mathcal{B}}$. We then identify the on-shell action with the saddle point of the Euclidean gravitational path integral, which is naturally interpreted as a partition function. This partition function is thermal with respect to a modular Hamiltonian $K$. Consequently, we determine, from the on-…

When Agents Break Down in Multiagent Path Finding
Foivos Fioravantes, Du\v{s}an Knop, Nikolaos Melissinos, Michal Opler
https://arxiv.org/abs/2508.03777 https://

When Agents Break Down in Multiagent Path Finding
In Multiagent Path Finding (MAPF), the goal is to compute efficient, collision-free paths for multiple agents navigating a network from their sources to targets, minimizing the schedule's makespan-the total time until all agents reach their destinations. We introduce a new variant that formally models scenarios where some agents may experience delays due to malfunctions, posing significant challenges for maintaining optimal schedules. Recomputing an entirely new schedule from scratch after ea…

FrameShift: Learning to Resize Fuzzer Inputs Without Breaking Them
Harrison Green, Claire Le Goues, Fraser Brown
https://arxiv.org/abs/2507.05421 https://

FrameShift: Learning to Resize Fuzzer Inputs Without Breaking Them
Coverage-guided fuzzers are powerful automated bug-finding tools. They mutate program inputs, observe coverage, and save any input that hits an unexplored path for future mutation. Unfortunately, without knowledge of input formats--for example, the relationship between formats' data fields and sizes--fuzzers are prone to generate destructive frameshift mutations. These time-wasting mutations yield malformed inputs that are rejected by the target program. To avoid such breaking mutations, this p…

Automatic Melody Reduction via Shortest Path Finding
Ziyu Wang, Yuxuan Wu, Roger B. Dannenberg, Gus Xia
https://arxiv.org/abs/2508.01571 https://arxiv.org/…

Automatic Melody Reduction via Shortest Path Finding
Melody reduction, as an abstract representation of musical compositions, serves not only as a tool for music analysis but also as an intermediate representation for structured music generation. Prior computational theories, such as the Generative Theory of Tonal Music, provide insightful interpretations of music, but they are not fully automatic and usually limited to the classical genre. In this paper, we propose a novel and conceptually simple computational method for melody reduction using a…

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs
Jesse Beisegel, Katharina Klost, Kristin Knorr, Fabienne Ratajczak, Robert Scheffler
https://arxiv.org/abs/2506.23790

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs
We consider the problem of finding a Hamiltonian path or a Hamiltonian cycle with precedence constraints in the form of a partial order on the vertex set. We show that the path problem is $\mathsf{NP}$-complete for graphs of pathwidth 4 while the cycle problem is $\mathsf{NP}$-complete on graphs of pathwidth 5. We complement these results by giving polynomial-time algorithms for graphs of pathwidth 3 and treewidth 2 for Hamiltonian paths as well as pathwidth 4 and treewidth 3 for Hamiltonian cy…

Computing an optimal single machine schedule with sequence dependent setup times using shortest path computations
Dominik Leib, Till Heller, Raphael K\"uhn
https://arxiv.org/abs/2507.20611

Computing an optimal single machine schedule with sequence dependent setup times using shortest path computations
We study a single-machine scheduling problem with sequence dependent setup times, motivated by applications in manufacturing and service industries - in particular, the calendering stage in rubber flooring production. In this phase, setup times are primarily driven by temperature and color transitions between consecutive jobs, with significant impact on throughput and energy efficiency. We present a novel solution framework that transforms the scheduling problem into a path-finding problem on a…

An Improved Grey Wolf Optimizer Inspired by Advanced Cooperative Predation for UAV Shortest Path Planning
Zuhao Teng, Qian Dong, Ze Zhang, Shuangyao Huang, Wenzhang Zhang, Jingchen Wang, Ji Li, Xi Chen
https://arxiv.org/abs/2506.03663

An Improved Grey Wolf Optimizer Inspired by Advanced Cooperative Predation for UAV Shortest Path Planning
With the widespread application of Unmanned Aerial Vehicles (UAVs) in domains like military reconnaissance, emergency rescue, and logistics delivery, efficiently planning the shortest flight path has become a critical challenge. Traditional heuristic-based methods often suffer from the inability to escape from local optima, which limits their effectiveness in finding the shortest path. To address these issues, a novel Improved Grey Wolf Optimizer (IGWO) is presented in this study. The proposed …

The Complexity of Color-constrained Paths in Semicomplete Multipartite Digraphs
Julian Brinkmann
https://arxiv.org/abs/2507.15667 https://

The Complexity of Color-constrained Paths in Semicomplete Multipartite Digraphs
Every semicomplete multipartite digraph contains a quasi-Hamiltonian path, but the problem of finding a quasi-Hamiltonian path with prescribed start and end vertex is NP-complete even when restricted to semicomplete multipartite digraphs with independence number exactly 3. Bang-Jensen, Wang and Yeo (arXiv 2024) showed that deciding the presence of a quasi-Hamiltonian cycle which does not contain at least one vertex from each color class is NP-complete. Similarly, deciding the presence of a quas…

Consistent quantum treatments of non-convex kinetic energies
C. Koliofoti, M. A. Javed, R. -P. Riwar
https://arxiv.org/abs/2507.21993 https://arxiv.org/pdf…

Consistent quantum treatments of non-convex kinetic energies
The task of finding a consistent relationship between a quantum Hamiltonian and a classical Lagrangian is of utmost importance for basic, but ubiquitous techniques like canonical quantization and path integrals. Nonconvex kinetic energies (which appear, e.g., in Wilczek and Shapere's classical time crystal, or nonlinear capacitors) pose a fundamental problem: the Legendre transformation is ill-defined, and the more general Legendre-Fenchel transformation removes nonconvexity essentially by defi…

This https://arxiv.org/abs/2412.09433 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCC_…

Solving Multiagent Path Finding on Highly Centralized Networks
The Mutliagent Path Finding (MAPF) problem consists of identifying the trajectories that a set of agents should follow inside a given network in order to reach their desired destinations as soon as possible, but without colliding with each other. We aim to minimize the maximum time any agent takes to reach their goal, ensuring optimal path length. In this work, we complement a recent thread of results that aim to systematically study the algorithmic behavior of this problem, through the paramet…

BTPG-max: Achieving Local Maximal Bidirectional Pairs for Bidirectional Temporal Plan Graphs
Yifan Su, Rishi Veerapaneni, Jiaoyang Li
https://arxiv.org/abs/2508.04849 https://…

BTPG-max: Achieving Local Maximal Bidirectional Pairs for Bidirectional Temporal Plan Graphs
Multi-Agent Path Finding (MAPF) requires computing collision-free paths for multiple agents in shared environment. Most MAPF planners assume that each agent reaches a specific location at a specific timestep, but this is infeasible to directly follow on real systems where delays often occur. To address collisions caused by agents deviating due to delays, the Temporal Plan Graph (TPG) was proposed, which converts a MAPF time dependent solution into a time independent set of inter-agent dependenc…

Spinfoam tunneling of quantum geometries in angle variables
Pietro Don\`a, Hal M. Haggard, Carlo Rovelli, Gowrisankar Sreeram, Jacopo Taddei
https://arxiv.org/abs/2507.16633

Spinfoam tunneling of quantum geometries in angle variables
Tunneling processes offer a promising path for finding signatures of quantum gravity. While tunneling of geometry has long been recognized in the literature, few detailed analyses have been carried out. We investigate covariant Loop Quantum Gravity transitions in the holonomy representation, which naturally encodes the extrinsic curvature of boundary states. We study these amplitudes within the simple framework of the Ponzano-Regge spinfoam model for three-dimensional Euclidean quantum gravity.…

This https://arxiv.org/abs/2412.08556 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCC_…

Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures
Consider the scenario where multiple agents have to move in an optimal way through a network, each one towards their ending position while avoiding collisions. By optimal, we mean as fast as possible, which is evaluated by a measure known as the makespan of the proposed solution. This is the setting studied in the Multiagent Path Finding problem. In this work, we additionally provide the agents with a way to communicate with each other. Due to size constraints, it is reasonable to assume that t…

Multi-Agent Path Finding Among Dynamic Uncontrollable Agents with Statistical Safety Guarantees
Kegan J. Strawn, Thomy Phan, Eric Wang, Nora Ayanian, Sven Koenig, Lars Lindemann
https://arxiv.org/abs/2507.22282

Multi-Agent Path Finding Among Dynamic Uncontrollable Agents with Statistical Safety Guarantees
Existing multi-agent path finding (MAPF) solvers do not account for uncertain behavior of uncontrollable agents. We present a novel variant of Enhanced Conflict-Based Search (ECBS), for both one-shot and lifelong MAPF in dynamic environments with uncontrollable agents. Our method consists of (1) training a learned predictor for the movement of uncontrollable agents, (2) quantifying the prediction error using conformal prediction (CP), a tool for statistical uncertainty quantification, and (3) i…

Budget Allocation Policies for Real-Time Multi-Agent Path Finding
Raz Beck, Roni Stern
https://arxiv.org/abs/2507.16874 https://arxiv.org/pdf/2507.16874

Budget Allocation Policies for Real-Time Multi-Agent Path Finding
Multi-Agent Pathfinding (MAPF) is the problem of finding paths for a set of agents such that each agent reaches its desired destination while avoiding collisions with the other agents. Many MAPF solvers are designed to run offline, that is, first generate paths for all agents and then execute them. Real-Time MAPF (RT-MAPF) embodies a realistic MAPF setup in which one cannot wait until a complete path for each agent has been found before they start to move. Instead, planning and execution are in…