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 multi arm task and motion planning for pick and place of individual objects via handoffs"):
  Abstract: Automation applications are pushing the deployment of many high DoF manipulators in warehouse and manufacturing environments. This has motivated many efforts on optimizing manipulation tasks involving a single arm. Coordinating multiple arms for manipulation, however, introduces additional computational challenges arising from the increased DoFs, as well as the combinatorial increase in the available operations that many manipulators can perform, including handoffs between arms. The focus here is on the case of pick-and-place tasks, which require a sequence of handoffs to be executed, so as to achieve computational efficiency, asymptotic optimality and practical anytime performance. The paper leverages recent advances in multi-robot motion planning for high DoF systems to propose a novel multi-modal extension of the dRRT* algorithm. The key insight is that, instead of naively solving a sequence of motion planning problems, it is computationally advantageous to directly explore the composite space of the integrated multi-arm task and motion planning problem, given input sets of possible pick and handoff configurations. Asymptotic optimality guarantees are possible by sampling additional picks and handoffs over time. The evaluation shows that the approach finds initial solutions fast and improves their quality over time. It also succeeds in finding solutions to harder problem instances relative to alternatives and can scale effectively as the number of robots increases.

Includes members:
  Member "drrt scalable and informed asymptotically optimal multi robot motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sample complexity of probabilistic roadmaps via e nets")
  Member "towards robust product packing with a minimalistic end effector":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "object rearrangement with nested nonprehensile manipulation actions")
  Member "admissible abstractions for near optimal task and motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reactive navigation in partially familiar planar environments using semantic perceptual feedback")
  Member "fast high quality dual arm rearrangement in synchronous monotone tabletop setups":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on rearrangement of items stored in stacks")
  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 "scalable asymptotically optimal multi robot motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "drrt scalable and informed asymptotically optimal multi robot motion planning")
  Member "analysis and observations from the first amazon picking challenge":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "robust 6d object pose estimation by learning rgb d features")
  Member "finding a needle in an exponential haystack discrete rrt for exploration of implicit roadmaps in multi robot motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "drrt scalable and informed asymptotically optimal multi robot motion planning")

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)