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 "anytime integrated task and motion policies for stochastic environments"):
  Abstract: In order to solve complex, long-horizon tasks, intelligent robots need to be able to carry out high-level, abstract planning and reasoning in conjunction with motion planning. However, abstract models are typically lossy and plans or policies computed using them are often unexecutable in practice. These problems are aggravated in more realistic situations with stochastic dynamics, where the robot needs to reason about, and plan for multiple possible contingencies. We present a new approach for integrated task and motion planning in such settings. In contrast to prior work in this direction, we show that our approach can effectively compute integrated task and motion policies with branching structure encoding agent behaviors for various possible contingencies. We prove that our algorithm is probabilistically complete and can compute feasible solution policies in an anytime fashion so that the probability of encountering an unresolved contingency decreases over time. Empirical results on a set of challenging problems show the utility and scope of our methods.

Includes members:
  Member "sampling based methods for factored task and motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reactive navigation in partially familiar planar environments using semantic perceptual feedback")
  Member "active model learning and diverse action sampling for task and motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "epsilon shotgun epsilon greedy batch bayesian optimisation")
  Member "stripstream integrating symbolic planners and blackbox samplers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "transferable task execution from pixels through deep planning domain learning")
  Member "an anytime algorithm for task and motion mdps":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "online replanning in belief space for partially observable task and motion problems")
  Member "ffrob leveraging symbolic planning for efficient task and motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deep compositional robotic planners that follow natural language commands")
  Member "deep reinforcement learning in parameterized action space":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "striving for simplicity and performance in off policy drl output normalization and non uniform sampling")

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.AI(Artificial Intelligence)