Multi-Robot Multi-Object Rearrangement in Assignment Space
MetadataShow full item record
We present Assignment Space Planning, a new efficient robot multi-agent coordination algorithm for the PSPACE- hard problem of multi-robot multi-object push rearrangement. In both simulated and real robot experiments, we demonstrate that our method produces optimal solutions for simple problems and exhibits novel emergent behaviors for complex scenarios. Assignment Space takes advantage of the domain structure by splitting the planning up into three stages, effectively reducing the search space size and enabling the planner to produce optimized plans in seconds. Our algorithm finds solutions of comparable quality to complete configuration space search while reducing the computing time to seconds, which allows our approach to be applied in practical scenarios in real-time.
Showing items related by title, author, creator and subject.
Lee, Chungki; Ammar, Mostafa H. (Mostafa Hamed); Burns, James Edward (Georgia Institute of Technology, 1993)In [LBA93], a suite of randomized broadcast protocols was presented for the problem of broadcasting a message in arbitrary multi-hop radio networks. These protocols improved upon that of Bar-Yehuda et al. in most of the ...
Alhadeff, Heather; Calvert, Christopher M.; Cooper, Darren; Hatton, Tim; Howard, Herman H.; Phillips, Marion; Strickland, Katrina (Georgia Institute of Technology, 2013-11-07)A discussion about the Multi-Modal Passenger Terminal, a ground-breaking transportation project in downtown Atlanta from those directly involved in the different aspects of the project.
Ma, Xiaoli; Wen, Qingsong (2017-07-11)Embodiments of the present invention provide efficient greedy LLL algorithms that not only converge faster but also exhibit much lower complexity than the existing greedy LLL variants while similar error performance is ...