2000 character limit reached
Computing Motion Plans for Assembling Particles with Global Control
Published 6 Jul 2023 in cs.RO | (2307.02873v1)
Abstract: We investigate motion planning algorithms for the assembly of shapes in the \emph{tilt model} in which unit-square tiles move in a grid world under the influence of uniform external forces and self-assemble according to certain rules. We provide several heuristics and experimental evaluation of their success rate, solution length, runtime, and memory consumption.
- Relocation with uniform external control in limited directions. The 22nd Japan Conference on Discrete and Computational Geometry, Graphs, and Games, JCDCGGG, pages 39–40, 2019.
- Hierarchical shape construction and complexity for slidable polyominoes under uniform external forces. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2625–2641, 2020.
- Full tilt: Universal constructors for general shapes with uniform external forces. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2689–2708, 2019.
- Reconfiguring massive particle swarms with limited, global control. In ALGOSENSORS, pages 51–66, 2013.
- Particle computation: Designing worlds to control robot swarms with only global signals. In Proceedings - IEEE International Conference on Robotics and Automation, pages 6751–6756, 2014.
- Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform, External Forces. In Proceedings - IEEE International Conference on Robotics and Automation, pages 2508–2514, 2020.
- Tilt Assembly: Algorithms for Micro-Factories that Build Objects with Uniform External Forces. In International Symposium on Algorithms and Computation (ISAAC), volume 92, pages 11:1–11:13, 2017.
- Computing motion plans for assembling particles with global control. In IEEE International Conference on Intelligent Robots and Systems, 2023.
- B. Bonet and H. Geffner. Planning as heuristic search. Artificial Intelligence, 129(1-2):5–33, 2001.
- Hardness of reconfiguring robot swarms with uniform external control in limited directions. Journal of Information Processing, 28:782–790, 2020.
- Relocating Units in Robot Swarms with Uniform Control Signals is PSPACE-Complete. In Proc. 32th Canadian Conference on Computational Geometry, pages 49–55, 2020.
- Fast reconfiguration of robot swarms with uniform control signals. Natural Computing, 20(4):659–669, 2021.
- European Mathematical Society. Hausdorff metric. In Encyclopedia of Mathematics. EMS Press, 2022.
- On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE-Hardness of the "Warehouseman’s Problem". The International Journal of Robotics Research, 3(4):76–88, 1984.
- Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation, 12(4):566–580, 1996.
- Particle-based assembly using precise global control. Algorithmica, 84(10):2871–2897, 2022.
- Gathering physical particles with a global magnetic field using reinforcement learning. In IEEE/RSJ IROS, pages 10126–10132, 2022.
- S. M. Lavalle. Rapidly-Exploring Random Trees: A New Tool for Path Planning. Technical report, Iowa State University, 1998.
- Efficient parallel Self-Assembly under uniform control inputs. IEEE Robotics and Automation Letters, 3(4):3521–3528, 2018.
- J. T. Schwartz and M. Sharir. On the piano movers’ problem: Iii. coordinating the motion of several independent bodies: The special case of circular bodies moving amidst polygonal barriers. The International Journal of Robotics Research, 2(3):46–75, 1983.
- X. Yun and K. C. Tan. Wall-following method for escaping local minima in potential field based motion planning. In 1997 8th International Conference on Advanced Robotics. Proceedings. ICAR’97, pages 421–426. IEEE, 1997.
- Rearranging agents in a small space using global controls. In IEEE/RSJ IROS, pages 3576–3582. IEEE, 2017.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.