Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchProduse AI

analiza aiqbench

This research introduces WNumMPC, a hierarchical control framework that uses reinforcement learning to leverage topological winding numbers for symmetry-breaking in decentralized multi-agent navigation. By combining a learned planner with a model-based controller, the method effectively prevents deadlocks and collisions without requiring agents to communicate intentions or future trajectories. The study demonstrates robust sim-to-real transfer, confirming its practical utility for dense robotic environments where traditional coordination fails due to inherent symmetries.
Sursă care acoperăarXiv
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Symmetry-Breaking in Multi-Agent Navigation: Winding Number-Aware MPC with a Learned Topological Strategy

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2511.15239v3 Announce Type: replace Abstract: In decentralized multi-agent navigation, agents that independently compute their controls without communicating goals or intentions can fall into symmetry-induced deadlocks because each agent must decide how to pass others. We study this problem under the assumption that each agent has access to the current observable states of other agents, including their positions, velocities, and radii, while their goals, intentions, and future trajectories remain unobserved. To address this problem, we propose WNumMPC, a hierarchical navigation method that quantifies cooperative symmetry-breaking strategies via a topological invariant, the winding number, and learns such strategies through reinforcement learning. The learning-based Planner outputs continuous-valued signed target winding numbers and dynamic importance weights to prioritize critical interactions in dense crossings. Then, the model-based Controller generates collision-free and efficient motions based on the strategy and weights provided by the Planner. Simulation and real-world robot experiments indicate that WNumMPC effectively avoids deadlocks and collisions and achieves better performance than the baselines, particularly in dense and symmetry-prone scenarios. These experiments also suggest that explicitly leveraging winding numbers yields robust sim-to-real transfer with minimal performance degradation. The code for the experiments is available at https://github.com/omron-sinicx/WNumMPC.

Abstract:In decentralized multi-agent navigation, agents that independently compute their controls without communicating goals or intentions can fall into symmetry-induced deadlocks because each agent must decide how to pass others. We study this problem under the assumption that each agent has access to the current observable states of other agents, including their positions, velocities, and radii, while their goals, intentions, and future trajectories remain unobserved. To address this problem, we propose WNumMPC, a hierarchical navigation method that quantifies cooperative symmetry-breaking strategies via a topological invariant, the winding number, and learns such strategies through reinforcement learning. The learning-based Planner outputs continuous-valued signed target winding numbers and dynamic importance weights to prioritize critical interactions in dense crossings. Then, the model-based Controller generates collision-free and efficient motions based on the strategy and weights provided by the Planner. Simulation and real-world robot experiments indicate that WNumMPC effectively avoids deadlocks and collisions and achieves better performance than the baselines, particularly in dense and symmetry-prone scenarios. These experiments also suggest that explicitly leveraging winding numbers yields robust sim-to-real transfer with minimal performance degradation. The code for the experiments is available at this https URL.

Robotics (cs.RO); Multiagent Systems (cs.MA)

arXiv:2511.15239 [cs.RO]

(or arXiv:2511.15239v3 [cs.RO] for this version)

https://doi.org/10.48550/arXiv.2511.15239 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 281 cuvinte

Subiecte conexe