ITA-LaCAM: A Complete and Scalable TAPF Solver via Assignment-Aware Configuration-Space Search

Published September 15, 2026 · Category: Robotics

Overview

arXiv:2609.14208v1 Announce Type: new Abstract: Combined Target Assignment and Path Finding (TAPF) requires assigning targets for agents while simultaneously planning collision-free paths. We present ITA-LaCAM, a complete and scalable TAPF solver inspired by LaCAM and ITA-CBS. In ITA-LaCAM, each joint-configuration node carries an agent-to-target matching. When a successor is generated, ITA-LaCAM incrementally repairs the matching for the agents that moved and uses the targets to guide PIBT successor generation. This design enables adaptive reassignment without explicitly enumerating the combinatorial assignment space, while preserving LaCAM's completeness and scalability. Across 9,760 benchmark instances on eight maps with 5--200 agents, ITA-LaCAM solved 100% of the instances, compared with 95.6% for IR-TAPF configured with DBS-Hungarian. ITA-LaCAM found an initial solution faster in 84.0% of the comparisons and achieved a lower sum of costs in 65.0% of the instances solved by both methods.

Source

Originally published at arxiv.org.

Related Articles

• Conflict-Predictive Variable Horizons in Multi-Drone Distributed Model Predictive Control
• IMM-based Multiple Object Tracking using a State Prediction Neural Network
• Constraint-Grounded Reinforcement Learning for Variable Impedance Control in Contact-Rich Robotic Insertion