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 "q cp learning action values for cooperative planning"):
  Abstract: Research on multi-robot systems has demonstrated promising results in manifold applications and domains. Still, efficiently learning an effective robot behaviors is very difficult, due to unstructured scenarios, high uncertainties, and large state dimensionality (e.g. hyper-redundant and groups of robot). To alleviate this problem, we present Q-CP a cooperative model-based reinforcement learning algorithm, which exploits action values to both (1) guide the exploration of the state space and (2) generate effective policies. Specifically, we exploit Q-learning to attack the curse-of-dimensionality in the iterations of a Monte-Carlo Tree Search. We implement and evaluate Q-CP on different stochastic cooperative (general-sum) games: (1) a simple cooperative navigation problem among 3 robots, (2) a cooperation scenario between a pair of KUKA YouBots performing hand-overs, and (3) a coordination task between two mobile robots entering a door. The obtained results show the effectiveness of Q-CP in the chosen applications, where action values drive the exploration and reduce the computational demand of the planning process while achieving good performance.

Includes members:
  Member "cooperative inverse reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "safe imitation learning via fast bayesian reward inference from preferences")
  Member "efficient model learning from joint action demonstrations for human robot collaborative tasks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint goal and strategy inference across heterogeneous demonstrators via reward network distillation")
  Member "reinforcement and imitation learning via interactive no regret learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "learning hierarchical teaching policies for cooperative agents")
  Member "a reduction of imitation learning and structured prediction to no regret online learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "safe imitation learning via fast bayesian reward inference from preferences")
  Member "policy iteration for decentralized control of markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed policy iteration for scalable approximation of cooperative multi agent policies")
  Member "hierarchical reinforcement learning with the maxq value function decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "learning functionally decomposed hierarchies for continuous control tasks")

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)