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 "average case constant factor time and distance optimal multi robot path planning in well connected environments"):
  Abstract: Fast algorithms for optimal multi-robot path planning are sought after in real-world applications. Known methods, however, generally do not simultaneously guarantee good solution optimality and good (e.g., polynomial) running time. In this work, we develop a first low-polynomial running time algorithm, called SplitAngGroup (SaG), that solves the multi-robot path planning problem on grids and grid-like environments, and produces constant factor makespan optimal solutions on average over all problem instances. That is, SaG is an average case O(1)-approximation algorithm and computes solutions with sub-linear makespan. SaG is capable of handling cases when the density of robots is extremely high - in a graph-theoretic setting, the algorithm supports cases where all vertices of the underlying graph are occupied. SaG attains its desirable properties through a careful combination of a novel divide-and-conquer technique, which we denote as global decoupling, and network flow based methods for routing the robots. Solutions from SaG, in a weaker sense, are also a constant factor approximation on total distance optimality.

Includes members:
  Member "lifelong multi agent path finding for online pickup and delivery tasks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient multi agent motion planning in continuous workspaces using medial axis based swap graphs")
  Member "sear a polynomial time expected constant factor optimal algorithmic framework for multi robot path planning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "constant factor time optimal multi robot routing on high dimensional grids in mostly sub quadratic time")
  Member "motion planning for unlabeled discs with optimality guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "drrt scalable and informed asymptotically optimal multi robot motion planning")
  Member "on the hardness of unlabeled multi robot motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "drrt scalable and informed asymptotically optimal multi robot motion planning")
  Member "efficient multi robot motion planning for unlabeled discs in simple polygons":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "drrt scalable and informed asymptotically optimal multi robot motion planning")
  Member "a linear time algorithm for the feasibility of pebble motion on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sear a polynomial time multi robot path planning algorithm with expected constant factor optimality guarantee")
  Member "k color multi robot motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "drrt scalable and informed asymptotically optimal multi robot motion planning")
  Member "distance optimal formation control on graphs with a tight convergence time guarantee":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "ddm fast near optimal multi robot path planning using diversified path and optimal sub problem solution database heuristics")

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)