Metraipolis › archive › dc_305ecf20c557
Coordinated Motion Planning for Multi-Arm Systems via Iterative LQ Games — arXiv:2608.27726
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.27726
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T11:51:31.384Z
- SHA-256 of the archived text
86262d36bed99a6b918393c58130a9bf07e7695eaaea6378aa0bb15cda91fa92- Stable URL of this page
https://metraipolis.com/documento/dc_305ecf20c557
How to cite
Coordinated Motion Planning for Multi-Arm Systems via Iterative LQ Games — arXiv:2608.27726 — arXiv (en), https://arxiv.org/abs/2608.27726 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_305ecf20c557 (Metraipolis archive dc_305ecf20c557, sha256 86262d36bed99a6b918393c58130a9bf07e7695eaaea6378aa0bb15cda91fa92)
BibTeX
@misc{dc305ecf20c557,
title = {Coordinated Motion Planning for Multi-Arm Systems via Iterative LQ Games — arXiv:2608.27726},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.27726},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_305ecf20c557; sha256 86262d36bed99a6b918393c58130a9bf07e7695eaaea6378aa0bb15cda91fa92},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.27726. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Multi-agent motion planning for high-degree-of-freedom robotics manipulators in shared workspaces remains a fundamental yet challenging problem. Centralized planners often suffer from poor scalability, while decentralized approaches face robustness and safety concerns. Game-theoretic formulations offer a promising approach for modeling agent interactions, potentially overcoming these limitations. However, their application to articulated multi-arm systems remains limited. This paper presents an iterative Linear Quadratic (LQ) game framework for multi-manipulator motion planning, where each manipulator is modeled as an independent agent optimizing its own objective while interacting with other agents based on shared global states and collision constraints. The method solves a series of local LQ games by linearizing the dynamics and approximating the cost around a nominal trajectory, with Riccati backward recursions yielding feedback Nash strategies. To address the challenges of articulated systems, we incorporate differentiable penalties for self-collision and inter-arm collision into the optimization pipeline, enabling coordinated, collision-aware trajectory generation. Experiments demonstrate that our framework produces smooth, safe, and efficient trajectories in high-dimensional settings, outperforming traditional methods. This highlights the effectiveness of differential game formulations for multi-robot manipulation. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-31 in cs.RO). Categorie arXiv: Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2608.27726 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T11:18:08.704Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-08-31?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).