Efficiently reconfiguring a connected swarm of labeled robots
-
Published:2024-08-07
Issue:2
Volume:38
Page:
-
ISSN:1387-2532
-
Container-title:Autonomous Agents and Multi-Agent Systems
-
language:en
-
Short-container-title:Auton Agent Multi-Agent Syst
Author:
Fekete Sándor P.,Kramer Peter,Rieck Christian,Scheffer Christian,Schmidt Arne
Abstract
AbstractWhen considering motion planning for a swarm of n labeled robots, we need to rearrange a given start configuration into a desired target configuration via a sequence of parallel, collision-free moves. The objective is to reach the new configuration in a minimum amount of time. Problems of this type have been considered before, with recent notable results achieving constant stretch for parallel reconfiguration: If mapping the start configuration to the target configuration requires a maximum Manhattan distance of d, the total duration of an overall schedule can be bounded to $$\mathcal {O}(d)$$
O
(
d
)
, which is optimal up to constant factors. An important constraint for coordinated reconfiguration is to keep the swarm connected after each time step. In previous work, constant stretch could only be achieved if disconnected reconfiguration is allowed, or for scaled configurations of unlabeled robots; on the other hand, the existence of non-constant lower bounds on the stretch factor was unknown. We resolve these major open problems by (1) establishing a lower bound of $$\Omega (\sqrt{n})$$
Ω
(
n
)
for connected, labeled reconfiguration and, most importantly, by (2) proving that for scaled arrangements, constant stretch for connected, labeled reconfiguration can be achieved. In addition, we show that (3) it is -complete to decide whether a makespan of 2 can be achieved, while it is possible to check in polynomial time whether a schedule of makespan 1 exists.
Funder
Deutsche Forschungsgemeinschaft Technische Universität Braunschweig
Publisher
Springer Science and Business Media LLC
Reference51 articles.
1. Adler, A., de Berg, M., Halperin, D., & Solovey, K. (2015). Efficient multi-robot motion planning for unlabeled discs in simple polygons. IEEE Transactions on Automation Science and Engineering, 12(4), 1309–1317. https://doi.org/10.1109/TASE.2015.2470096 2. Agarwal, P. K., Geft, T., Halperin, D., & Taylor, E. (2023). Multi-robot motion planning for unit discs with revolving areas. Computational Geometry: Theory & Applications, 114, 102019. https://doi.org/10.1016/J.COMGEO.2023.102019 3. Akitaya, H. A., Arkin, E. M., Damian, M., Demaine, E. D., Dujmovic, V., Flatland, R. Y., Korman, M., Palop, B., Parada, I., van Renssen, A., & Sacristán, V. (2021). Universal reconfiguration of facet-connected modular robots by pivots: The O(1) musketeers. Algorithmica, 83(5), 1316–1351. https://doi.org/10.1007/s00453-020-00784-6 4. Akitaya, H. A., Demaine, E. D., Korman, M., Kostitsyna, I., Parada, I., Sonke, W., Speckmann, B., Uehara, R., & Wulms, J. (2022). Compacting squares: Input-sensitive in-place reconfiguration of sliding squares. In Scandinavian symposium and workshops on algorithm theory (SWAT) (pp. 1–19). https://doi.org/10.4230/LIPIcs.SWAT.2022.4 5. Becker, A. T., Fekete, S. P., Keldenich, P., Konitzny, M., Lin, L., & Scheffer, C. (2018). Coordinated motion planning: The video. In Symposium on computational geometry (SoCG) (pp. 1–6). Video at https://www.ibr.cs.tu-bs.de/users/fekete/Videos/CoordinatedMotionPlanning.mp4. https://doi.org/10.4230/LIPIcs.SoCG.2018.74
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
|
|