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 "ddm fast near optimal multi robot path planning using diversified path and optimal sub problem solution database heuristics"):
  Abstract: We propose a novel centralized and decoupled algorithm, DDM*, for solving one-shot and dynamic optimal multi-robot path planning problems in a graph-based setting. Among other techniques, DDM* is mainly enabled through exploiting two innovative heuristics: path diversification and optimal sub-problem solution databases. The two heuristics attack two distinct phases of a decoupling-based planner: while path diversification allows more effective use of the entire workspace for robot travel, optimal sub-problem solution databases facilitate the fast resolution of local path conflicts. Extensive evaluation demonstrates that DDM* achieves both great scalability and a high level of solution optimality.

Includes members:
  Member "multi agent pathfinding definitions variants and benchmarks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "idle time optimization for target assignment and path finding in sortation centers")
  Member "priority inheritance with backtracking for iterative multi agent path finding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "winpibt expanded prioritized algorithm for iterative multi agent path finding")
  Member "automatic algorithm selection in multi agent pathfinding":
    also connected through other hyperedges:
      (none)
  Member "coordinating the motion of labeled discs with optimality guarantees under extreme density":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi robot path planning via genetic programming")
  Member "x anytime multiagent planning with bounded search":
    also connected through other hyperedges:
      (none)
  Member "constant factor time optimal multi robot routing on high dimensional grids in mostly sub quadratic time":
    also connected through other hyperedges:
      (none)
  Member "lifelong multi agent path finding for online pickup and delivery tasks":
    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 "learning the problem optimum map analysis and application to global optimization in robotics":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "discontinuity sensitive optimal control learning by mixture of experts")

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)