Sign inGet started
Paper · arXiv

GAMBIT: Learning to Plan Continuous Multi-Robot Trajectories

GAMBIT is an opening chess move in which a player sacrifices a piece, typically a pawn, to gain a positional advantage later in the game. Analogously, in multi-robot coordination, individual robots may need to forgo locally reward-maximising behaviours to improve overall team performance. Such self-sacrificial behaviours are difficult to capture with manually designed heuristics, particularly in dense, interaction-rich environments. Focusing on double-integrator continuous dynamics, this work studies how to learn such coordinated heuristics over motion primitives for multi-robot trajectory execution. Our framework, GAMBIT, first learns coordinated motion-primitive selection through imitat...

AuthorsRishabh Jain, Akmaral Moldagalieva, Lorenzo Magnino et al.
Primary categorycs.RO
Published5 October 2026
Last updated at source5 October 2026
cs.ROcs.AIcs.LGcs.MA
Embed this entry
<iframe src="https://silytics.si/embed/item/8007add6-f9d0-4037-b7ea-7d1a066ed56a" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 2 days

0 now. Counts as reported by the source, snapshotted daily by Silytics.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.