human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "efficient multi agent motion planning in continuous workspaces using medial axis based swap graphs"):
  Abstract: We present an algorithm for homogeneous, labeled, and disk-shaped multi-agent motion planning in continuous workspaces with arbitrarily-shaped obstacles. Our method consists of two steps. First, we convert the continuous free space into a discrete graph where agents are placed on vertices and move along edges. On the graph, a set of swap operations are defined and we ensure that performing these swap operations will not lead to collisions between agents or with obstacles. Second, we prove that it is possible for agents' locations to be arbitrarily permuted on graph vertices using our swap operations, as long as these graph vertices are not fully occupied. In other words, a multi-agent motion planning problem on our graph is always solvable. Finally, we show that such continuous-to-discrete conversion can be performed efficiently with the help of a medial axis analysis and can be performed robustly for workspaces with arbitrarily-shaped obstacles. Moreover, the resulting graph has many vertices and can accommodate a large number of densely packed agents (up to $69\%$ of the volume of free space), and motion plans can be computed $10\times$ faster using our swap operations compared to state-of-the-art methods.

Includes members:
  Member "the starcraft multi agent challenge":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multi agent reinforcement learning with emergent roles")
  Member "sear a polynomial time multi robot path planning algorithm with expected constant factor optimality guarantee":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multi robot path planning via genetic programming")
  Member "average case constant factor time and distance optimal multi robot path planning in well connected environments":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "constant factor time optimal multi robot routing on high dimensional grids in mostly sub quadratic time")
  Member "lifelong multi agent path finding for online pickup and delivery tasks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a job assignment heuristic for lifelong multi agent path finding problem with multiple delivery locations")
  Member "motion planning for unlabeled discs with optimality guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "drrt scalable and informed asymptotically optimal multi robot motion planning")
  Member "optimal multi robot path planning on graphs structure and computational complexity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multi agent path finding with continuous time viewed through satisfiability modulo theories smt")
  Member "pebble motion on graphs with rotations efficient feasibility tests and planning algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multi robot path planning via genetic programming")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.RO(Robotics)