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 "multi robot path planning via genetic programming"):
  Abstract: This paper presents a Genetic Programming (GP) approach to solving multi-robot path planning (MRPP) problems in single-lane workspaces, specifically those easily mapped to graph representations. GP's versatility enables this approach to produce programs optimizing for multiple attributes rather than a single attribute such as path length or completeness. When optimizing for the number of time steps needed to solve individual MRPP problems, the GP constructed programs outperformed complete MRPP algorithms, i.e. Push-Swap-Wait (PSW), by $54.1\%$. The GP constructed programs also consistently outperformed PSW in solving problems that did not meet PSW's completeness conditions. Furthermore, the GP constructed programs exhibited a greater capacity for scaling than PSW as the number of robots navigating within an MRPP environment increased. This research illustrates the benefits of using Genetic Programming for solving individual MRPP problems, including instances in which the number of robots exceeds the number of leaves in the tree-modeled workspace.

Includes members:
  Member "coordinating the motion of labeled discs with optimality guarantees under extreme density":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "ddm fast near optimal multi robot path planning using diversified path and optimal sub problem solution database heuristics")
  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 "efficient multi agent motion planning in continuous workspaces using medial axis based swap graphs")
  Member "multi agent path finding with deadlines":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi agent pathfinding definitions variants and benchmarks")
  Member "pebble motion on graphs with rotations efficient feasibility tests and planning algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efficient multi agent motion planning in continuous workspaces using medial axis based swap graphs")
  Member "mapp a scalable multi agent path planning algorithm with tractability and completeness guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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)